default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Nicolas Catusse
@article{DBLP:journals/corr/abs-2405-19071,
author = {Antoine Lhomme and
Nicolas Catusse and
Nadia Brauner},
title = {Computational bounds on randomized algorithms for online bin stretching},
journal = {CoRR},
volume = {abs/2405.19071},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2405.19071},
doi = {10.48550/ARXIV.2405.19071},
eprinttype = {arXiv},
eprint = {2405.19071},
timestamp = {Mon, 24 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2405-19071.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/CambazardCBL22,
author = {Hadrien Cambazard and
Nicolas Catusse and
Nadia Brauner and
Pierre Lemaire},
title = {Teaching {OR:} automatic evaluation for linear programming modelling},
journal = {4OR},
volume = {20},
number = {2},
pages = {333--345},
year = {2022},
url = {https://doi.org/10.1007/s10288-021-00488-9},
doi = {10.1007/S10288-021-00488-9},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/CambazardCBL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-08446,
author = {Lucie Pansart and
Hadrien Cambazard and
Nicolas Catusse},
title = {Dealing with elementary paths in the Kidney Exchange Problem},
journal = {CoRR},
volume = {abs/2201.08446},
year = {2022},
url = {https://arxiv.org/abs/2201.08446},
eprinttype = {arXiv},
eprint = {2201.08446},
timestamp = {Tue, 01 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-08446.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-04931,
author = {Antoine Lhomme and
Olivier Romane and
Nicolas Catusse and
Nadia Brauner},
title = {Online bin stretching lower bounds: Improved search of computational
proofs},
journal = {CoRR},
volume = {abs/2207.04931},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.04931},
doi = {10.48550/ARXIV.2207.04931},
eprinttype = {arXiv},
eprint = {2207.04931},
timestamp = {Wed, 13 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-04931.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-05078,
author = {Nicolas Catusse and
Hadrien Cambazard and
Nadia Brauner and
Bernard Penz and
Florian Fontan},
title = {Innovative ideas for teaching supports: Application to Graph theory},
journal = {CoRR},
volume = {abs/2209.05078},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.05078},
doi = {10.48550/ARXIV.2209.05078},
eprinttype = {arXiv},
eprint = {2209.05078},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-05078.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/CambazardC21,
author = {Hadrien Cambazard and
Nicolas Catusse},
editor = {Kevin Buchin and
{\'{E}}ric Colin de Verdi{\`{e}}re},
title = {An Integer Programming Formulation Using Convex Polygons for the Convex
Partition Problem},
booktitle = {37th International Symposium on Computational Geometry, SoCG 2021,
June 7-11, 2021, Buffalo, NY, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {189},
pages = {20:1--20:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2021.20},
doi = {10.4230/LIPICS.SOCG.2021.20},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/CambazardC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BriantCCCLO20,
author = {Olivier Briant and
Hadrien Cambazard and
Diego Cattaruzza and
Nicolas Catusse and
Anne{-}Laure Ladier and
Maxime Ogier},
title = {An efficient and general approach for the joint order batching and
picker routing problem},
journal = {Eur. J. Oper. Res.},
volume = {285},
number = {2},
pages = {497--512},
year = {2020},
url = {https://doi.org/10.1016/j.ejor.2020.01.059},
doi = {10.1016/J.EJOR.2020.01.059},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/BriantCCCLO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/PansartCC20,
author = {Lucie Pansart and
Hadrien Cambazard and
Nicolas Catusse},
editor = {Giuseppe De Giacomo and
Alejandro Catal{\'{a}} and
Bistra Dilkina and
Michela Milano and
Sen{\'{e}}n Barro and
Alberto Bugar{\'{\i}}n and
J{\'{e}}r{\^{o}}me Lang},
title = {New Randomized Strategies for the Color Coding Algorithm},
booktitle = {{ECAI} 2020 - 24th European Conference on Artificial Intelligence,
29 August-8 September 2020, Santiago de Compostela, Spain, August
29 - September 8, 2020 - Including 10th Conference on Prestigious
Applications of Artificial Intelligence {(PAIS} 2020)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {325},
pages = {466--473},
publisher = {{IOS} Press},
year = {2020},
url = {https://doi.org/10.3233/FAIA200127},
doi = {10.3233/FAIA200127},
timestamp = {Fri, 09 Apr 2021 18:50:05 +0200},
biburl = {https://dblp.org/rec/conf/ecai/PansartCC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-07939,
author = {Hadrien Cambazard and
Nicolas Catusse},
title = {An integer programming formulation using convex polygons for the convex
partition problem},
journal = {CoRR},
volume = {abs/2012.07939},
year = {2020},
url = {https://arxiv.org/abs/2012.07939},
eprinttype = {arXiv},
eprint = {2012.07939},
timestamp = {Sat, 02 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-07939.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijpr/BrulardCCD19,
author = {Nicolas Brulard and
Van{-}Dat Cung and
Nicolas Catusse and
Cyril Dutrieux},
title = {An integrated sizing and planning problem in designing diverse vegetable
farming systems},
journal = {Int. J. Prod. Res.},
volume = {57},
number = {4},
pages = {1018--1036},
year = {2019},
url = {https://doi.org/10.1080/00207543.2018.1498985},
doi = {10.1080/00207543.2018.1498985},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijpr/BrulardCCD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/PansartCC18,
author = {Lucie Pansart and
Nicolas Catusse and
Hadrien Cambazard},
title = {Exact algorithms for the order picking problem},
journal = {Comput. Oper. Res.},
volume = {100},
pages = {117--127},
year = {2018},
url = {https://doi.org/10.1016/j.cor.2018.07.002},
doi = {10.1016/J.COR.2018.07.002},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/PansartCC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/CambazardC18,
author = {Hadrien Cambazard and
Nicolas Catusse},
title = {Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear
traveling salesman problem in the plane},
journal = {Eur. J. Oper. Res.},
volume = {270},
number = {2},
pages = {419--429},
year = {2018},
url = {https://doi.org/10.1016/j.ejor.2018.03.042},
doi = {10.1016/J.EJOR.2018.03.042},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/CambazardC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CatusseCNV17,
author = {Nicolas Catusse and
Victor Chepoi and
Karim Nouioua and
Yann Vax{\`{e}}s},
title = {Bidirected minimum Manhattan network problem},
journal = {Networks},
volume = {69},
number = {2},
pages = {167--178},
year = {2017},
url = {https://doi.org/10.1002/net.21719},
doi = {10.1002/NET.21719},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CatusseCNV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PansartCC17,
author = {Lucie Pansart and
Nicolas Catusse and
Hadrien Cambazard},
title = {Exact algorithms for the picking problem},
journal = {CoRR},
volume = {abs/1703.00699},
year = {2017},
url = {http://arxiv.org/abs/1703.00699},
eprinttype = {arXiv},
eprint = {1703.00699},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PansartCC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/CatusseCBLPLR16,
author = {Nicolas Catusse and
Hadrien Cambazard and
Nadia Brauner and
Pierre Lemaire and
Bernard Penz and
Anne{-}Marie Lagrange and
Pascal Rubini},
editor = {Subbarao Kambhampati},
title = {A Branch-and-Price Algorithm for Scheduling Observations on a Telescope},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI} 2016, New York, NY, USA, 9-15 July
2016},
pages = {3060--3066},
publisher = {{IJCAI/AAAI} Press},
year = {2016},
url = {http://www.ijcai.org/Abstract/16/434},
timestamp = {Tue, 20 Aug 2019 16:19:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/CatusseCBLPLR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CambazardC15,
author = {Hadrien Cambazard and
Nicolas Catusse},
title = {Fixed-Parameter Algorithms for Rectilinear Steiner tree and Rectilinear
Traveling Salesman Problem in the plane},
journal = {CoRR},
volume = {abs/1512.06649},
year = {2015},
url = {http://arxiv.org/abs/1512.06649},
eprinttype = {arXiv},
eprint = {1512.06649},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CambazardC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CatusseCNV12,
author = {Nicolas Catusse and
Victor Chepoi and
Karim Nouioua and
Yann Vax{\`{e}}s},
title = {Minimum Manhattan Network Problem in Normed Planes with Polygonal
Balls: {A} Factor 2.5 Approximation Algorithm},
journal = {Algorithmica},
volume = {63},
number = {1-2},
pages = {551--567},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9560-z},
doi = {10.1007/S00453-011-9560-Z},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CatusseCNV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CatusseCV11,
author = {Nicolas Catusse and
Victor Chepoi and
Yann Vax{\`{e}}s},
title = {Embedding into the rectilinear plane in optimal O(n\({}^{\mbox{2}}\))
time},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2425--2433},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.038},
doi = {10.1016/J.TCS.2011.01.038},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CatusseCV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-1359,
author = {Nicolas Catusse and
Victor Chepoi and
Karim Nouioua and
Yann Vax{\`{e}}s},
title = {Bidirected minimum Manhattan network problem},
journal = {CoRR},
volume = {abs/1107.1359},
year = {2011},
url = {http://arxiv.org/abs/1107.1359},
eprinttype = {arXiv},
eprint = {1107.1359},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-1359.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algosensors/CatusseCV10,
author = {Nicolas Catusse and
Victor Chepoi and
Yann Vax{\`{e}}s},
editor = {Christian Scheideler},
title = {Planar Hop Spanners for Unit Disk Graphs},
booktitle = {Algorithms for Sensor Systems - 6th International Workshop on Algorithms
for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile
Entities, {ALGOSENSORS} 2010, Bordeaux, France, July 5, 2010, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6451},
pages = {16--30},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16988-5\_2},
doi = {10.1007/978-3-642-16988-5\_2},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/algosensors/CatusseCV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CatusseCNV10,
author = {Nicolas Catusse and
Victor Chepoi and
Karim Nouioua and
Yann Vax{\`{e}}s},
title = {Minimum Manhattan network problem in normed planes with polygonal
balls: a factor 2.5 approximation algorithm},
journal = {CoRR},
volume = {abs/1004.5517},
year = {2010},
url = {http://arxiv.org/abs/1004.5517},
eprinttype = {arXiv},
eprint = {1004.5517},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CatusseCNV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0910-1059,
author = {Nicolas Catusse and
Victor Chepoi and
Yann Vax{\`{e}}s},
title = {Embedding into the rectilinear plane in optimal O*(n{\^{}}2)},
journal = {CoRR},
volume = {abs/0910.1059},
year = {2009},
url = {http://arxiv.org/abs/0910.1059},
eprinttype = {arXiv},
eprint = {0910.1059},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0910-1059.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 2024-06-25 21:50 CEST 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
