 | 2009 |
|---|
| 9 |       | Pierre Hansen,
Martine Labbé,
David Schindl:
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results.
Discrete Optimization 6(2): 135-147 (2009) |
| 8 | | Alain Hertz,
David Schindl,
Nicolas Zufferey:
A solution method for a car fleet management problem with maintenance constraints.
J. Heuristics 15(5): 425-450 (2009) |
| 7 | | Pierre Hansen,
Alain Hertz,
Rim Kilani,
Odile Marcotte,
David Schindl:
Average distance and maximum induced forest.
Journal of Graph Theory 60(1): 31-54 (2009) |
| 2006 |
|---|
| 6 | | T. Bornand-Jaccard,
David Schindl,
Dominique de Werra:
Some simple optimization techniques for self-organized public key management in mobile ad hoc networks.
Discrete Applied Mathematics 154(8): 1223-1235 (2006) |
| 2005 |
|---|
| 5 | | Alain Hertz,
David Schindl,
Nicolas Zufferey:
Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints.
4OR 3(2): 139-161 (2005) |
| 4 | | Marie-Christine Costa,
Dominique de Werra,
Christophe Picouleau,
David Schindl:
A solvable case of image reconstruction in discrete tomography.
Discrete Applied Mathematics 148(3): 240-245 (2005) |
| 3 | | David Schindl:
Some new hereditary classes where graph coloring remains NP-hard.
Discrete Mathematics 295(1-3): 197-202 (2005) |
| 2003 |
|---|
| 2 | | Michael U. Gerber,
Alain Hertz,
David Schindl:
P5-free augmenting graphs and the maximum stable set problem.
Discrete Applied Mathematics 132(1-3): 109-119 (2003) |
| 1 | | Alain Hertz,
Vadim V. Lozin,
David Schindl:
Finding augmenting chains in extensions of claw-free graphs.
Inf. Process. Lett. 86(6): 311-316 (2003) |
