activity
20092026
most citedGraph Exploration by Energy-Sharing Mobile Agents

1 citations · 1 across the 6 of their papers we have counts for

collaborators

7 papers

cs.DS2026

Online Drone Coverage of Targets on a Line

Stefan Dobrev, Konstantinos Georgiou, Evangelos Kranakis +5

We study a problem of online targets coverage by a drone or a sensor that is equipped with a camera or an antenna of fixed half-angle of view . The targets to be monitored appea…

cs.DM2021★ 1 cited

Graph Exploration by Energy-Sharing Mobile Agents

J. Czyzowicz, S. Dobrev, R. Killick +6

We consider the problem of collective exploration of a known -node edge-weighted graph by mobile agents that have limited energy but are capable of energy transfers. The age…

cs.MA2019

Exploration of High-Dimensional Grids by Finite State Machines

Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny +1

We consider the problem of finding a treasure at an unknown point of an -dimensional infinite grid, , by initially collocated finite state agents (scouts/robots). Recen…

cs.DC2017

Weak Coverage of a Rectangular Barrier

Stefan Dobrev, Evangelos Kranakis, Danny Krizanc +5

Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. They are required to move to final locations so that they can detect any intru…

cs.DC2015

Live Exploration of Dynamic Rings

Giuseppe Antonio Di Luna, Stefan Dobrev, Paola Flocchini +1

In the graph exploration problem, a team of mobile computational entities, called agents, arbitrarily positioned at some nodes of a graph, must cooperate so that each node is event…

cs.DM2011

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

Stefan Dobrev, Evangelos Kranakis, Danny Krizanc +2

Given a set of points in the plane, we solve the problems of constructing a geometric planar graph spanning 1) of minimum degree 2, and 2) which is 2-edge connected, re…

cs.DM2009

More efficient periodic traversal in anonymous undirected graphs

J. Czyzowicz, S. Dobrev, L. Gasieniec +7

We consider the problem of periodic graph exploration in which a mobile entity with constant memory, an agent, has to visit all n nodes of an arbitrary undirected graph G in a peri…