Stefan Dobrev
Orcid: 0000-0002-0914-2983
According to our database1,
Stefan Dobrev
authored at least 90 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Algorithmica, May, 2024
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
Proceedings of the Structural Information and Communication Complexity, 2021
2020
Theor. Comput. Sci., 2020
Proceedings of the Structural Information and Communication Complexity, 2020
Proceedings of the Structural Information and Communication Complexity, 2020
2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
2018
Theor. Comput. Sci., 2018
2017
Theor. Comput. Sci., 2017
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017
2016
Theor. Comput. Sci., 2016
Comput. Geom., 2016
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016
Proceedings of the 36th IEEE International Conference on Distributed Computing Systems, 2016
Proceedings of the Fourth International Symposium on Computing and Networking, 2016
2015
Theor. Comput. Sci., 2015
Theory Comput. Syst., 2015
2014
Theory Comput. Syst., 2014
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014
Proceedings of the Algorithms for Sensor Systems, 2014
2013
2012
Theor. Comput. Sci., 2012
Strong Connectivity in Sensor Networks with given Number of Directional Antennae of Bounded Angle.
Discret. Math. Algorithms Appl., 2012
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012
Proceedings of the Structural Information and Communication Complexity, 2012
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
Proceedings of the Computer Science - Theory and Applications, 2012
2011
Proceedings of the Structural Information and Communication Complexity, 2011
2009
Theor. Comput. Sci., 2009
RAIRO Theor. Informatics Appl., 2009
Proceedings of the Structural Information and Communication Complexity, 2009
2008
Using Scattered Mobile Agents to Locate a Black Hole in an un-Oriented Ring with Tokens.
Int. J. Found. Comput. Sci., 2008
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
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
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
Networks, 2006
Distributed Comput., 2006
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
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
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006
2005
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
J. Interconnect. Networks, 2004
J. Discrete Algorithms, 2004
Discret. Appl. Math., 2004
Proceedings of the Structural Information and Communication Complexity, 2004
2003
Theory Comput. Syst., 2003
Proceedings of the Principles of Distributed Systems, 7th International Conference, 2003
2002
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
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
Efficient wakeup in anonymous oriented complete graphs.
Proceedings of the SIROCCO 7, 2000
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000
1999
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
Inf. Process. Lett., 1998
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998
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