Tom Davot

According to our database, Tom Davot authored at least 20 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Parameterised algorithms for temporal reconfiguration problems.

Tom Davot, Jessica A. Enright, Laura Larios-Jones

CoRR, February, 2025

On the Complexity of 2-Club Cluster Editing with Vertex Splitting.

Faisal N. Abu-Khzam, Tom Davot, Lucas Isenmann, Sergio Thoumi

Proceedings of the Computing and Combinatorics, 2025

Temporal Triadic Closure: Finding Dense Substructures in Social Networks That Evolve over Time.

Tom Davot, Jessica A. Enright, Jayakrishnan Madathil, Kitty Meeks

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024

On the Shared Transportation Problem: Computational Hardness and Exact Approach.

Tom Davot, Rodolphe Giroudeau, Jean-Claude König

Int. J. Found. Comput. Sci., September, 2024

On the enumeration of non-dominated matroids with imprecise weights.

Tom Davot, Tuan-Anh Vu, Sébastien Destercke, David Savourey

Int. J. Approx. Reason., 2024

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve.

Tom Davot, Jessica A. Enright, Jayakrishnan Madathil, Kitty Meeks

CoRR, 2024

2023

Ricochet Robots with Infinite Horizontal Board is Turing-complete.

Samuel Masseport, Tom Davot, Rodolphe Giroudeau

J. Inf. Process., 2023

Degreewidth: A New Parameter for Solving Problems on Tournaments.

Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

On the Enumeration of Non-dominated Spanning Trees with Imprecise Weights.

Tom Davot, Sébastien Destercke, David Savourey

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2023

2022

On a greedy approach for genome scaffolding.

Tom Davot, Annie Chateau, Rohan Fossé, Rodolphe Giroudeau, Mathias Weller

Algorithms Mol. Biol., 2022

2021

Efficient assembly consensus algorithms for divergent contig sets.

Annie Chateau, Tom Davot, Manuel Lafond

Comput. Biol. Chem., 2021

Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds.

Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller, Dorine Tabary

Algorithmica, 2021

On the Approximation Hardness of Geodetic Set and Its Variants.

Tom Davot, Lucas Isenmann, Jocelyn Thiebaut

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

Complexity and Approximation Results on the Shared Transportation Problem.

Tom Davot, Rodolphe Giroudeau, Jean-Claude König

Proceedings of the Combinatorial Optimization and Applications, 2021

2020

À la recherche de l'échafaudage parfait : efficace, de qualité et garanti. (Looking for the perfect scaffolding: efficient, quality and guaranteed).

Tom Davot

PhD thesis, 2020

Linearizing Genomes: Exact Methods and Local Search.

Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019

A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions.

Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak

Discret. Math. Theor. Comput. Sci., 2019

New Polynomial-Time Algorithm Around the Scaffolding Problem.

Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller

Proceedings of the Algorithms for Computational Biology - 6th International Conference, 2019

2018

On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs.

Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller

Proceedings of the Comparative Genomics - 16th International Conference, 2018

New Results About the Linearization of Scaffolds Sharing Repeated Contigs.

Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau

Proceedings of the Combinatorial Optimization and Applications, 2018