On Labeled Traveling Salesman Problems. - Basile Couëtoux; Laurent Gourvès; Jérôme Monnot; Orestis Telelis (ISAAC, 2008)

Covering a Graph with a Constrained Forest (Extended Abstract). - Cristina Bazgan; Basile Couëtoux; Zsolt Tuza (ISAAC, 2009)

Labeled Traveling Salesman Problems: Complexity and approximation. - Basile Couëtoux; Laurent Gourvès; Jérôme Monnot; Orestis Telelis (Discret. Optim., 2010)

A $ frac{3}{2}$ Approximation for a Constrained Forest Problem. - Basile Couëtoux (ESA, 2011)

Complexity and approximation of the Constrained Forest problem. - Cristina Bazgan; Basile Couëtoux; Zsolt Tuza (Theor. Comput. Sci., 2011)

Complexity Results for the Empire Problem in Collection of Stars. - Basile Couëtoux; Jérôme Monnot; Sonia Toubaline (COCOA, 2012)

A 3/2-approximation algorithm for some minimum-cost graph problems. - Basile Couëtoux; James M. Davis; David P. Williamson (Math. Program., 2015)

The Maximum Labeled Path Problem. - Basile Couëtoux; Elie Nakache; Yann Vaxès (Algorithmica, 2017)

Optimizing the ecological connectivity of landscapes with generalized flow models and preprocessing. - François Hamonic; Cécile Albert; Basile Couëtoux; Yann Vaxès (CoRR, 2021)

Vessel Behaviour Classification from AIS Without Geographical Biases. - Raphael Sturgis; Valentin Emiya; Basile Couëtoux; Pierre Garreau (ITSC, 2022)

Optimizing the ecological connectivity of landscapes. - François Hamonic; Cécile Albert; Basile Couëtoux; Yann Vaxès (Networks, 2023)

The Steady-States of Splitter Networks. - Basile Couëtoux; Bastien Gastaldi; Guyslain Naves (FUN, 2024)

A quasi-optimal upper bound for induced paths in sparse graphs. - Basile Couëtoux; Oscar Defrain; Jean-Florent Raymond (CoRR, 2025)