New Results About the Linearization of Scaffolds Sharing Repeated Contigs. - Dorine Tabary; Tom Davot; Mathias Weller; Annie Chateau; Rodolphe Giroudeau (COCOA, 2018)

On the Hardness of Approximating Linearization of Scaffolds Sharing Repeated Contigs. - Tom Davot; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (RECOMB-CG, 2018)

New Polynomial-Time Algorithm Around the Scaffolding Problem. - Tom Davot; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (AlCoB, 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)

Linearizing Genomes: Exact Methods and Local Search. - Tom Davot; Annie Chateau; Rodolphe Giroudeau; Mathias Weller (SOFSEM, 2020)

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

Complexity and Approximation Results on the Shared Transportation Problem. - Tom Davot; Rodolphe Giroudeau; Jean-Claude König (COCOA, 2021)

On the Approximation Hardness of Geodetic Set and Its Variants. - Tom Davot; Lucas Isenmann; Jocelyn Thiebaut (COCOON, 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)

Efficient assembly consensus algorithms for divergent contig sets. - Annie Chateau; Tom Davot; Manuel Lafond (Comput. Biol. Chem., 2021)

On a greedy approach for genome scaffolding. - Tom Davot; Annie Chateau; Rohan Fossé; Rodolphe Giroudeau; Mathias Weller (Algorithms Mol. Biol., 2022)

On the Enumeration of Non-dominated Spanning Trees with Imprecise Weights. - Tom Davot; Sébastien Destercke; David Savourey (ECSQARU, 2023)

Degreewidth: A New Parameter for Solving Problems on Tournaments. - Tom Davot; Lucas Isenmann; Sanjukta Roy 001; Jocelyn Thiebaut (WG, 2023)

Ricochet Robots with Infinite Horizontal Board is Turing-complete. - Samuel Masseport; Tom Davot; Rodolphe Giroudeau (J. Inf. Process., 2023)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve. - Tom Davot; Jessica A. Enright; Jayakrishnan Madathil; Kitty Meeks (CoRR, 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)

On the Shared Transportation Problem: Computational Hardness and Exact Approach. - Tom Davot; Rodolphe Giroudeau; Jean-Claude König (Int. J. Found. Comput. Sci., 2024)

Temporal Triadic Closure: Finding Dense Substructures in Social Networks That Evolve over Time. - Tom Davot; Jessica A. Enright; Jayakrishnan Madathil; Kitty Meeks (AAAI, 2025)

On the Complexity of 2-Club Cluster Editing with Vertex Splitting. - Faisal N. Abu-Khzam; Tom Davot; Lucas Isenmann; Sergio Thoumi (COCOON (2), 2025)

Parameterised algorithms for temporal reconfiguration problems. - Tom Davot; Jessica A. Enright; Laura Larios-Jones (CoRR, 2025)