12 citations · 37 across the 15 of their papers we have counts for
6 papers · 1 filter
The Closed Geodetic Game: algorithms and strategies
Antoine Dailly, Harmender Gahlawat, Zin Mar Myint
The geodetic closure of a set S of vertices of a graph is the set of all vertices in shortest paths between pairs of vertices of S. A set S of vertices in a graph is geodetic if it…
Simple Chopsticks: Playing with any number of hands and fingers
Antoine Dailly, Valentin Gledel, Richard J. Nowakowski +1
Chopsticks is a game played by two players where they start with one finger raised on each hand. On their turn, each player moves by pointing an attacking hand at one of their oppo…
Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
Kyle Burke, Antoine Dailly, Nacim Oijid
Arc-Kayles is a game where two players alternate removing two adjacent vertices until no move is left, the winner being the player who played the last move. Introduced in 1978, its…
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…
Resolving Sets in Temporal Graphs
Jan Bok, Antoine Dailly, Tuomo Lehtilä
A \emph{resolving set} in a graph is a set of vertices such that every vertex of is uniquely identified by its distances to the vertices of . Introduced in the 1970s…
The Canadian Traveller Problem on outerplanar graphs
Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev +5
We study the -Canadian Traveller Problem, where a weighted graph with a source and a target are given. This problem also has a hidden input $E_* \s…