3 citations · 6 across the 7 of their papers we have counts for
3 papers · 1 filter
The data arrangement problem on binary trees
Eranda Cela, Joachim Schauer, Rostislav Stanek
The data arrangement problem on regular trees (DAPT) consists in assigning the vertices of a given graph G, called the guest graph, to the leaves of a d-regular tree T, called the…
The Shortest Connection Game
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
We introduce Shortest Connection Game, a two-player game played on a directed graph with edge costs. Given two designated vertices in which they start, the players take turns in ch…
On the shortest path game: extended version
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
In this work we address a game theoretic variant of the shortest path problem, in which two decision makers (players) move together along the edges of a graph from a given starting…