Stefan Dobrev

Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrt'o: Antibandwidth and cyclic antibandwidth of Hamming graphs. Discrete Applied Mathematics 161(10-11): 1402-1408 (2013)

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

Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari Hesari, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Jorge Urrutia: Complexity of Barrier Coverage with Relocatable Sensors in the Plane. CIAC 2013: 170-182

Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Jaroslav Opatrny, Oscar Morales Ponce, Ladislav Stacho: Strong Connectivity in Sensor Networks with given Number of Directional Antennae of Bounded Angle. Discrete Math., Alg. and Appl. 4(3) (2012)

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

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

Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny: Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors. FUN 2012: 94-106

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

Stefan Dobrev, Rastislav Královic, Euripides Markou: Online Graph Exploration with Advice. SIROCCO 2012: 267-278

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

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

Bronislava Brejová, Stefan Dobrev, Rastislav Královic, Tomás Vinar: Routing in Carrier-Based Mobile Networks. SIROCCO 2011: 222-233

Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales Ponce, Ladislav Stacho: Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points. CoRR abs/1112.3523 (2011)

Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Jaroslav Opatrny, Oscar Morales Ponce, Ladislav Stacho: Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle. COCOA (2) 2010: 72-86

Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrto: Antibandwidth and Cyclic Antibandwidth of Hamming Graphs. Electronic Notes in Discrete Mathematics 34: 295-300 (2009)

Stefan Dobrev, Rastislav Královic, Dana Pardubská: Measuring the problem-relevant information in input. ITA 43(3): 585-613 (2009)

Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Julià Urrutia: Local edge colouring of Yao-like subgraphs of Unit Disk Graphs. Theor. Comput. Sci. 410(14): 1388-1400 (2009)

Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung: More Efficient Periodic Traversal in Anonymous Undirected Graphs. SIROCCO 2009: 167-181

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

Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung: More efficient periodic traversal in anonymous undirected graphs. CoRR abs/0905.1737 (2009)

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

Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro: On fractional dynamic faults with thresholds. Theor. Comput. Sci. 399(1-2): 101-117 (2008)

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

Stefan Dobrev, Rastislav Kralovic, Dana Pardubská: Leader Election in Extremely Unreliable Rings and Complete Networks. OPODIS 2008: 512-526

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

Stefan Dobrev, Rastislav Kralovic, Dana Pardubská: How Much Information about the Future Is Needed? SOFSEM 2008: 247-258

Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia: Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. TAMC 2008: 170-181

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

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

Stefan Dobrev, Nicola Santoro, Wei Shi: Scattered Black Hole Search in an Oriented Ring using Tokens. IPDPS 2007: 1-8

Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia: Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs. SIROCCO 2007: 195-207

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

Krzysztof Diks, Stefan Dobrev, Andrzej Pelc: Exploring Planar Graphs Using Unoriented Maps. Journal of Interconnection Networks 7(3): 353-373 (2006)

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

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

Stefan Dobrev, Rastislav Kralovic, Nicola Santoro, Wei Shi: Black Hole Search in Asynchronous Rings Using Tokens. CIAC 2006: 139-150

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

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

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

Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro: On Fractional Dynamic Faults with Threshold. SIROCCO 2006: 197-211

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

Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung: Finding Short Right-Hand-on-the-Wall Walks in Graphs. SIROCCO 2005: 127-139

Stefan Dobrev, Imrich Vrto: Dynamic faults have small effect on broadcasting in hypercubes. Discrete Applied Mathematics 137(2): 155-158 (2004)

Stefan Dobrev, Andrzej Pelc: Leader Election in Rings with Nonunique Labels. Fundam. Inform. 59(4): 333-347 (2004)

Stefan Dobrev: Computing input multiplicity in anonymous synchronous networks with dynamic faults. J. Discrete Algorithms 2(4): 425-438 (2004)

Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia: Traversal of a quasi-planar subdivision without using mark bits. Journal of Interconnection Networks 5(4): 395-407 (2004)

Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia: Route Discovery with Constant Memory in Oriented Planar Geometric Networks. ALGOSENSORS 2004: 147-156

Edgar Chávez, Jaroslav Opatrny, Stefan Dobrev, Ladislav Stacho, Evangelos Kranakis, Jorge Urrutia: Traversal of a Quasi-Planar Subdivision without Using Mark Bits. IPDPS 2004

Stefan Dobrev, Paola Flocchini, Nicola Santoro: Improved Bounds for Optimal Black Hole Search with a Network Map. SIROCCO 2004: 111-122

Stefan Dobrev: Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults. Theory Comput. Syst. 36(6): 695-709 (2003)

Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro: Multiple Agents RendezVous in a Ring in Spite of a Black Hole. OPODIS 2003: 34-46

Stefan Dobrev, Andrzej Pelc: Leader Election in Rings with Nonunique Labels. PDPTA 2003: 1400-1406

Stefan Dobrev, Imrich Vrto: Optimal Broadcasting in Tori with Dynamic Faults. Parallel Processing Letters 12(1): 17-22 (2002)

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

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

Stefan Dobrev: Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults. SIROCCO 2002: 101-113

Lali Barrière, Stefan Dobrev: Leader Election in Abelian Cayley Graphs. SIROCCO 2001: 5-20

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

Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro: Mobile Search for a Black Hole in an Anonymous Ring. DISC 2001: 166-179

Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto: Evolutionary graph colouring. Inf. Process. Lett. 76(1-2): 91-94 (2000)

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

Stefan Dobrev: Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks. MFCS 2000: 314-322

Stefan Dobrev: Efficient wakeup in anonymous oriented complete graphs. SIROCCO 2000: 79-93

Stefan Dobrev: Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults. WG 2000: 137-148

Stefan Dobrev, Imrich Vrto: Optimal Broadcasting in Hypercubes with Dynamic Faults. Inf. Process. Lett. 71(2): 81-85 (1999)

Stefan Dobrev: Leader Election using Any Sense of Direction. SIROCCO 1999: 93-104

Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto: Evolutionary Graph Colouring. SIROCCO 1999: 105-110

Stefan Dobrev, Roberto Segala, Alexander A. Shvartsman: Irreversile Dynamos in Tori. SIROCCO 1999: 111-125

Stefan Dobrev, Imrich Vrto: Two Broadcasting Problems in Faulty Hypercubes. WG 1999: 173-178

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

Stefan Dobrev, Peter Ruzicka: On the Communication Complexity of Strong Time-Optimal Distributed Algorithms. Nord. J. Comput. 5(2): 87-104 (1998)

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

Stefan Dobrev, Peter Ruzicka, Gerard Tel: Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes. SIROCCO 1998: 173-187

Stefan Dobrev, Peter Ruzicka: Yet Another Modular Technique for Efficient Leader Election. SOFSEM 1998: 312-321

Stefan Dobrev, Peter Ruzicka: Broadcasting on Anonymous Unoriented Tori. WG 1998: 50-62

Stefan Dobrev, Peter Ruzicka: Linear Broadcasting and N loglog N Election in Unoriented Hypercubes. SIROCCO 1997: 53-68