Papers
6
Total Citations
63
H-Index
4
About
Stefan Dobrev is a leading researcher in theoretical computer science, with a primary focus on distributed algorithms, mobile robotics, and search and evacuation problems in geometric and graph environments. His most influential work addresses the fundamental challenge of coordinating autonomous agents under limited information. In his highly cited 2016 paper, which has garnered 24 citations, Dobrev introduced a novel algorithm for evacuating two robots from multiple unknown exits on a circle, where agents lack knowledge of their own starting positions but can communicate wirelessly. This work is pivotal for understanding how to optimize worst-case evacuation time in adversarial or uncertain settings. Beyond evacuation, Dobrev has made significant contributions to periodic graph traversal, the survivability of swarms of bouncing robots, and the exploration of high-dimensional grids by finite automata. His research consistently bridges theoretical rigor with practical implications for multi-agent systems, search-and-rescue operations, and autonomous navigation. With a publication record spanning over a decade, Dobrev’s work is essential reading for students and researchers interested in the algorithmic foundations of robotics and distributed computing.
Research Focus
Key Achievements
Top Papers
- 1Evacuating two robots from multiple unknown exits in a circle24 citations · 2016
- 2Evacuating two robots from multiple unknown exits in a circle20 citations · 2016
- 3More Efficient Periodic Traversal in Anonymous Undirected Graphs7 citations · 2010
- 4Survivability of Swarms of Bouncing Robots5 citations · 2014
- 5Searching for a non-adversarial, uncooperative agent on a cycle4 citations · 2019
- 6Exploration of High-Dimensional Grids by Finite Automata3 citations · 2019