The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stefan Dobrev: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
    Route Discovery with Constant Memory in Oriented Planar Geometric Networks. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2004, pp:147-156 [Conf]
  2. Stefan Dobrev, Rastislav Kralovic, Nicola Santoro, Wei Shi
    Black Hole Search in Asynchronous Rings Using Tokens. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:139-150 [Conf]
  3. Stefan Dobrev, Imrich Vrto
    Optimal Broadcasting in Even Tori with Dynamic Faults (Research Note). [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:927-930 [Conf]
  4. Stefan Dobrev, Paola Flocchini, Nicola Santoro
    Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2006, pp:57- [Conf]
  5. Edgar Chávez, Jaroslav Opatrny, Stefan Dobrev, Ladislav Stacho, Evangelos Kranakis, Jorge Urrutia
    Traversal of a Quasi-Planar Subdivision without Using Mark Bits. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  6. 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. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:286-297 [Conf]
  7. Stefan Dobrev
    Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:314-322 [Conf]
  8. Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Giuseppe Prencipe, Peter Ruzicka, Nicola Santoro
    Black Hole Search by Mobile Agents in Hypercubes and Related Networks. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2002, pp:169-180 [Conf]
  9. Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
    Multiple Agents RendezVous in a Ring in Spite of a Black Hole. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2003, pp:34-46 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:235-245 [Conf]
  11. Stefan Dobrev, Andrzej Pelc
    Leader Election in Rings with Nonunique Labels. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2003, pp:1400-1406 [Conf]
  12. Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
    Searching for a black hole in arbitrary networks: optimal mobile agent protocols. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:153-161 [Conf]
  13. Lali Barrière, Stefan Dobrev
    Leader Election in Abelian Cayley Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:5-20 [Conf]
  14. Stefan Dobrev
    Efficient wakeup in anonymous oriented complete graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:79-93 [Conf]
  15. Stefan Dobrev
    Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:101-113 [Conf]
  16. Stefan Dobrev
    An Alternative View on Sense of Direction (Position paper). [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:114-128 [Conf]
  17. Stefan Dobrev
    Leader Election using Any Sense of Direction. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1999, pp:93-104 [Conf]
  18. Stefan Dobrev, Paola Flocchini, Nicola Santoro
    Improved Bounds for Optimal Black Hole Search with a Network Map. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:111-122 [Conf]
  19. Shlomi Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
    Finding Short Right-Hand-on-the-Wall Walks in Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:127-139 [Conf]
  20. Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro
    On Fractional Dynamic Faults with Threshold. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:197-211 [Conf]
  21. Stefan Dobrev, Peter Ruzicka
    Linear Broadcasting and N loglog N Election in Unoriented Hypercubes. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:53-68 [Conf]
  22. Stefan Dobrev, Peter Ruzicka, Gerard Tel
    Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:173-187 [Conf]
  23. Stefan Dobrev, Roberto Segala, Alexander A. Shvartsman
    Irreversile Dynamos in Tori. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1999, pp:111-125 [Conf]
  24. Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
    Evolutionary Graph Colouring. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1999, pp:105-110 [Conf]
  25. Stefan Dobrev, Peter Ruzicka
    Yet Another Modular Technique for Efficient Leader Election. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1998, pp:312-321 [Conf]
  26. Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto
    Towards practical deteministic write-all algorithms. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:271-280 [Conf]
  27. Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
    Mobile Search for a Black Hole in an Anonymous Ring. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:166-179 [Conf]
  28. Stefan Dobrev
    Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:137-148 [Conf]
  29. Stefan Dobrev, Peter Ruzicka
    Broadcasting on Anonymous Unoriented Tori. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:50-62 [Conf]
  30. Stefan Dobrev, Imrich Vrto
    Two Broadcasting Problems in Faulty Hypercubes. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:173-178 [Conf]
  31. Stefan Dobrev, Imrich Vrto
    Dynamic faults have small effect on broadcasting in hypercubes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:137, n:2, pp:155-158 [Journal]
  32. Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
    Searching for a black hole in arbitrary networks: optimal mobile agents protocols. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:19, n:1, pp:1-99999 [Journal]
  33. Stefan Dobrev, Andrzej Pelc
    Leader Election in Rings with Nonunique Labels. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:59, n:4, pp:333-347 [Journal]
  34. Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
    Evolutionary graph colouring. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:91-94 [Journal]
  35. Stefan Dobrev, Imrich Vrto
    Optimal Broadcasting in Hypercubes with Dynamic Faults. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:2, pp:81-85 [Journal]
  36. Krzysztof Diks, Stefan Dobrev, Evangelos Kranakis, Andrzej Pelc, Peter Ruzicka
    Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:4, pp:181-186 [Journal]
  37. Stefan Dobrev
    Computing input multiplicity in anonymous synchronous networks with dynamic faults. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2004, v:2, n:4, pp:425-438 [Journal]
  38. Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
    Traversal of a quasi-planar subdivision without using mark bits. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2004, v:5, n:4, pp:395-407 [Journal]
  39. Stefan Dobrev
    Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:6, pp:695-709 [Journal]
  40. Stefan Dobrev, Paola Flocchini, Rastislav Kralovic, Peter Ruzicka, Giuseppe Prencipe, Nicola Santoro
    Black hole search in common interconnection networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:2, pp:61-71 [Journal]
  41. Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
    Route discovery with constant memory in oriented planar geometric networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:1, pp:7-15 [Journal]
  42. Stefan Dobrev, Peter Ruzicka
    On the Communication Complexity of Strong Time-Optimal Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1998, v:5, n:2, pp:87-104 [Journal]
  43. Stefan Dobrev, Imrich Vrto
    Optimal Broadcasting in Tori with Dynamic Faults. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2002, v:12, n:1, pp:17-22 [Journal]
  44. Stefan Dobrev, Nicola Santoro, Wei Shi
    Locating a Black Hole in an Un-oriented Ring Using Tokens: The Case of Scattered Agents. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2007, pp:608-617 [Conf]
  45. Stefan Dobrev, Nicola Santoro, Wei Shi
    Scattered Black Hole Search in an Oriented Ring using Tokens. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-8 [Conf]
  46. Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia
    Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:195-207 [Conf]
  47. Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
    Mobile Search for a Black Hole in an Anonymous Ring. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:48, n:1, pp:67-90 [Journal]

  48. Exploring an Unknown Graph to Locate a Black Hole Using Tokens. [Citation Graph (, )][DBLP]


  49. Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes. [Citation Graph (, )][DBLP]


  50. Leader Election in Extremely Unreliable Rings and Complete Networks. [Citation Graph (, )][DBLP]


  51. Black Hole Search in Directed Graphs. [Citation Graph (, )][DBLP]


  52. More Efficient Periodic Traversal in Anonymous Undirected Graphs. [Citation Graph (, )][DBLP]


  53. How Much Information about the Future Is Needed? [Citation Graph (, )][DBLP]


  54. The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring. [Citation Graph (, )][DBLP]


  55. Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. [Citation Graph (, )][DBLP]


  56. More efficient periodic traversal in anonymous undirected graphs [Citation Graph (, )][DBLP]


Search in 0.031secs, Finished in 0.034secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002