Skip to main content

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

    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)