Maximal Sets of Solutions for Constraint Satisfaction Problems. - David Lesaint (ECAI, 1994)

Dynamic Workforce Scheduling for British Telecommunications plc. - David Lesaint; Christos Voudouris; Nader Azarmi (Interfaces, 2000)

iOpt: A Software Toolkit for Heuristic Search Methods. - Christos Voudouris; Raphaël Dorne; David Lesaint; Anne Liret (CP, 2001)

Inferring Constraint Types in Constraint Programming. - David Lesaint (CP, 2002)

Aspects for Synthesizing Applications by Refinement. - David Lesaint; George Papamargaritis (ICSR, 2004)

Aspects and Constraints for Implementing Configurable Product-Line Architectures. - David Lesaint; George Papamargaritis (WICSA, 2004)

Personalisation of Telecommunications Services as Combinatorial Optimisation. - David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (AAAI, 2008)

Solving a Telecommunications Feature Subscription Configuration Problem. - David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (CP, 2008)

A BDD Approach to the Feature Subscription Problem. - Tarik Hadzic; David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (ECAI, 2008)

Consistency Techniques for Finding an Optimal Relaxation of a Feature Subscription. - David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (ICTAI (1), 2008)

A Soft Global Precedence Constraint. - David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (IJCAI, 2009)

Context-Sensitive Call Control Using Constraints and Rules. - David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (CP, 2010)

Improving the Global Constraint SoftPrec. - David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (ECAI, 2010)

Developing Approaches for Solving a Telecommunications Feature Subscription Problem. - David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Luis Quesada 001; Nic Wilson (J. Artif. Intell. Res., 2010)

A bottom-up implementation of Path-Relinking for Phylogenetic reconstruction applied to Maximum Parsimony. - Karla Esmeralda Vazquez Ortiz; Jean-Michel Richer; David Lesaint; Eduardo Rodriguez-Tello (MCDM, 2014)

A Decomposition Approach for Discovering Discriminative Motifs in a Sequence Database. - David Lesaint; Deepak Mehta 001; Barry O'Sullivan; Vincent Vigneron (ECAI, 2014)

Strategies for Phylogenetic Reconstruction - For the Maximum Parsimony Problem. - Karla Esmeralda Vazquez Ortiz; Jean-Michel Richer; David Lesaint (BIOINFORMATICS, 2016)

Model and Combinatorial Optimization Methods for Tactical Planning in Closed-Loop Supply Chains. - Pierre Desport; Frédéric Lardeux; David Lesaint; Anne Liret; Carla Di Cairano-Gilfedder; Gilbert Owusu (ICTAI, 2016)

Iterated multilevel simulated annealing for large-scale graph conductance minimization. - Zhi Lu; Jin-Kao Hao; Una Benlic; David Lesaint (Inf. Sci., 2021)

New Bounds and Constraint Programming Models for the Weighted Vertex Coloring Problem. - Olivier Goudet; Cyril Grelier; David Lesaint (IJCAI, 2023)

Caractérisation algébrique du calcul d'influence dans les cartes cognitives. - Martin Fleurant; David Genest; David Lesaint; Stéphane Loiseau; Thomas Raimbault (EGC, 2025)