12 citations · 37 across the 15 of their papers we have counts for
17 papers
Largest planar graphs of diameter and fixed maximum degree -- connection with fractional matchings
Antoine Dailly, Sasha Darmon, Ugo Giocanti +2
The degree diameter problem asks for the maximum possible number of vertices in a graph of maximum degree and diameter . In this paper, we focus on planar graphs of diameter…
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…
Algorithms and hardness for Metric Dimension on digraphs
Antoine Dailly, Florent Foucaud, Anni Hakanen
In the Metric Dimension problem, one asks for a minimum-size set of vertices such that for any pair of vertices of the graph, there is a vertex from whose two distances to…
Neighbour sum distinguishing edge-weightings with local constraints
Antoine Dailly, ElÅ1/4bieta Sidorowicz
A -edge-weighting of is a mapping . The edge-weighting of naturally induces a vertex-colouring …
The balancing number and list balancing number of some graph classes
Antoine Dailly, Adriana Hansberg, Laura Eslava +1
Given a graph , a 2-coloring of the edges of is said to contain a balanced copy of if we can find a copy of such that half of its edges is in each color class. If…
On the balanceability of some graph classes
Antoine Dailly, Adriana Hansberg, Denae Ventura
Given a graph , a 2-coloring of the edges of is said to contain a balanced copy of if we can find a copy of such that half of its edges are in each color class. If…
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
Antoine Dailly, Florent Foucaud, Adriana Hansberg
A graph is diameter-2-critical if its diameter is 2 but the removal of any edge increases the diameter. A well-studied conjecture, known as the Murty-Simon conjecture, states that…
Connected Subtraction Games on Subdivided Stars
Antoine Dailly, Julien Moncel, Aline Parreau
The present paper deals with connected subtraction games in graphs, which are generalization of takeaway games. In a connected subtraction game, two players alternate removing a co…
Partition games
Antoine Dailly, Eric Duchene, Urban Larsson +1
We introduce CUT, the class of 2-player partition games. These are NIM type games, played on a finite number of heaps of beans. The rules are given by a set of positive integers, w…
A generalization of Arc-Kayles
Antoine Dailly, Valentin Gledel, Marc Heinrich
The game Arc-Kayles is played on an undirected graph with two players taking turns deleting an edge and its endpoints from the graph. We study a generalization of this game, Weight…
Octal Games on Graphs: The game 0.33 on subdivided stars and bistars
Laurent Beaudou, Pierre Coupechoux, Antoine Dailly +4
Octal games are a well-defined family of two-player games played on heaps of counters, in which the players remove alternately a certain number of counters from a heap, sometimes b…
Groupoid exactness and the weak containment problem
Claire Anantharaman-Delaroche
Our purpose is to study in the setting of locally compact groupoids the analogues of the well-known equivalent definitions of exactness for discrete groups. Our best results are ob…