Antoine Dailly

According to our database1, Antoine Dailly authored at least 27 papers between 2017 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
The Canadian traveller problem on unit-weighted and arbitrarily weighted outerplanar graphs.
Theor. Comput. Sci., 2026

Reconstructing graphs with subgraph compositions.
Discret. Appl. Math., 2026

Complexity and Algorithms for Arc-Kayles and Non-disconnecting Arc-Kayles.
Proceedings of the WALCOM: Algorithms and Computation, 2026

Nemesis, an Escape Game in Graphs.
Proceedings of the 13th International Conference on Fun with Algorithms, 2026

2025
Largest planar graphs of diameter <i>3</i> and fixed maximum degree - connection with fractional matchings.
CoRR, July, 2025

The Closed Geodetic Game: Algorithms and Strategies.
Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025

Reconstructing Graphs from Subgraph Compositions.
Proceedings of the IEEE International Symposium on Information Theory, 2025

2024
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
CoRR, 2024

Algorithms and Complexity for Path Covers of Temporal DAGs.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

The Canadian Traveller Problem on Outerplanar Graphs.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Resolving Sets in Temporal Graphs.
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

How Did They Design This Game? Swish: Complexity and Unplayable Positions.
Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2023
Neighbour sum distinguishing edge-weightings with local constraints.
Discret. Appl. Math., September, 2023

The Balancing Number and Generalized Balancing Number of Some Graph Classes.
Electron. J. Comb., 2023

Algorithms and Hardness for Metric Dimension on Digraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2022
The neighbour sum distinguishing edge-weighting with local constraints.
CoRR, 2022

The neighbour sum distinguishing relaxed edge colouring.
Appl. Math. Comput., 2022

Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021
On the balanceability of some graph classes.
Discret. Appl. Math., 2021

2020
Partition games.
Discret. Appl. Math., 2020

2019
Connected Subtraction Games on Subdivided Stars.
Integers, 2019

A generalization of Arc-Kayles.
Int. J. Game Theory, 2019

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs.
Discret. Math., 2019

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

Octal games on graphs: The game 0.33 on subdivided stars and bistars.
Theor. Comput. Sci., 2018

Partition games are pure breaking games.
CoRR, 2018

2017
A Vizing-like theorem for union vertex-distinguishing edge coloring.
Discret. Appl. Math., 2017


  Loading...