Skip to main content

7 Result(s)

within English Remove this filter Computer Science Remove this filter Computation by Abstract Devices Remove this filter Stefan Dobrev Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Survivability of Swarms of Bouncing Robots

    Bouncing robots are mobile agents with limited sensing capabilities adjusting their movements upon collisions either with other robots or obstacles in the environment. They behave like elastic particles slidin...

    Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis… in LATIN 2014: Theoretical Informatics (2014)

  2. No Access

    Chapter and Conference Paper

    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 Fun with Algorithms (2012)

  3. No Access

    Chapter and Conference Paper

    Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points

    Given a set P of n points in the plane, we solve the problems of constructing a geometric planar graph spanning P 1) of minimum degree 2, and 2) which is 2-edge connected, respectively, and has max edge length bo...

    Stefan Dobrev, Evangelos Kranakis, Danny Krizanc… in LATIN 2012: Theoretical Informatics (2012)

  4. No Access

    Chapter and Conference Paper

    Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs

    We study the following problem: Given a set of points in the plane and a positive integer k > 0, construct a geometric strongly connected spanning digraph of out-degree at most k and whose longest edge length is ...

    Stefan Dobrev, Evangelos Kranakis… in Computer Science – Theory and Applications (2012)

  5. No Access

    Chapter and Conference Paper

    Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges

    We give an algorithm for constructing a connected spanning subgraphs(panner) of a wireless network modelled as a unit disk graph with nodes of irregular transmission ranges, whereby for some parameter 0 < r ≤ 1 t...

    Edgar Chávez, Stefan Dobrev, Evangelos Kranakis… in LATIN 2006: Theoretical Informatics (2006)

  6. No Access

    Chapter and Conference Paper

    Mobile Search for a Black Hole in an Anonymous Ring

    We address the problem of mobile agents searching a ring network for a highly harmful item, a black hole, a stationary process destroying visiting agents upon their arrival.No observable trace of such a destructi...

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

  7. No Access

    Chapter and Conference Paper

    Two Broadcasting Problems in FaultyHypercubes

    We consider two broadcasting problems in the n-dimensional hypercube under the shouting communication mode, i.e. any node of a network can inform all its neighbours in one time step. In addition, during any ti...

    Stefan Dobrev, Imrich Vrťo in Graph-Theoretic Concepts in Computer Science (1999)