P5-free augmenting graphs and the maximum stable set problem. - Michael U. Gerber; Alain Hertz; David Schindl (Discret. Appl. Math., 2003)

Finding augmenting chains in extensions of claw-free graphs. - Alain Hertz; Vadim V. Lozin; David Schindl (Inf. Process. Lett., 2003)

Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints. - Alain Hertz; David Schindl; Nicolas Zufferey (4OR, 2005)

A solvable case of image reconstruction in discrete tomography. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; David Schindl (Discret. Appl. Math., 2005)

Some new hereditary classes where graph coloring remains NP-hard. - David Schindl (Discret. Math., 2005)

Some simple optimization techniques for self-organized public key management in mobile ad hoc networks. - T. Bornand-Jaccard; David Schindl; Dominique de Werra (Discret. Appl. Math., 2006)

Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results. - Pierre Hansen; Martine Labbé; David Schindl (Discret. Optim., 2009)

A solution method for a car fleet management problem with maintenance constraints. - Alain Hertz; David Schindl; Nicolas Zufferey (J. Heuristics, 2009)

Average distance and maximum induced forest. - Pierre Hansen; Alain Hertz; Rim Kilani; Odile Marcotte; David Schindl (J. Graph Theory, 2009)

Ant Local Search and its efficient adaptation to graph colouring. - Matthieu Plumettaz; David Schindl; Nicolas Zufferey (J. Oper. Res. Soc., 2010)

Heuristics for a project management problem with incompatibility and assignment costs. - Nicolas Zufferey; Olivier Labarthe; David Schindl (Comput. Optim. Appl., 2012)

Course Opening, Assignment and Timetabling with Student Preferences. - Sacha Varone; David Schindl (ICORES, 2013)

Solution Methods for Fuel Supply of Trains. - David Schindl; Nicolas Zufferey (INFOR Inf. Syst. Oper. Res., 2013)

Learning Tabu Search for Combinatorial Optimization. - Nicolas Zufferey; David Schindl (ICORES (Selected Papers), 2014)

On Split B_1 B 1 -EPG Graphs. - Zakir Deniz; Simon Nivelle; Bernard Ries; David Schindl (LATIN, 2018)

Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014. - Claudia Archetti; Luca Bertazzi; Martin Milanic; David Schindl; Sacha Varone (Discret. Appl. Math., 2018)

Optimal student sectioning on mandatory courses with various sections numbers. - David Schindl (Ann. Oper. Res., 2019)

On Some Subclasses of Split B1-EPG Graphs. - Zakir Deniz; Simon Nivelle; Bernard Ries; David Schindl (LATIN, 2020)

Flexible job shop scheduling problem with sequence-dependent transportation constraints and setup times. - Sacha Varone; David Schindl; Corentin Beffa (FedCSIS (Position Papers), 2021)

Locally Checkable Problems Parameterized by Clique-Width. - Narmina Baghirova; Carolina Lucía Gonzalez; Bernard Ries; David Schindl (ISAAC, 2022)

Locally checkable problems in bounded clique-width graphs. - Narmina Baghirova; Carolina Lucía Gonzalez; David Schindl (CoRR, 2022)

A Benders Decomposition Approach for a Capacitated Multi-vehicle Covering Tour Problem with Intermediate Facilities. - Vera Fischer; Antoine Legrain; David Schindl (CPAIOR (1), 2024)

Extremal Chemical Graphs for the Arithmetic-Geometric Index. - Alain Hertz; Sébastien Bonte; Gauvain Devillez; Valentin Dusollier; Hadrien Mélot; David Schindl (CoRR, 2024)

Finding k-community structures in special graph classes. - Narmina Baghirova; Clément Dallard; Bernard Ries; David Schindl (Discret. Appl. Math., 2024)

Complete polyhedral description of chemical graphs of maximum degree at most 3. - Valentin Dusollier; Sébastien Bonte; Gauvain Devillez; Alain Hertz; Hadrien Mélot; David Schindl (CoRR, 2025)