2006 |
9 | EE | Michael U. Gerber,
Alain Hertz,
Vadim V. Lozin:
Augmenting chains in graphs without a skew star.
J. Comb. Theory, Ser. B 96(3): 352-366 (2006) |
2003 |
8 | | Michael U. Gerber,
Vadim V. Lozin:
On the stable set problem in special P5-free graphs.
Discrete Applied Mathematics 125(2-3): 215-224 (2003) |
7 | EE | 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) |
6 | EE | Michael U. Gerber,
Alain Hertz,
Vadim V. Lozin:
Stable sets in two subclasses of banner-free graphs.
Discrete Applied Mathematics 132(1-3): 121-136 (2003) |
5 | EE | Michael U. Gerber,
Vadim V. Lozin:
Robust Algorithms for the Stable Set Problem.
Graphs and Combinatorics 19(3): 347-356 (2003) |
4 | EE | Michael U. Gerber,
Daniel Kobler:
Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
Theor. Comput. Sci. 1-3(299): 719-734 (2003) |
2002 |
3 | EE | Michael U. Gerber,
Pierre Hansen,
Alain Hertz:
Extension of Turán's Theorem to the 2-Stability Number.
Graphs and Combinatorics 18(3): 479-489 (2002) |
2001 |
2 | EE | Michael U. Gerber,
Alain Hertz:
A Transformation Which Preserves the Clique Number.
J. Comb. Theory, Ser. B 83(2): 320-330 (2001) |
2000 |
1 | EE | Vadim V. Lozin,
Michael U. Gerber:
On the Jump Number Problem in Hereditary Classes of Bipartite Graphs.
Order 17(4): 377-385 (2000) |