A Vizing-like theorem for union vertex-distinguishing edge coloring. - Nicolas Bousquet 001; Antoine Dailly; Éric Duchêne; Hamamache Kheddouci; Aline Parreau (Discret. Appl. Math., 2017)

Partition games are pure breaking games. - Antoine Dailly; Éric Duchêne; Urban Larsson; Gabrielle Paris (CoRR, 2018)

Octal games on graphs: The game 0.33 on subdivided stars and bistars. - Laurent Beaudou; Pierre Coupechoux; Antoine Dailly; Sylvain Gravier; Julien Moncel; Aline Parreau; Éric Sopena (Theor. Comput. Sci., 2018)

Criticalité, identification et jeux de suppression de sommets dans les graphes. (Criticality, identification and vertex deletion games on graphs). - Antoine Dailly (2018)

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs. - Antoine Dailly; Florent Foucaud; Adriana Hansberg (Discret. Math., 2019)

A generalization of Arc-Kayles. - Antoine Dailly; Valentin Gledel; Marc Heinrich (Int. J. Game Theory, 2019)

Connected Subtraction Games on Subdivided Stars. - Antoine Dailly; Julien Moncel; Aline Parreau (Integers, 2019)

Partition games. - Antoine Dailly; Éric Duchêne; Urban Larsson; Gabrielle Paris (Discret. Appl. Math., 2020)

On the balanceability of some graph classes. - Antoine Dailly; Adriana Hansberg; Denae Ventura (Discret. Appl. Math., 2021)

Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. - Dibyayan Chakraborty; Antoine Dailly; Sandip Das 001; Florent Foucaud; Harmender Gahlawat; Subir Kumar Ghosh (ISAAC, 2022)

The neighbour sum distinguishing relaxed edge colouring. - Antoine Dailly; Éric Duchêne; Aline Parreau; Elzbieta Sidorowicz (Appl. Math. Comput., 2022)

The neighbour sum distinguishing edge-weighting with local constraints. - Antoine Dailly; Elzbieta Sidorowicz (CoRR, 2022)

Algorithms and Hardness for Metric Dimension on Digraphs. - Antoine Dailly; Florent Foucaud; Anni Hakanen (WG, 2023)

The Balancing Number and Generalized Balancing Number of Some Graph Classes. - Antoine Dailly; Laura Eslava; Adriana Hansberg; Denae Ventura (Electron. J. Comb., 2023)

Neighbour sum distinguishing edge-weightings with local constraints. - Antoine Dailly; Elzbieta Sidorowicz (Discret. Appl. Math., 2023)

How Did They Design This Game? Swish: Complexity and Unplayable Positions. - Antoine Dailly; Pascal Lafourcade 001; Gaël Marcadet (FUN, 2024)

Resolving Sets in Temporal Graphs. - Jan Bok; Antoine Dailly; Tuomo Lehtilä (IWOCA, 2024)

The Canadian Traveller Problem on Outerplanar Graphs. - Laurent Beaudou; Pierre Bergé; Vsevolod Chernyshev; Antoine Dailly; Yan Gerard; Aurélie Lagoutte; Vincent Limouzy; Lucas Pastor (MFCS, 2024)

Algorithms and Complexity for Path Covers of Temporal DAGs. - Dibyayan Chakraborty; Antoine Dailly; Florent Foucaud; Ralf Klasing (MFCS, 2024)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? - Dibyayan Chakraborty; Antoine Dailly; Florent Foucaud; Ralf Klasing (CoRR, 2024)

Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles. - Kyle Burke; Antoine Dailly; Nacim Oijid (CoRR, 2024)

The Closed Geodetic Game: Algorithms and Strategies. - Antoine Dailly; Harmender Gahlawat; Zin Mar Myint (IWOCA, 2025)

Reconstructing graphs with subgraph compositions. - Antoine Dailly; Tuomo Lehtilä (CoRR, 2025)

Largest planar graphs of diameter 3 and fixed maximum degree - connection with fractional matchings. - Antoine Dailly; Sasha Darmon; Ugo Giocanti; Claire Hilaire; Petru Valicov (CoRR, 2025)