Basile Couëtoux

According to our database, Basile Couëtoux authored at least 12 papers between 2008 and 2024.

Collaborative distances:

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

2024

The Steady-States of Splitter Networks.

Basile Couëtoux, Bastien Gastaldi, Guyslain Naves

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2023

Optimizing the ecological connectivity of landscapes.

François Hamonic, Cécile Albert, Basile Couëtoux, Yann Vaxès

Networks, March, 2023

2022

Vessel Behaviour Classification from AIS Without Geographical Biases.

Raphael Sturgis, Valentin Emiya, Basile Couëtoux, Pierre Garreau

Proceedings of the 25th IEEE International Conference on Intelligent Transportation Systems, 2022

2021

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

2017

The Maximum Labeled Path Problem.

Basile Couëtoux, Elie Nakache, Yann Vaxès

Algorithmica, 2017

2015

A 3/2-approximation algorithm for some minimum-cost graph problems.

Basile Couëtoux, James M. Davis, David P. Williamson

Math. Program., 2015

2012

Complexity Results for the Empire Problem in Collection of Stars.

Basile Couëtoux, Jérôme Monnot, Sonia Toubaline

Proceedings of the Combinatorial Optimization and Applications, 2012

2011

Complexity and approximation of the Constrained Forest problem.

Cristina Bazgan, Basile Couëtoux, Zsolt Tuza

Theor. Comput. Sci., 2011

A $\frac{3}{2}$ Approximation for a Constrained Forest Problem.

Basile Couëtoux

Proceedings of the Algorithms - ESA 2011, 2011

2010

Labeled Traveling Salesman Problems: Complexity and approximation.

Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis

Discret. Optim., 2010

2009

Covering a Graph with a Constrained Forest (Extended Abstract).

Cristina Bazgan, Basile Couëtoux, Zsolt Tuza

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

On Labeled Traveling Salesman Problems.

Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008