Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Improved Lower Bounds for Shoreline Search

    Shoreline search is a natural and well-studied generalisation of the classical cow-path problem: k initially co-located unit speed agents are searching for a line (called shoreline) in 2 dimensional Euclidean spa...

    Stefan Dobrev, Rastislav Královič in Structural Information and Communication C… (2020)

  2. No Access

    Chapter and Conference Paper

    Exploration of Time-Varying Connected Graphs with Silent Agents

    Exploration is a fundamental task in mobile computing. We study the version where a group of cooperating agents is situated in a graph, and the task is to make sure that every vertex of the graph is visited by...

    Stefan Dobrev, Rastislav Královič in Structural Information and Communication C… (2020)