S. Dobrev

Most-cited papers

Mobile Search for a Black Hole in an Anonymous Ring
S. Dobrev, P. Flocchini, G. Prencipe, N. Santoro
2001Algorithmica132 citations
Semantic Scholar
Searching for a black hole in arbitrary networks: optimal mobile agents protocols
S. Dobrev, P. Flocchini, G. Prencipe, N. Santoro
2006Distributed computing112 citations Open access
Semantic Scholar
Measuring the problem-relevant information in input
S. Dobrev, Rastislav Královič, Dana Pardubská
2009RAIRO - Theoretical Informatics and Applications91 citations
Semantic Scholar
How Much Information about the Future Is Needed?
S. Dobrev, Rastislav Královič, Dana Pardubská
2008Conference on Current Trends in Theory and Practice of Informatics71 citations
Semantic Scholar
Online Graph Exploration with Advice
S. Dobrev, Rastislav Královič, Euripides Markou
2012Colloquium on Structural Information & Communication Complexity68 citations
Semantic Scholar
Multiple Agents RendezVous in a Ring in Spite of a Black Hole
S. Dobrev, P. Flocchini, G. Prencipe, N. Santoro
2003International Conference on Principles of Distributed Systems67 citations
Semantic Scholar
Searching for a black hole in arbitrary networks: optimal mobile agent protocols
S. Dobrev, P. Flocchini, G. Prencipe, N. Santoro
2002ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing66 citations
Semantic Scholar
Complexity of Barrier Coverage with Relocatable Sensors in the Plane
S. Dobrev, Stephane Durocher, M. Hesari, Konstantinos Georgiou +6 more
2013International/Italian Conference on Algorithms and Complexity62 citations Open access
Semantic Scholar
Black hole search in common interconnection networks
S. Dobrev, P. Flocchini, Rastislav Královič, P. Ruzicka +2 more
2006Networks62 citations
Semantic Scholar
Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph
Edgar Chávez, S. Dobrev, E. Kranakis, J. Opatrny +3 more
2005International Conference on Principles of Distributed Systems43 citations
Semantic Scholar
Using Scattered Mobile Agents to Locate a Black Hole in an un-Oriented Ring with Tokens
S. Dobrev, N. Santoro, Wei Shi
2008International Journal of Foundations of Computer Science41 citations
Semantic Scholar
Black Hole Search in Asynchronous Rings Using Tokens
S. Dobrev, Rastislav Královič, N. Santoro, Wei Shi
2006International/Italian Conference on Algorithms and Complexity41 citations Open access
Semantic Scholar
Distributed exploration of dynamic rings
Giuseppe Antonio Di Luna, S. Dobrev, P. Flocchini, N. Santoro
2018Distributed computing39 citations
Semantic Scholar
Black Hole Search in Directed Graphs
J. Czyzowicz, S. Dobrev, Rastislav Královič, Stanislav Miklík +1 more
2009Colloquium on Structural Information & Communication Complexity37 citations
Semantic Scholar
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
J. Czyzowicz, S. Dobrev, T. Fevens, H. González-Aguilar +3 more
2008Latin American Symposium on Theoretical Informatics37 citations
Semantic Scholar
Exploring an unknown dangerous graph using tokens
S. Dobrev, P. Flocchini, Rastislav Královič, N. Santoro
2013Theoretical Computer Science34 citations Open access
Semantic Scholar
Improved Bounds for Optimal Black Hole Search with a Network Map
S. Dobrev, P. Flocchini, N. Santoro
2004Colloquium on Structural Information & Communication Complexity34 citations
Semantic Scholar
Live Exploration of Dynamic Rings
Giuseppe Antonio Di Luna, S. Dobrev, P. Flocchini, N. Santoro
2015IEEE International Conference on Distributed Computing Systems33 citations Open access
Semantic Scholar
Exploring an Unknown Graph to Locate a Black Hole Using Tokens
S. Dobrev, P. Flocchini, Rastislav Královič, N. Santoro
2006IFIP TCS32 citations Open access
Semantic Scholar
Finding Short Right-Hand-on-the-Wall Walks in Graphs
S. Dobrev, J. Jansson, K. Sadakane, Wing-Kin Sung
2005Colloquium on Structural Information & Communication Complexity32 citations Open access
Semantic Scholar
Leader Election in Rings with Nonunique Labels
S. Dobrev, A. Pelc
2003Fundamenta Informaticae32 citations
Semantic Scholar
Evacuating two robots from multiple unknown exits in a circle
J. Czyzowicz, S. Dobrev, Konstantinos Georgiou, E. Kranakis +1 more
2016Theoretical Computer Science31 citations Open access
Semantic Scholar
Strong Connectivity in Sensor Networks with given Number of Directional Antennae of Bounded Angle
S. Dobrev, E. Kranakis, D. Krizanc, J. Opatrny +2 more
2010Discret. Math. Algorithms Appl.30 citations
Semantic Scholar
Optimal Broadcasting in Hypercubes with Dynamic Faults
S. Dobrev, I. Vrto
1999Information Processing Letters27 citations
Semantic Scholar
More efficient periodic traversal in anonymous undirected graphs
J. Czyzowicz, S. Dobrev, L. Gąsieniec, D. Ilcinkas +6 more
2009Theoretical Computer Science25 citations Open access
Semantic Scholar
Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
Edgar Chávez, S. Dobrev, E. Kranakis, J. Opatrny +2 more
2006Latin American Symposium on Theoretical Informatics25 citations
Semantic Scholar
Scattered Black Hole Search in an Oriented Ring using Tokens
S. Dobrev, N. Santoro, Wei Shi
2007IEEE International Parallel and Distributed Processing Symposium21 citations
Semantic Scholar
Antibandwidth and cyclic antibandwidth of Hamming graphs
S. Dobrev, Rastislav Královič, Dana Pardubská, L'ubomír Török +1 more
2009Discrete Applied Mathematics20 citations Open access
Semantic Scholar
Black Hole Search by Mobile Agents in Hypercubes and Related Networks
S. Dobrev, P. Flocchini, Rastislav Královič, G. Prencipe +2 more
2002International Conference on Principles of Distributed Systems20 citations
Semantic Scholar
Towards practical deteministic write-all algorithms
Bogdan S. Chlebus, S. Dobrev, D. Kowalski, G. Malewicz +2 more
2001ACM Symposium on Parallelism in Algorithms and Architectures20 citations
Semantic Scholar
Locating a Black Hole in an Un-oriented Ring Using Tokens: The Case of Scattered Agents
S. Dobrev, N. Santoro, Wei Shi
2007European Conference on Parallel Processing19 citations
Semantic Scholar
Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search
S. Dobrev, P. Flocchini, N. Santoro
2006IEEE International Conference on Distributed Computing Systems19 citations
Semantic Scholar
Optimal Broadcasting in Tori with Dynamic Faults
S. Dobrev, I. Vrto
2002Parallel Processing Letters19 citations
Semantic Scholar
On the page number of RNA secondary structures with pseudoknots
P. Clote, S. Dobrev, Iván Dotú, E. Kranakis +2 more
2012Journal of Mathematical Biology18 citations
Semantic Scholar
Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract)
S. Dobrev, Rastislav Královič, R. Královic
2012Workshop on Approximation and Online Algorithms18 citations
Semantic Scholar
Weak Coverage of a Rectangular Barrier
S. Dobrev, E. Kranakis, D. Krizanc, Manuel Lafond +5 more
2017Algorithmica15 citations Open access
Semantic Scholar
Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles
Balasingham Balamohan, S. Dobrev, P. Flocchini, N. Santoro
2012Colloquium on Structural Information & Communication Complexity13 citations
Semantic Scholar
Exploring an unknown dangerous graph with a constant number of tokens
Balasingham Balamohan, S. Dobrev, P. Flocchini, N. Santoro
2016Theoretical Computer Science12 citations Open access
Semantic Scholar
Route discovery with constant memory in oriented planar geometric networks
Edgar Chávez, S. Dobrev, E. Kranakis, J. Opatrny +2 more
2004Algorithmic Aspects of Wireless Sensor Networks12 citations Open access
Semantic Scholar
Improved analysis of the online set cover problem with advice
S. Dobrev, J. Edmonds, D. Komm, Rastislav Královič +3 more
2017Theoretical Computer Science11 citations Open access
Semantic Scholar
Traversal of a quasi-planar subdivision without using mark bits
Edgar Chávez, S. Dobrev, E. Kranakis, J. Opatrny +2 more
200418th International Parallel and Distributed Processing Symposium, 2004. Proceedings.11 citations
Semantic Scholar
Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs
S. Dobrev, Rastislav Královič, R. Královic
2014Theory of Computing Systems10 citations
Semantic Scholar
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs
J. Czyzowicz, S. Dobrev, H. González-Aguilar, Rastislav Královič +4 more
2011Theory and Applications of Models of Computation10 citations Open access
Semantic Scholar
Improved Lower Bounds for Shoreline Search
S. Dobrev, Rastislav Královič, Dana Pardubská
2020Colloquium on Structural Information & Communication Complexity9 citations Open access
Semantic Scholar
Exploration of High-Dimensional Grids by Finite Automata
S. Dobrev, Lata Narayanan, J. Opatrny, Denis Pankratov
2019International Colloquium on Automata, Languages and Programming9 citations
Semantic Scholar
Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs
S. Dobrev, E. Kranakis, O. M. Ponce, Milan Plzík
2012Computer Science Symposium in Russia8 citations
Semantic Scholar
Optimal Local Buffer Management for Information Gathering with Adversarial Traffic
S. Dobrev, Manuel Lafond, Lata Narayanan, J. Opatrny
2017ACM Symposium on Parallelism in Algorithms and Architectures7 citations
Semantic Scholar
Connectivity with directional antennas in the symmetric communication model
S. Dobrev, M. Eftekhari, F. MacQuarrie, J. Manuch +4 more
2016Computational geometry7 citations Open access
Semantic Scholar
On Fractional Dynamic Faults with Threshold
S. Dobrev, Rastislav Královič, R. Královic, N. Santoro
2006Colloquium on Structural Information & Communication Complexity7 citations Open access
Semantic Scholar
Dynamic faults have small effect on broadcasting in hypercubes
S. Dobrev, I. Vrto
2004Discrete Applied Mathematics7 citations Open access
Semantic Scholar