Guiding Random Walks by Effective Resistance for Effective Node Embedding. - Abderaouf Gacem; Mohammed Haddad 001; Hamida Seba; Gaétan Berthe; Michel Habib (ICPRAI (1), 2022)

PACE Solver Description: DreyFVS. - Gabriel Bathie; Gaétan Berthe; Yoann Coudert-Osmont; David Desobry; Amadeus Reinald; Mathis Rocton (IPEC, 2022)

PACE Solver Description: Touiouidth. - Gaétan Berthe; Yoann Coudert-Osmont; Alexander Dobler; Laure Morelle; Amadeus Reinald; Mathis Rocton (IPEC, 2023)

Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments. - Gaétan Berthe; Marin Bougeret; Daniel Gonçalves 001; Jean-Florent Raymond (CoRR, 2023)

The Complexity of L(p, q)-Edge-Labelling. - Gaétan Berthe; Barnaby Martin; Daniël Paulusma; Siani Smith (Algorithmica, 2023)

Kick the Cliques. - Gaétan Berthe; Marin Bougeret; Daniel Gonçalves 001; Jean-Florent Raymond (IPEC, 2024)

Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius. - Gaétan Berthe; Marin Bougeret; Daniel Gonçalves 001; Jean-Florent Raymond (SWAT, 2024)

Feedback Vertex Set for Pseudo-disk Graphs in Subexponential FPT Time. - Gaétan Berthe; Marin Bougeret; Daniel Gonçalves 001; Jean-Florent Raymond (WG, 2024)

Pushing the Frontiers of Subexponential FPT Time for Feedback Vertex Set. - Gaétan Berthe; Marin Bougeret; Daniel Gonçalves 001; Jean-Florent Raymond (ICALP, 2025)

Determining a graph from its reconfiguration graph. - Gaétan Berthe; Caroline Brosse; Brian Hearn; Jan van den Heuvel; Pierre Hoppenot; Théo Pierron (CoRR, 2025)

On Modular Edge Colourings of Graphs. - Gaétan Berthe; Marthe Bonamy; Fábio Botler; Gaia Carenini; Lucas Colucci; Arthur Dumas; Fatemeh Ghasemi; Pedro Mariano Viana Neto (CoRR, 2025)