Antoine Dailly

According to our database1, Antoine Dailly authored at least 18 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Resolving Sets in Temporal Graphs.
CoRR, 2024

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

The Canadian Traveller Problem on outerplanar graphs.
CoRR, 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...