Basile Couëtoux

15 papers A 1B 3C 1Misc 1Journal 8Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
A quasi-optimal upper bound for induced paths in sparse graphs.
CoRR
Basile Couëtoux, Oscar Defrain, Jean-Florent Raymond
2024 Misc conf
The Steady-States of Splitter Networks.
FUN
Basile Couëtoux, Bastien Gastaldi, Guyslain Naves
2024 J jnl
The steady-states of splitter networks.
CoRR
Basile Couëtoux, Bastien Gastaldi, Guyslain Naves
2023 J jnl
Optimizing the ecological connectivity of landscapes.
Networks
François Hamonic, Cécile Albert, Basile Couëtoux, Yann Vaxès
2022 — conf
Vessel Behaviour Classification from AIS Without Geographical Biases.
ITSC
Raphael Sturgis, Valentin Emiya, Basile Couëtoux, Pierre Garreau
2021 J jnl
Optimizing the ecological connectivity of landscapes with generalized flow models and preprocessing.
CoRR
François Hamonic, Cécile Albert, Basile Couëtoux, Yann Vaxès
2017 J jnl
The Maximum Labeled Path Problem.
Algorithmica
Basile Couëtoux, Elie Nakache, Yann Vaxès
2015 J jnl
A 3/2-approximation algorithm for some minimum-cost graph problems.
Math. Program.
Basile Couëtoux, James M. Davis, David P. Williamson
2014 B conf
The Maximum Labeled Path Problem.
WG
Basile Couëtoux, Elie Nakache, Yann Vaxès
2012 C conf
Complexity Results for the Empire Problem in Collection of Stars.
COCOA
Basile Couëtoux, Jérôme Monnot, Sonia Toubaline
2011 A conf
A $\frac{3}{2}$ Approximation for a Constrained Forest Problem.
ESA
Basile Couëtoux
2011 J jnl
Complexity and approximation of the Constrained Forest problem.
Theor. Comput. Sci.
Cristina Bazgan, Basile Couëtoux, Zsolt Tuza
2010 J jnl
Labeled Traveling Salesman Problems: Complexity and approximation.
Discret. Optim.
Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis
2009 B conf
Covering a Graph with a Constrained Forest (Extended Abstract).
ISAAC
Cristina Bazgan, Basile Couëtoux, Zsolt Tuza
2008 B conf
On Labeled Traveling Salesman Problems.
ISAAC
Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis