| Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results P Hansen, M Labbé, D Schindl Discrete Optimization 6 (2), 135-147, 2009 | 74 | 2009 |
| Ant local search and its efficient adaptation to graph colouring M Plumettaz, D Schindl, N Zufferey Journal of the Operational Research Society 61 (5), 819-826, 2010 | 52 | 2010 |
| A solution method for a car fleet management problem with maintenance constraints A Hertz, D Schindl, N Zufferey Journal of Heuristics 15, 425-450, 2009 | 43 | 2009 |
| A learning tabu search for a truck allocation problem with linear and nonlinear cost components D Schindl, N Zufferey Naval Research Logistics (NRL) 62 (1), 32-45, 2015 | 31 | 2015 |
| Some new hereditary classes where graph coloring remains NP-hard D Schindl Discrete Mathematics 295 (1-3), 197-202, 2005 | 30 | 2005 |
| Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints A Hertz, D Schindl, N Zufferey 4or 3, 139-161, 2005 | 26 | 2005 |
| A solvable case of image reconstruction in discrete tomography MC Costa, D de Werra, C Picouleau, D Schindl Discrete Applied Mathematics 148 (3), 240-245, 2005 | 23 | 2005 |
| P5-free augmenting graphs and the maximum stable set problem MU Gerber, A Hertz, D Schindl Discrete Applied Mathematics 132 (1-3), 109-119, 2003 | 23 | 2003 |
| Average distance and maximum induced forest P Hansen, A Hertz, R Kilani, O Marcotte, D Schindl Journal of Graph Theory 60 (1), 31-54, 2009 | 16 | 2009 |
| Set covering and packing formulations of graph coloring: algorithms and first polyhedral results P Hansen, M Labbé, D Schindl Groupe d'études et de recherche en analyse des décisions, 2005 | 16 | 2005 |
| Finding augmenting chains in extensions of claw-free graphs A Hertz, V Lozin, D Schindl Information Processing Letters 86 (6), 311-316, 2003 | 16 | 2003 |
| Optimal student sectioning on mandatory courses with various sections numbers D Schindl Annals of operations research 275 (1), 209-221, 2019 | 15 | 2019 |
| Solution methods for fuel supply of trains D Schindl, N Zufferey INFOR: Information Systems and Operational Research 51 (1), 23-30, 2013 | 13 | 2013 |
| Heuristics for a project management problem with incompatibility and assignment costs N Zufferey, O Labarthe, D Schindl Computational Optimization and Applications 51, 1231-1252, 2012 | 9 | 2012 |
| Some combinatorial optimization problems in graphs with applications in telecommunications and tomography D Schindl EPFL, 2004 | 7 | 2004 |
| On Split -EPG Graphs Z Deniz, S Nivelle, B Ries, D Schindl Latin American Symposium on Theoretical Informatics, 361-375, 2018 | 6 | 2018 |
| Student sectioning for minimizing potential conflicts on multi-section courses D Schindl Proceedings of the 11th International Conference of the Practice and Theory …, 2016 | 6 | 2016 |
| Locally checkable problems parameterized by clique-width N Baghirova, CL Gonzalez, B Ries, D Schindl arXiv preprint arXiv:2203.02992, 2022 | 5 | 2022 |
| Graph coloring and linear programming‖ D Schindl, P Hansen Presentation at First Joint Operations Research Days, Ecole Polytechnique …, 2003 | 5 | 2003 |
| A Tabu Search for the Frequency Assignment Problem with Polarization A Hertz, D Schindl, N Zu_erey FRANCORO III, Quebec, Canada, 2001 | 5 | 2001 |
