6 citations · 6 across the 1 of their papers we have counts for
4 papers
Optimal strategies for patrolling fences
Bernhard Haeupler, Fabian Kuhn, Anders Martinsson +2
A classical multi-agent fence patrolling problem asks: What is the maximum length of a line that agents with maximum speeds can patrol if each point on the…
Asymptotically Optimal Amplifiers for the Moran Process
Leslie Ann Goldberg, John Lapinskas, Johannes Lengler +3
We study the Moran process as adapted by Lieberman, Hauert and Nowak. This is a model of an evolving population on a graph or digraph where certain individuals, called "mutants" ha…
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…
Strong games played on random graphs
Asaf Ferber, Pascal Pfister
In a strong game played on the edge set of a graph G there are two players, Red and Blue, alternating turns in claiming previously unclaimed edges of G (with Red playing first). Th…