Nicolas Catusse

According to our database, Nicolas Catusse authored at least 18 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Computational bounds on randomized algorithms for online bin stretching.

Antoine Lhomme, Nicolas Catusse, Nadia Brauner

CoRR, 2024

2022

Innovative ideas for teaching supports: Application to Graph theory.

Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Bernard Penz, Florian Fontan

CoRR, 2022

Online bin stretching lower bounds: Improved search of computational proofs.

Antoine Lhomme, Olivier Romane, Nicolas Catusse, Nadia Brauner

CoRR, 2022

Dealing with elementary paths in the Kidney Exchange Problem.

Lucie Pansart, Hadrien Cambazard, Nicolas Catusse

CoRR, 2022

Teaching OR: automatic evaluation for linear programming modelling.

Hadrien Cambazard, Nicolas Catusse, Nadia Brauner, Pierre Lemaire

4OR, 2022

2021

An Integer Programming Formulation Using Convex Polygons for the Convex Partition Problem.

Hadrien Cambazard, Nicolas Catusse

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

An efficient and general approach for the joint order batching and picker routing problem.

Olivier Briant, Hadrien Cambazard, Diego Cattaruzza, Nicolas Catusse, Anne-Laure Ladier, Maxime Ogier

Eur. J. Oper. Res., 2020

New Randomized Strategies for the Color Coding Algorithm.

Lucie Pansart, Hadrien Cambazard, Nicolas Catusse

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019

An integrated sizing and planning problem in designing diverse vegetable farming systems.

Nicolas Brulard, Van-Dat Cung, Nicolas Catusse, Cyril Dutrieux

Int. J. Prod. Res., 2019

2018

Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane.

Hadrien Cambazard, Nicolas Catusse

Eur. J. Oper. Res., 2018

Exact algorithms for the order picking problem.

Lucie Pansart, Nicolas Catusse, Hadrien Cambazard

Comput. Oper. Res., 2018

2017

Bidirected minimum Manhattan network problem.

Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès

Networks, 2017

Exact algorithms for the picking problem.

Lucie Pansart, Nicolas Catusse, Hadrien Cambazard

CoRR, 2017

2016

A Branch-and-Price Algorithm for Scheduling Observations on a Telescope.

Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Pierre Lemaire, Bernard Penz, Anne-Marie Lagrange, Pascal Rubini

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2012

Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm.

Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès

Algorithmica, 2012

2011

Embedding into the rectilinear plane in optimal O(n²) time.

Nicolas Catusse, Victor Chepoi, Yann Vaxès

Theor. Comput. Sci., 2011

2010

Planar Hop Spanners for Unit Disk Graphs.

Nicolas Catusse, Victor Chepoi, Yann Vaxès

Proceedings of the Algorithms for Sensor Systems, 2010

2009

Embedding into the rectilinear plane in optimal O*(n^2)

Nicolas Catusse, Victor Chepoi, Yann Vaxès

CoRR, 2009