Skip to main content

7 Result(s)

within Article Remove this filter Stefan Dobrev Remove this filter Computer Science Remove this filter English Remove this filter

and

  1. No Access

    Article

    Exploration of High-Dimensional Grids by Finite State Machines

    We consider the problem of finding a “treasure” at an unknown point of an n-dimensional infinite grid, \(n\ge 3\) ...

    Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov in Algorithmica (2024)

  2. No Access

    Article

    Weak Coverage of a Rectangular Barrier

    Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. Each sensor can monitor a circular area of specific diameter around its position, called the sensor diameter. ...

    Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Ján Maňuch… in Algorithmica (2020)

  3. No Access

    Article

    Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs

    We study the advice complexity of the online version of the Maximum Independent Set problem, restricted to the sparse, and bipartite graphs, respectively. We show that for sparse graphs, constant-sized advice ...

    Stefan Dobrev, Rastislav Královič, Richard Královič in Theory of Computing Systems (2015)

  4. No Access

    Article

    Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors

    We consider the problem of monitoring the Euclidean plane using rotating sensors with detection sectors and beam sensors. We assume that intruders can appear anywhere at any time and move arbitrarily fast, and...

    Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny in Theory of Computing Systems (2014)

  5. No Access

    Article

    Mobile Search for a Black Hole in an Anonymous Ring

    In this paper we address the problem of mobile agents searching for a highly harmful item (called a black hole) in a ring network. The black hole is a stationary process that destroys visiting agents upon thei...

    Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro in Algorithmica (2007)

  6. No Access

    Article

    Searching for a black hole in arbitrary networks: optimal mobile agents protocols

    Consider a networked environment, supporting mobile agents, where there is a black hole: a harmful host that disposes of visiting agents upon their arrival, leaving no observable trace of such a destruction. T...

    Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro in Distributed Computing (2006)

  7. No Access

    Article

    Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults

    We consider the problem of message (and bit) efficient broadcasting in complete networks with dynamic faults. Despite the simplicity of the setting, the problem turned out to be surprisingly interesting from ...

    Stefan Dobrev in Theory of Computing Systems (2003)