42 citations · 132 across the 20 of their papers we have counts for
4 papers · 1 filter
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…
A general lower bound for collaborative tree exploration
Yann Disser, Frank Mousset, Andreas Noever +2
We consider collaborative graph exploration with a set of agents. All agents start at a common vertex of an initially unknown graph and need to collectively visit all other ver…
Unique reconstruction threshold for random jigsaw puzzles
Rajko Nenadov, Pascal Pfister, Angelika Steger
A random jigsaw puzzle is constructed by arranging square pieces into an grid and assigning to each edge of a piece one of available colours uniformly at ran…
Explosive Percolation in Erdös-Rényi-Like Random Graph Processes
Konstantinos Panagiotou, Reto Spöhel, Angelika Steger +1
The evolution of the largest component has been studied intensely in a variety of random graph processes, starting in 1960 with the Erdös-Rényi process. It is well known that this…