BibTeX records: Basile Couëtoux

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

> Home > Persons > Basile Couëtoux

download as .bib file

@article{DBLP:journals/corr/abs-2507-22509,
  author       = {Basile Cou{\"{e}}toux and
                  Oscar Defrain and
                  Jean{-}Florent Raymond},
  title        = {A quasi-optimal upper bound for induced paths in sparse graphs},
  journal      = {CoRR},
  volume       = {abs/2507.22509},
  year         = {2025},
  url          = {https://doi.org/10.48550/arXiv.2507.22509},
  doi          = {10.48550/ARXIV.2507.22509},
  eprinttype   = {arXiv},
  eprint       = {2507.22509},
  timestamp    = {Fri, 22 Aug 2025 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2507-22509.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fun/CouetouxGN24,
  author       = {Basile Cou{\"{e}}toux and
                  Bastien Gastaldi and
                  Guyslain Naves},
  editor       = {Andrei Z. Broder and
                  Tami Tamir},
  title        = {The Steady-States of Splitter Networks},
  booktitle    = {12th International Conference on Fun with Algorithms, {FUN} 2024,
                  Island of La Maddalena, Sardinia, Italy, June 4-8, 2024},
  series       = {LIPIcs},
  volume       = {291},
  pages        = {9:1--9:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2024},
  url          = {https://doi.org/10.4230/LIPIcs.FUN.2024.9},
  doi          = {10.4230/LIPICS.FUN.2024.9},
  timestamp    = {Fri, 21 Nov 2025 23:44:11 +0100},
  biburl       = {https://dblp.org/rec/conf/fun/CouetouxGN24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2404-05472,
  author       = {Basile Cou{\"{e}}toux and
                  Bastien Gastaldi and
                  Guyslain Naves},
  title        = {The steady-states of splitter networks},
  journal      = {CoRR},
  volume       = {abs/2404.05472},
  year         = {2024},
  url          = {https://doi.org/10.48550/arXiv.2404.05472},
  doi          = {10.48550/ARXIV.2404.05472},
  eprinttype   = {arXiv},
  eprint       = {2404.05472},
  timestamp    = {Wed, 15 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2404-05472.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/HamonicACV23,
  author       = {Fran{\c{c}}ois Hamonic and
                  C{\'{e}}cile Albert and
                  Basile Cou{\"{e}}toux and
                  Yann Vax{\`{e}}s},
  title        = {Optimizing the ecological connectivity of landscapes},
  journal      = {Networks},
  volume       = {81},
  number       = {2},
  pages        = {278--293},
  year         = {2023},
  url          = {https://doi.org/10.1002/net.22131},
  doi          = {10.1002/NET.22131},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/HamonicACV23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/itsc/SturgisECG22,
  author       = {Raphael Sturgis and
                  Valentin Emiya and
                  Basile Cou{\"{e}}toux and
                  Pierre Garreau},
  title        = {Vessel Behaviour Classification from {AIS} Without Geographical Biases},
  booktitle    = {25th {IEEE} International Conference on Intelligent Transportation
                  Systems, {ITSC} 2022, Macau, China, October 8-12, 2022},
  pages        = {2465--2470},
  publisher    = {{IEEE}},
  year         = {2022},
  url          = {https://doi.org/10.1109/ITSC55140.2022.9921946},
  doi          = {10.1109/ITSC55140.2022.9921946},
  timestamp    = {Thu, 10 Nov 2022 21:13:36 +0100},
  biburl       = {https://dblp.org/rec/conf/itsc/SturgisECG22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2109-06622,
  author       = {Fran{\c{c}}ois Hamonic and
                  C{\'{e}}cile Albert and
                  Basile Cou{\"{e}}toux and
                  Yann Vax{\`{e}}s},
  title        = {Optimizing the ecological connectivity of landscapes with generalized
                  flow models and preprocessing},
  journal      = {CoRR},
  volume       = {abs/2109.06622},
  year         = {2021},
  url          = {https://arxiv.org/abs/2109.06622},
  eprinttype   = {arXiv},
  eprint       = {2109.06622},
  timestamp    = {Tue, 21 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2109-06622.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/CouetouxNV17,
  author       = {Basile Cou{\"{e}}toux and
                  Elie Nakache and
                  Yann Vax{\`{e}}s},
  title        = {The Maximum Labeled Path Problem},
  journal      = {Algorithmica},
  volume       = {78},
  number       = {1},
  pages        = {298--318},
  year         = {2017},
  url          = {https://doi.org/10.1007/s00453-016-0155-6},
  doi          = {10.1007/S00453-016-0155-6},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/CouetouxNV17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mp/CouetouxDW15,
  author       = {Basile Cou{\"{e}}toux and
                  James M. Davis and
                  David P. Williamson},
  title        = {A 3/2-approximation algorithm for some minimum-cost graph problems},
  journal      = {Math. Program.},
  volume       = {150},
  number       = {1},
  pages        = {19--34},
  year         = {2015},
  url          = {https://doi.org/10.1007/s10107-013-0727-z},
  doi          = {10.1007/S10107-013-0727-Z},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/CouetouxDW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wg/CouetouxNV14,
  author       = {Basile Cou{\"{e}}toux and
                  Elie Nakache and
                  Yann Vax{\`{e}}s},
  editor       = {Dieter Kratsch and
                  Ioan Todinca},
  title        = {The Maximum Labeled Path Problem},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 40th International
                  Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
                  Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8747},
  pages        = {152--163},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-12340-0\_13},
  doi          = {10.1007/978-3-319-12340-0\_13},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/CouetouxNV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cocoa/CouetouxMT12,
  author       = {Basile Cou{\"{e}}toux and
                  J{\'{e}}r{\^{o}}me Monnot and
                  Sonia Toubaline},
  editor       = {Guohui Lin},
  title        = {Complexity Results for the Empire Problem in Collection of Stars},
  booktitle    = {Combinatorial Optimization and Applications - 6th International Conference,
                  {COCOA} 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7402},
  pages        = {73--82},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-31770-5\_7},
  doi          = {10.1007/978-3-642-31770-5\_7},
  timestamp    = {Tue, 14 May 2019 10:00:52 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoa/CouetouxMT12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BazganCT11,
  author       = {Cristina Bazgan and
                  Basile Cou{\"{e}}toux and
                  Zsolt Tuza},
  title        = {Complexity and approximation of the Constrained Forest problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {412},
  number       = {32},
  pages        = {4081--4091},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.tcs.2010.07.018},
  doi          = {10.1016/J.TCS.2010.07.018},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BazganCT11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/esa/Couetoux11,
  author       = {Basile Cou{\"{e}}toux},
  editor       = {Camil Demetrescu and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson},
  title        = {A {\textdollar}{\textbackslash}frac\{3\}\{2\}{\textdollar} Approximation
                  for a Constrained Forest Problem},
  booktitle    = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
                  Germany, September 5-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6942},
  pages        = {652--663},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23719-5\_55},
  doi          = {10.1007/978-3-642-23719-5\_55},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/Couetoux11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/CouetouxGMT10,
  author       = {Basile Cou{\"{e}}toux and
                  Laurent Gourv{\`{e}}s and
                  J{\'{e}}r{\^{o}}me Monnot and
                  Orestis Telelis},
  title        = {Labeled Traveling Salesman Problems: Complexity and approximation},
  journal      = {Discret. Optim.},
  volume       = {7},
  number       = {1-2},
  pages        = {74--85},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disopt.2010.02.003},
  doi          = {10.1016/J.DISOPT.2010.02.003},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/CouetouxGMT10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/isaac/BazganCT09,
  author       = {Cristina Bazgan and
                  Basile Cou{\"{e}}toux and
                  Zsolt Tuza},
  editor       = {Yingfei Dong and
                  Ding{-}Zhu Du and
                  Oscar H. Ibarra},
  title        = {Covering a Graph with a Constrained Forest (Extended Abstract)},
  booktitle    = {Algorithms and Computation, 20th International Symposium, {ISAAC}
                  2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5878},
  pages        = {892--901},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-10631-6\_90},
  doi          = {10.1007/978-3-642-10631-6\_90},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/BazganCT09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/isaac/CouetouxGMT08,
  author       = {Basile Cou{\"{e}}toux and
                  Laurent Gourv{\`{e}}s and
                  J{\'{e}}r{\^{o}}me Monnot and
                  Orestis Telelis},
  editor       = {Seok{-}Hee Hong and
                  Hiroshi Nagamochi and
                  Takuro Fukunaga},
  title        = {On Labeled Traveling Salesman Problems},
  booktitle    = {Algorithms and Computation, 19th International Symposium, {ISAAC}
                  2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5369},
  pages        = {776--787},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-92182-0\_68},
  doi          = {10.1007/978-3-540-92182-0\_68},
  timestamp    = {Thu, 27 Apr 2023 14:57:19 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/CouetouxGMT08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

last updated on 2025-11-22 05:30 CET by the dblp team

all metadata released as open data under CC0 1.0 license

see also: Terms of Use | Privacy Policy | Imprint

dblp was originally created in 1993 at:

since 2018, dblp has been operated, funded, and maintained by:

Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.