5 citations · 6 across the 4 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2019
Navigating an Infinite Space with Unreliable Movements
Anders Martinsson, Jara Uitto
We consider a search problem on a -dimensional infinite grid with a single mobile agent. The goal of the agent is to find her way home, which is located in a grid cell chosen by…
cs.DM2018
Even flying cops should think ahead
Anders Martinsson, Florian Meier, Patrick Schnider +1
We study the entanglement game, which is a version of cops and robbers, on sparse graphs. While the minimum degree of a graph G is a lower bound for the number of cops needed to ca…