Thomas Dissaux

Orcid: 0000-0002-0570-909X

According to our database¹, Thomas Dissaux authored at least 5 papers between 2021 and 2025.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2025

Further results on the Hunters and Rabbit game through monotonicity.

[BibT_eX]

[DOI]

Inf. Comput., 2025

2023

Décomposition de graphes : longueur arborescente et jeux de poursuite. (Graph decompositions : treelength and pursuit-evasion games).

[BibT_eX]

[DOI]

Thomas Dissaux

PhD thesis, 2023

Recontamination Helps a Lot to Hunt a Rabbit.

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

Pathlength of Outerplanar Graphs.

[BibT_eX]

[DOI]

Thomas Dissaux

Nicolas Nisse

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

Treelength of Series-parallel Graphs.

[BibT_eX]

[DOI]

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

Thomas Dissaux

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...