Linear Broadcasting and N loglog N Election in Unoriented Hypercubes. - Stefan Dobrev; Peter Ruzicka (SIROCCO, 1997)

An Alternative View on Sense of Direction (Position paper). - Stefan Dobrev (SIROCCO, 1998)

Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes. - Stefan Dobrev; Peter Ruzicka; Gerard Tel (SIROCCO, 1998)

Yet Another Modular Technique for Efficient Leader Election. - Stefan Dobrev; Peter Ruzicka (SOFSEM, 1998)

Broadcasting on Anonymous Unoriented Tori. - Stefan Dobrev; Peter Ruzicka (WG, 1998)

Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages. - Krzysztof Diks; Stefan Dobrev; Evangelos Kranakis; Andrzej Pelc; Peter Ruzicka (Inf. Process. Lett., 1998)

On the Communication Complexity of Strong Time-Optimal Distributed Algorithms. - Stefan Dobrev; Peter Ruzicka (Nord. J. Comput., 1998)

Leader Election using Any Sense of Direction. - Stefan Dobrev (SIROCCO, 1999)

Two Broadcasting Problems in Faulty Hypercubes. - Stefan Dobrev; Imrich Vrto (WG, 1999)

Optimal Broadcasting in Hypercubes with Dynamic Faults. - Stefan Dobrev; Imrich Vrto (Inf. Process. Lett., 1999)

Optimal Broadcasting in Even Tori with Dynamic Faults (Research Note). - Stefan Dobrev; Imrich Vrto (Euro-Par, 2000)

Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks. - Stefan Dobrev (MFCS, 2000)

Efficient wakeup in anonymous oriented complete graphs. - Stefan Dobrev (SIROCCO, 2000)

Evolutionary graph colouring. - Stefan Dobrev; Heiko Schröder 001; Ondrej Sýkora; Imrich Vrto (Inf. Process. Lett., 2000)

Leader Election in Abelian Cayley Graphs. - Lali Barrière; Stefan Dobrev (SIROCCO, 2001)

Towards practical deteministic write-all algorithms. - Bogdan S. Chlebus; Stefan Dobrev; Dariusz R. Kowalski; Grzegorz Malewicz; Alexander A. Shvartsman; Imrich Vrto (SPAA, 2001)

Black Hole Search by Mobile Agents in Hypercubes and Related Networks. - Stefan Dobrev; Paola Flocchini; Rastislav Kralovic; Giuseppe Prencipe; Peter Ruzicka; Nicola Santoro (OPODIS, 2002)

Searching for a black hole in arbitrary networks: optimal mobile agent protocols. - Stefan Dobrev; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (PODC, 2002)

Optimal Broadcasting in Tori with Dynamic Faults. - Stefan Dobrev; Imrich Vrto (Parallel Process. Lett., 2002)

Multiple Agents RendezVous in a Ring in Spite of a Black Hole. - Stefan Dobrev; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (OPODIS, 2003)

Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults. - Stefan Dobrev (Theory Comput. Syst., 2003)

Improved Bounds for Optimal Black Hole Search with a Network Map. - Stefan Dobrev; Paola Flocchini; Nicola Santoro (SIROCCO, 2004)

Dynamic faults have small effect on broadcasting in hypercubes. - Stefan Dobrev; Imrich Vrto (Discret. Appl. Math., 2004)

Leader Election in Rings with Nonunique Labels. - Stefan Dobrev; Andrzej Pelc (Fundam. Informaticae, 2004)

Computing input multiplicity in anonymous synchronous networks with dynamic faults. - Stefan Dobrev (J. Discrete Algorithms, 2004)

Traversal of a quasi-planar subdivision without using mark bits. - Edgar Chávez; Stefan Dobrev; Evangelos Kranakis; Jaroslav Opatrny; Ladislav Stacho; Jorge Urrutia (J. Interconnect. Networks, 2004)

Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph. - Edgar Chávez; Stefan Dobrev; Evangelos Kranakis; Jaroslav Opatrny; Ladislav Stacho; Héctor Tejeda; Jorge Urrutia (OPODIS, 2005)

Finding Short Right-Hand-on-the-Wall Walks in Graphs. - Stefan Dobrev; Jesper Jansson 001; Kunihiko Sadakane; Wing-Kin Sung (SIROCCO, 2005)

Black Hole Search in Asynchronous Rings Using Tokens. - Stefan Dobrev; Rastislav Kralovic; Nicola Santoro; Wei Shi 001 (CIAC, 2006)

Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search. - Stefan Dobrev; Paola Flocchini; Nicola Santoro (ICDCS, 2006)

Exploring an Unknown Graph to Locate a Black Hole Using Tokens. - Stefan Dobrev; Paola Flocchini; Rastislav Kralovic; Nicola Santoro (IFIP TCS, 2006)

Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges. - Edgar Chávez; Stefan Dobrev; Evangelos Kranakis; Jaroslav Opatrny; Ladislav Stacho; Jorge Urrutia (LATIN, 2006)

On Fractional Dynamic Faults with Threshold. - Stefan Dobrev; Rastislav Kralovic; Richard Královic; Nicola Santoro (SIROCCO, 2006)

Searching for a black hole in arbitrary networks: optimal mobile agents protocols. - Stefan Dobrev; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (Distributed Comput., 2006)

Exploring Planar Graphs Using Unoriented Maps. - Krzysztof Diks; Stefan Dobrev; Andrzej Pelc (J. Interconnect. Networks, 2006)

Route discovery with constant memory in oriented planar geometric networks. - Edgar Chávez; Stefan Dobrev; Evangelos Kranakis; Jaroslav Opatrny; Ladislav Stacho; Jorge Urrutia (Networks, 2006)

Black hole search in common interconnection networks. - Stefan Dobrev; Paola Flocchini; Rastislav Kralovic; Peter Ruzicka; Giuseppe Prencipe; Nicola Santoro (Networks, 2006)

Locating a Black Hole in an Un-oriented Ring Using Tokens: The Case of Scattered Agents. - Stefan Dobrev; Nicola Santoro; Wei Shi 001 (Euro-Par, 2007)

Scattered Black Hole Search in an Oriented Ring using Tokens. - Stefan Dobrev; Nicola Santoro; Wei Shi 001 (IPDPS, 2007)

Mobile Search for a Black Hole in an Anonymous Ring. - Stefan Dobrev; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (Algorithmica, 2007)

Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes. - Jurek Czyzowicz; Stefan Dobrev; Thomas Fevens; Hernán González-Aguilar; Evangelos Kranakis; Jaroslav Opatrny; Jorge Urrutia (LATIN, 2008)

Leader Election in Extremely Unreliable Rings and Complete Networks. - Stefan Dobrev; Rastislav Kralovic; Dana Pardubská (OPODIS, 2008)

The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring. - Jurek Czyzowicz; Stefan Dobrev; Evangelos Kranakis; Danny Krizanc (SOFSEM, 2008)

How Much Information about the Future Is Needed? - Stefan Dobrev; Rastislav Kralovic; Dana Pardubská (SOFSEM, 2008)

Using Scattered Mobile Agents to Locate a Black Hole in an un-Oriented Ring with Tokens. - Stefan Dobrev; Nicola Santoro; Wei Shi 001 (Int. J. Found. Comput. Sci., 2008)

On fractional dynamic faults with thresholds. - Stefan Dobrev; Rastislav Kralovic; Richard Královic; Nicola Santoro (Theor. Comput. Sci., 2008)

Black Hole Search in Directed Graphs. - Jurek Czyzowicz; Stefan Dobrev; Rastislav Královic; Stanislav Miklík; Dana Pardubská (SIROCCO, 2009)

Measuring the problem-relevant information in input. - Stefan Dobrev; Rastislav Královic; Dana Pardubská (RAIRO Theor. Informatics Appl., 2009)

Local edge colouring of Yao-like subgraphs of Unit Disk Graphs. - Jurek Czyzowicz; Stefan Dobrev; Evangelos Kranakis; Jaroslav Opatrny; Jorge Urrutia (Theor. Comput. Sci., 2009)

Routing in Carrier-Based Mobile Networks. - Bronislava Brejová; Stefan Dobrev; Rastislav Královic; Tomás Vinar (SIROCCO, 2011)

Local 7-coloring for planar subgraphs of unit disk graphs. - Jurek Czyzowicz; Stefan Dobrev; Hernán González-Aguilar; Rastislav Kralovic; Evangelos Kranakis; Jaroslav Opatrny; Ladislav Stacho; Jorge Urrutia (Theor. Comput. Sci., 2011)

Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs. - Stefan Dobrev; Evangelos Kranakis; Oscar Morales-Ponce; Milan Plzík (CSR, 2012)

Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points. - Stefan Dobrev; Evangelos Kranakis; Danny Krizanc; Oscar Morales-Ponce; Ladislav Stacho (LATIN, 2012)

Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles. - Balasingham Balamohan; Stefan Dobrev; Paola Flocchini; Nicola Santoro (SIROCCO, 2012)

Online Graph Exploration with Advice. - Stefan Dobrev; Rastislav Královic; Euripides Markou (SIROCCO, 2012)

Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract). - Stefan Dobrev; Rastislav Královic; Richard Královic (WAOA, 2012)

Strong Connectivity in Sensor Networks with given Number of Directional Antennae of Bounded Angle. - Stefan Dobrev; Evangelos Kranakis; Danny Krizanc; Jaroslav Opatrny; Oscar Morales-Ponce; Ladislav Stacho (Discret. Math. Algorithms Appl., 2012)

More efficient periodic traversal in anonymous undirected graphs. - Jurek Czyzowicz; Stefan Dobrev; Leszek Gasieniec; David Ilcinkas; Jesper Jansson 001; Ralf Klasing; Ioannis Lignos; Russell Martin; Kunihiko Sadakane; Wing-Kin Sung (Theor. Comput. Sci., 2012)

Antibandwidth and cyclic antibandwidth of Hamming graphs. - Stefan Dobrev; Rastislav Královic; Dana Pardubská; L'ubomír Török; Imrich Vrt'o (Discret. Appl. Math., 2013)

Computing with Advice: when Knowledge Helps. - Stefan Dobrev; Rastislav Královic; Richard Královic (Bull. EATCS, 2013)

Efficient routing in carrier-based mobile networks. - Brona Brejová; Stefan Dobrev; Rastislav Královic; Tomás Vinar (Theor. Comput. Sci., 2013)

Exploring an unknown dangerous graph using tokens. - Stefan Dobrev; Paola Flocchini; Rastislav Královic; Nicola Santoro (Theor. Comput. Sci., 2013)

Improved Spanners in Networks with Symmetric Directional Antennas. - Stefan Dobrev; Milan Plzík (ALGOSENSORS, 2014)

Survivability of Swarms of Bouncing Robots. - Jurek Czyzowicz; Stefan Dobrev; Evangelos Kranakis; Eduardo Pacheco (LATIN, 2014)

Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors. - Stefan Dobrev; Lata Narayanan; Jaroslav Opatrny (Theory Comput. Syst., 2014)

Monitoring the Plane with Rotating Radars. - Jurek Czyzowicz; Stefan Dobrev; Benson L. Joeris; Evangelos Kranakis; Danny Krizanc; Ján Manuch; Oscar Morales-Ponce; Jaroslav Opatrny; Ladislav Stacho; Jorge Urrutia (Graphs Comb., 2015)

Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs. - Stefan Dobrev; Rastislav Královic; Richard Královic (Theory Comput. Syst., 2015)

Complexity of barrier coverage with relocatable sensors in the plane. - Stefan Dobrev; Stephane Durocher; Mohsen Eftekhari Hesari; Konstantinos Georgiou; Evangelos Kranakis; Danny Krizanc; Lata Narayanan; Jaroslav Opatrny; Sunil M. Shende; Jorge Urrutia (Theor. Comput. Sci., 2015)

On the Complexity of Distributed Wake-Up. - Stefan Dobrev; Rastislav Kralovic; Nicola Santoro (CANDAR, 2016)

Live Exploration of Dynamic Rings. - Giuseppe Antonio Di Luna; Stefan Dobrev; Paola Flocchini; Nicola Santoro (ICDCS, 2016)

The Complexity of Paging Against a Probabilistic Adversary. - Stefan Dobrev; Juraj Hromkovic; Dennis Komm; Richard Královic; Rastislav Královic; Tobias Mömke (SOFSEM, 2016)

Connectivity with directional antennas in the symmetric communication model. - Stefan Dobrev; Mohsen Eftekhari Hesari; Fraser MacQuarie; Ján Manuch; Oscar Morales-Ponce; Lata Narayanan; Jaroslav Opatrny; Ladislav Stacho (Comput. Geom., 2016)

Survivability of bouncing robots. - Jurek Czyzowicz; Stefan Dobrev; Evangelos Kranakis; Eduardo Pacheco (Discret. Math. Algorithms Appl., 2016)

Exploring an unknown dangerous graph with a constant number of tokens. - Balasingham Balamohan; Stefan Dobrev; Paola Flocchini; Nicola Santoro (Theor. Comput. Sci., 2016)

Weak Coverage of a Rectangular Barrier. - Stefan Dobrev; Evangelos Kranakis; Danny Krizanc; Manuel Lafond; Ján Manuch; Lata Narayanan; Jaroslav Opatrny; Sunil M. Shende; Ladislav Stacho (CIAC, 2017)

Treasure Hunt with Barely Communicating Agents. - Stefan Dobrev; Rastislav Královic; Dana Pardubská (OPODIS, 2017)

Optimal Local Buffer Management for Information Gathering with Adversarial Traffic. - Stefan Dobrev; Manuel Lafond; Lata Narayanan; Jaroslav Opatrny (SPAA, 2017)

On the Cost of Waking Up. - Stefan Dobrev; Rastislav Královic; Nicola Santoro (Int. J. Netw. Comput., 2017)

Improved analysis of the online set cover problem with advice. - Stefan Dobrev; Jeff Edmonds; Dennis Komm; Rastislav Královic; Richard Královic; Sacha Krug; Tobias Mömke (Theor. Comput. Sci., 2017)

Evacuating two robots from multiple unknown exits in a circle. - Jurek Czyzowicz; Stefan Dobrev; Konstantinos Georgiou; Evangelos Kranakis; Fraser MacQuarrie (Theor. Comput. Sci., 2018)

Exploration of High-Dimensional Grids by Finite Automata. - Stefan Dobrev; Lata Narayanan; Jaroslav Opatrny; Denis Pankratov (ICALP, 2019)

Improved Lower Bounds for Shoreline Search. - Stefan Dobrev; Rastislav Královic; Dana Pardubská (SIROCCO, 2020)

Exploration of Time-Varying Connected Graphs with Silent Agents. - Stefan Dobrev; Rastislav Královic; Dana Pardubská (SIROCCO, 2020)

Weak Coverage of a Rectangular Barrier. - Stefan Dobrev; Evangelos Kranakis; Danny Krizanc; Manuel Lafond; Ján Manuch; Lata Narayanan; Jaroslav Opatrny; Ladislav Stacho (Algorithmica, 2020)

Distributed exploration of dynamic rings. - Giuseppe Antonio Di Luna; Stefan Dobrev; Paola Flocchini; Nicola Santoro (Distributed Comput., 2020)

Searching for a non-adversarial, uncooperative agent on a cycle. - Jurek Czyzowicz; Stefan Dobrev; Maxime Godon; Evangelos Kranakis; Toshinori Sakai; Jorge Urrutia (Theor. Comput. Sci., 2020)

Graph Exploration by Energy-Sharing Mobile Agents. - Jurek Czyzowicz; Stefan Dobrev; Ryan Killick; Evangelos Kranakis; Danny Krizanc; Lata Narayanan; Jaroslav Opatrny; Denis Pankratov; Sunil M. Shende (SIROCCO, 2021)

Competition between Ag+ and Ni2+ in nickel enzymes: Implications for the Ag+ antibacterial activity. - Stefan Dobrev; Nikoleta Kircheva; Valya Nikolova; Silvia Angelova; Todor Dudev (Comput. Biol. Chem., 2022)

Asynchronous Gathering in a Dangerous Ring. - Stefan Dobrev; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro (Algorithms, 2023)

Exploration of High-Dimensional Grids by Finite State Machines. - Stefan Dobrev; Lata Narayanan; Jaroslav Opatrny; Denis Pankratov (Algorithmica, 2024)

Explicit Token-Based Communication for Mobile Entities. - Balasingham Balamohan; Stefan Dobrev; Paola Flocchini; Nicola Santoro (SIROCCO, 2025)