Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Nemesis, an Escape Game in Graphs
Pierre Bergé, Antoine Dailly, Yan Gerard
We define a new escape game in graphs that we call Nemesis. The game is played on a graph having a subset of vertices labeled as exits and the goal of one of the two players, calle…
cs.DS2024
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud +1
In this paper, we study a dynamic analogue of the Path Cover problem, which can be solved in polynomial-time in directed acyclic graphs. A temporal digraph has an arc set that chan…