Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. - Victor Chepoi; Bertrand Estellon; Karim Nouioua; Yann Vaxès (Algorithmica, 2006)

Large neighborhood improvements for solving car sequencing problems. - Bertrand Estellon; Frédéric Gardi; Karim Nouioua (RAIRO Oper. Res., 2006)

Pareto envelopes in R3 under l1 and linfinity distance functions. - Victor Chepoi; Karim Nouioua (SCG, 2007)

Two local search approaches for solving real-life car sequencing problems. - Bertrand Estellon; Frédéric Gardi; Karim Nouioua (Eur. J. Oper. Res., 2008)

A rounding algorithm for approximating minimum Manhattan networks. - Victor Chepoi; Karim Nouioua; Yann Vaxès (Theor. Comput. Sci., 2008)

High-Performance Local Search for Task Scheduling with Human Resource Allocation. - Bertrand Estellon; Frédéric Gardi; Karim Nouioua (SLS, 2009)

Pareto Envelopes in Simple Polygons. - Victor Chepoi; Karim Nouioua; Edouard Thiel; Yann Vaxès (Int. J. Comput. Geom. Appl., 2010)

Local Search for Mixed-Integer Nonlinear Optimization: A Methodology and an Application. - Frédéric Gardi; Karim Nouioua (EvoCOP, 2011)

LocalSolver 1.x: a black-box local-search solver for 0-1 programming. - Thierry Benoist; Bertrand Estellon; Frédéric Gardi; Romain Megel; Karim Nouioua (4OR, 2011)

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)

Bidirected minimum Manhattan network problem. - Nicolas Catusse; Victor Chepoi; Karim Nouioua; Yann Vaxès (Networks, 2017)