Refine my results

On Split B1-EPG Graphs

Deniz, Zakir ; Nivelle, Simon ; Ries, Bernard ; Schindl, David

In: Lecture Notes in Computer Science, 2018, vol. 10807, p. 361-375

We consider the following problem: can a certain graph parameter of some given graph G be reduced by at least d, for some integer d, via at most k graph operations from some specified set S, for some given integer k? As graph parameters we take the chromatic number and the clique number. We let the set S consist of either an edge contraction or a vertex deletion. As all these problems are...

A solution method for a car fleet management problem with maintenance constraints

Hertz, Alain ; Schindl, David ; Zufferey, Nicolas

In: Journal of Heuristics, 2009, vol. 15, no. 5, p. 425-450

Heuristics for a project management problem withincompatibility and assignment costs

Zufferey, Nicolas ; Labarthe, Olivier ; Schindl, David

In: Computational Optimization and Applications, 2012, vol. 51, no. 3, p. 1231-1252