default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Catusse
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j8]Hadrien Cambazard, Nicolas Catusse, Nadia Brauner
, Pierre Lemaire:
Teaching OR: automatic evaluation for linear programming modelling. 4OR 20(2): 333-345 (2022)- 2020
- [j7]Olivier Briant, Hadrien Cambazard, Diego Cattaruzza, Nicolas Catusse, Anne-Laure Ladier, Maxime Ogier:
An efficient and general approach for the joint order batching and picker routing problem. Eur. J. Oper. Res. 285(2): 497-512 (2020) - 2019
- [j6]Nicolas Brulard, Van-Dat Cung, Nicolas Catusse, Cyril Dutrieux:
An integrated sizing and planning problem in designing diverse vegetable farming systems. Int. J. Prod. Res. 57(4): 1018-1036 (2019) - 2018
- [j5]Lucie Pansart, Nicolas Catusse, Hadrien Cambazard:
Exact algorithms for the order picking problem. Comput. Oper. Res. 100: 117-127 (2018) - [j4]Hadrien Cambazard, Nicolas Catusse:
Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane. Eur. J. Oper. Res. 270(2): 419-429 (2018) - 2017
- [j3]Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Bidirected minimum Manhattan network problem. Networks 69(2): 167-178 (2017) - 2012
- [j2]Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm. Algorithmica 63(1-2): 551-567 (2012) - 2011
- [j1]Nicolas Catusse, Victor Chepoi, Yann Vaxès:
Embedding into the rectilinear plane in optimal O(n2) time. Theor. Comput. Sci. 412(22): 2425-2433 (2011)
Conference and Workshop Papers
- 2021
- [c4]Hadrien Cambazard, Nicolas Catusse:
An Integer Programming Formulation Using Convex Polygons for the Convex Partition Problem. SoCG 2021: 20:1-20:13 - 2020
- [c3]Lucie Pansart, Hadrien Cambazard, Nicolas Catusse:
New Randomized Strategies for the Color Coding Algorithm. ECAI 2020: 466-473 - 2016
- [c2]Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Pierre Lemaire, Bernard Penz, Anne-Marie Lagrange, Pascal Rubini:
A Branch-and-Price Algorithm for Scheduling Observations on a Telescope. IJCAI 2016: 3060-3066 - 2010
- [c1]Nicolas Catusse, Victor Chepoi, Yann Vaxès:
Planar Hop Spanners for Unit Disk Graphs. ALGOSENSORS 2010: 16-30
Informal and Other Publications
- 2024
- [i10]Antoine Lhomme, Nicolas Catusse, Nadia Brauner:
Computational bounds on randomized algorithms for online bin stretching. CoRR abs/2405.19071 (2024) - 2022
- [i9]Lucie Pansart, Hadrien Cambazard, Nicolas Catusse:
Dealing with elementary paths in the Kidney Exchange Problem. CoRR abs/2201.08446 (2022) - [i8]Antoine Lhomme, Olivier Romane, Nicolas Catusse, Nadia Brauner:
Online bin stretching lower bounds: Improved search of computational proofs. CoRR abs/2207.04931 (2022) - [i7]Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Bernard Penz, Florian Fontan:
Innovative ideas for teaching supports: Application to Graph theory. CoRR abs/2209.05078 (2022) - 2020
- [i6]Hadrien Cambazard, Nicolas Catusse:
An integer programming formulation using convex polygons for the convex partition problem. CoRR abs/2012.07939 (2020) - 2017
- [i5]Lucie Pansart, Nicolas Catusse, Hadrien Cambazard:
Exact algorithms for the picking problem. CoRR abs/1703.00699 (2017) - 2015
- [i4]Hadrien Cambazard, Nicolas Catusse:
Fixed-Parameter Algorithms for Rectilinear Steiner tree and Rectilinear Traveling Salesman Problem in the plane. CoRR abs/1512.06649 (2015) - 2011
- [i3]Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Bidirected minimum Manhattan network problem. CoRR abs/1107.1359 (2011) - 2010
- [i2]Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm. CoRR abs/1004.5517 (2010) - 2009
- [i1]Nicolas Catusse, Victor Chepoi, Yann Vaxès:
Embedding into the rectilinear plane in optimal O*(n^2). CoRR abs/0910.1059 (2009)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
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:
