Michael U. Gerber

11 papers Journal 11
YearRankTypeTitle / Venue / Authors
2006 J jnl
Augmenting chains in graphs without a skew star.
J. Comb. Theory B
Michael U. Gerber, Alain Hertz, Vadim V. Lozin
2004 J jnl
Classes of graphs that can be partitioned to satisfy all their vertices.
Australas. J Comb.
Michael U. Gerber, Daniel Kobler
2003 J jnl
Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
Theor. Comput. Sci.
Michael U. Gerber, Daniel Kobler
2003 J jnl
On the stable set problem in special P
Discret. Appl. Math.
Michael U. Gerber, Vadim V. Lozin
2003 J jnl
P
Discret. Appl. Math.
Michael U. Gerber, Alain Hertz, David Schindl
2003 J jnl
Robust Algorithms for the Stable Set Problem.
Graphs Comb.
Michael U. Gerber, Vadim V. Lozin
2003 J jnl
Stable sets in two subclasses of banner-free graphs.
Discret. Appl. Math.
Michael U. Gerber, Alain Hertz, Vadim V. Lozin
2002 J jnl
Extension of Turán's Theorem to the 2-Stability Number.
Graphs Comb.
Michael U. Gerber, Pierre Hansen, Alain Hertz
2001 J jnl
A Transformation Which Preserves the Clique Number.
J. Comb. Theory B
Michael U. Gerber, Alain Hertz
2000 J jnl
Algorithmic approach to the satisfactory graph partitioning problem.
Eur. J. Oper. Res.
Michael U. Gerber, Daniel Kobler
2000 J jnl
On the Jump Number Problem in Hereditary Classes of Bipartite Graphs.
Order
Vadim V. Lozin, Michael U. Gerber