Algorithmic approach to the satisfactory graph partitioning problem. - Michael U. Gerber; Daniel Kobler (Eur. J. Oper. Res., 2000)

On the Jump Number Problem in Hereditary Classes of Bipartite Graphs. - Vadim V. Lozin; Michael U. Gerber (Order, 2000)

A Transformation Which Preserves the Clique Number. - Michael U. Gerber; Alain Hertz (J. Comb. Theory B, 2001)

Extension of Turán's Theorem to the 2-Stability Number. - Michael U. Gerber; Pierre Hansen; Alain Hertz (Graphs Comb., 2002)

Stable sets in two subclasses of banner-free graphs. - Michael U. Gerber; Alain Hertz; Vadim V. Lozin (Discret. Appl. Math., 2003)

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

On the stable set problem in special P5-free graphs. - Michael U. Gerber; Vadim V. Lozin (Discret. Appl. Math., 2003)

Robust Algorithms for the Stable Set Problem. - Michael U. Gerber; Vadim V. Lozin (Graphs Comb., 2003)

Algorithms for vertex-partitioning problems on graphs with fixed clique-width. - Michael U. Gerber; Daniel Kobler (Theor. Comput. Sci., 2003)

Classes of graphs that can be partitioned to satisfy all their vertices. - Michael U. Gerber; Daniel Kobler (Australas. J Comb., 2004)

Augmenting chains in graphs without a skew star. - Michael U. Gerber; Alain Hertz; Vadim V. Lozin (J. Comb. Theory B, 2006)