Stefan Dobrev

Orcid: 0000-0002-0914-2983

According to our database1, Stefan Dobrev authored at least 90 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Exploration of High-Dimensional Grids by Finite State Machines.
Algorithmica, May, 2024

2023
Asynchronous Gathering in a Dangerous Ring.
Algorithms, 2023

2022
Competition between Ag<sup>+</sup> and Ni<sup>2+</sup> in nickel enzymes: Implications for the Ag<sup>+</sup> antibacterial activity.
Comput. Biol. Chem., 2022

2021
Graph Exploration by Energy-Sharing Mobile Agents.
Proceedings of the Structural Information and Communication Complexity, 2021

2020
Searching for a non-adversarial, uncooperative agent on a cycle.
Theor. Comput. Sci., 2020

Distributed exploration of dynamic rings.
Distributed Comput., 2020

Weak Coverage of a Rectangular Barrier.
Algorithmica, 2020

Exploration of Time-Varying Connected Graphs with Silent Agents.
Proceedings of the Structural Information and Communication Complexity, 2020

Improved Lower Bounds for Shoreline Search.
Proceedings of the Structural Information and Communication Complexity, 2020

2019
Exploration of High-Dimensional Grids by Finite Automata.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Evacuating two robots from multiple unknown exits in a circle.
Theor. Comput. Sci., 2018

2017
Improved analysis of the online set cover problem with advice.
Theor. Comput. Sci., 2017

On the Cost of Waking Up.
Int. J. Netw. Comput., 2017

Optimal Local Buffer Management for Information Gathering with Adversarial Traffic.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Treasure Hunt with Barely Communicating Agents.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

Weak Coverage of a Rectangular Barrier.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Exploring an unknown dangerous graph with a constant number of tokens.
Theor. Comput. Sci., 2016

Survivability of bouncing robots.
Discret. Math. Algorithms Appl., 2016

Connectivity with directional antennas in the symmetric communication model.
Comput. Geom., 2016

The Complexity of Paging Against a Probabilistic Adversary.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

Live Exploration of Dynamic Rings.
Proceedings of the 36th IEEE International Conference on Distributed Computing Systems, 2016

On the Complexity of Distributed Wake-Up.
Proceedings of the Fourth International Symposium on Computing and Networking, 2016

2015
Complexity of barrier coverage with relocatable sensors in the plane.
Theor. Comput. Sci., 2015

Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs.
Theory Comput. Syst., 2015

Monitoring the Plane with Rotating Radars.
Graphs Comb., 2015

2014
Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors.
Theory Comput. Syst., 2014

Survivability of Swarms of Bouncing Robots.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Improved Spanners in Networks with Symmetric Directional Antennas.
Proceedings of the Algorithms for Sensor Systems, 2014

2013
Exploring an unknown dangerous graph using tokens.
Theor. Comput. Sci., 2013

Efficient routing in carrier-based mobile networks.
Theor. Comput. Sci., 2013

Computing with Advice: when Knowledge Helps.
Bull. EATCS, 2013

Antibandwidth and cyclic antibandwidth of Hamming graphs.
Discret. Appl. Math., 2013

2012
More efficient periodic traversal in anonymous undirected graphs.
Theor. Comput. Sci., 2012

Strong Connectivity in Sensor Networks with given Number of Directional Antennae of Bounded Angle.
Discret. Math. Algorithms Appl., 2012

Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract).
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Online Graph Exploration with Advice.
Proceedings of the Structural Information and Communication Complexity, 2012

Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles.
Proceedings of the Structural Information and Communication Complexity, 2012

Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs.
Proceedings of the Computer Science - Theory and Applications, 2012

2011
Local 7-coloring for planar subgraphs of unit disk graphs.
Theor. Comput. Sci., 2011

Routing in Carrier-Based Mobile Networks.
Proceedings of the Structural Information and Communication Complexity, 2011

2009
Local edge colouring of Yao-like subgraphs of Unit Disk Graphs.
Theor. Comput. Sci., 2009

Measuring the problem-relevant information in input.
RAIRO Theor. Informatics Appl., 2009

Black Hole Search in Directed Graphs.
Proceedings of the Structural Information and Communication Complexity, 2009

2008
On fractional dynamic faults with thresholds.
Theor. Comput. Sci., 2008

Using Scattered Mobile Agents to Locate a Black Hole in an un-Oriented Ring with Tokens.
Int. J. Found. Comput. Sci., 2008

How Much Information about the Future Is Needed?
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Leader Election in Extremely Unreliable Rings and Complete Networks.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
Mobile Search for a Black Hole in an Anonymous Ring.
Algorithmica, 2007

Scattered Black Hole Search in an Oriented Ring using Tokens.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

Locating a Black Hole in an Un-oriented Ring Using Tokens: The Case of Scattered Agents.
Proceedings of the Euro-Par 2007, 2007

2006
Black hole search in common interconnection networks.
Networks, 2006

Route discovery with constant memory in oriented planar geometric networks.
Networks, 2006

Exploring Planar Graphs Using Unoriented Maps.
J. Interconnect. Networks, 2006

Searching for a black hole in arbitrary networks: optimal mobile agents protocols.
Distributed Comput., 2006

On Fractional Dynamic Faults with Threshold.
Proceedings of the Structural Information and Communication Complexity, 2006

Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Exploring an Unknown Graph to Locate a Black Hole Using Tokens.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search.
Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

Black Hole Search in Asynchronous Rings Using Tokens.
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005
Finding Short Right-Hand-on-the-Wall Walks in Graphs.
Proceedings of the Structural Information and Communication Complexity, 2005

Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

2004
Traversal of a quasi-planar subdivision without using mark bits.
J. Interconnect. Networks, 2004

Computing input multiplicity in anonymous synchronous networks with dynamic faults.
J. Discrete Algorithms, 2004

Leader Election in Rings with Nonunique Labels.
Fundam. Informaticae, 2004

Dynamic faults have small effect on broadcasting in hypercubes.
Discret. Appl. Math., 2004

Improved Bounds for Optimal Black Hole Search with a Network Map.
Proceedings of the Structural Information and Communication Complexity, 2004

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

Multiple Agents RendezVous in a Ring in Spite of a Black Hole.
Proceedings of the Principles of Distributed Systems, 7th International Conference, 2003

2002
Optimal Broadcasting in Tori with Dynamic Faults.
Parallel Process. Lett., 2002

Searching for a black hole in arbitrary networks: optimal mobile agent protocols.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Black Hole Search by Mobile Agents in Hypercubes and Related Networks.
Proceedings of the Procedings of the 6th International Conference on Principles of Distributed Systems. OPODIS 2002, 2002

2001
Towards practical deteministic write-all algorithms.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Leader Election in Abelian Cayley Graphs.
Proceedings of the SIROCCO 8, 2001

2000
Evolutionary graph colouring.
Inf. Process. Lett., 2000

Efficient wakeup in anonymous oriented complete graphs.
Proceedings of the SIROCCO 7, 2000

Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Optimal Broadcasting in Even Tori with Dynamic Faults (Research Note).
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1999
Optimal Broadcasting in Hypercubes with Dynamic Faults.
Inf. Process. Lett., 1999

Two Broadcasting Problems in Faulty Hypercubes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Leader Election using Any Sense of Direction.
Proceedings of the SIROCCO'99, 1999

1998
On the Communication Complexity of Strong Time-Optimal Distributed Algorithms.
Nord. J. Comput., 1998

Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages.
Inf. Process. Lett., 1998

Broadcasting on Anonymous Unoriented Tori.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

Yet Another Modular Technique for Efficient Leader Election.
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes.
Proceedings of the SIROCCO'98, 1998

An Alternative View on Sense of Direction (Position paper).
Proceedings of the SIROCCO'98, 1998

1997
Linear Broadcasting and N loglog N Election in Unoriented Hypercubes.
Proceedings of the SIROCCO'97, 1997


  Loading...