Michael U. Gerber

According to our database, Michael U. Gerber authored at least 11 papers between 2000 and 2006.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2006

Augmenting chains in graphs without a skew star.

Michael U. Gerber, Alain Hertz, Vadim V. Lozin

J. Comb. Theory B, 2006

2004

Classes of graphs that can be partitioned to satisfy all their vertices.

Michael U. Gerber, Daniel Kobler

Australas. J Comb., 2004

2003

Algorithms for vertex-partitioning problems on graphs with fixed clique-width.

Michael U. Gerber, Daniel Kobler

Theor. Comput. Sci., 2003

Robust Algorithms for the Stable Set Problem.

Michael U. Gerber, Vadim V. Lozin

Graphs Comb., 2003

On the stable set problem in special P₅-free graphs.

Michael U. Gerber, Vadim V. Lozin

Discret. Appl. Math., 2003

P₅-free augmenting graphs and the maximum stable set problem.

Michael U. Gerber, Alain Hertz, David Schindl

Discret. Appl. Math., 2003

Stable sets in two subclasses of banner-free graphs.

Michael U. Gerber, Alain Hertz, Vadim V. Lozin

Discret. Appl. Math., 2003

2002

Extension of Turán's Theorem to the 2-Stability Number.

Michael U. Gerber, Pierre Hansen, Alain Hertz

Graphs Comb., 2002

2001

A Transformation Which Preserves the Clique Number.

Michael U. Gerber, Alain Hertz

J. Comb. Theory B, 2001

2000

On the Jump Number Problem in Hereditary Classes of Bipartite Graphs.

Vadim V. Lozin, Michael U. Gerber

Order, 2000

Algorithmic approach to the satisfactory graph partitioning problem.

Michael U. Gerber, Daniel Kobler

Eur. J. Oper. Res., 2000