Michael U. Gerber - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2006

Augmenting chains in graphs without a skew starMichael U. Gerber, Alain Hertz, Vadim V. Lozin. JCT, 96(3):352-366, 2006. [doi]

2004

Classes of graphs that can be partitioned to satisfy all their verticesMichael U. Gerber, Daniel Kobler. ajc, 29:201-214, 2004. [doi]

2003

Algorithms for vertex-partitioning problems on graphs with fixed clique-widthMichael U. Gerber, Daniel Kobler. TCS, 1-3(299):719-734, 2003. [doi]

Robust Algorithms for the Stable Set ProblemMichael U. Gerber, Vadim V. Lozin. gc, 19(3):347-356, 2003. [doi]

On the stable set problem in special P::5::-free graphsMichael U. Gerber, Vadim V. Lozin. DAM, 125(2-3):215-224, 2003.

P::5::-free augmenting graphs and the maximum stable set problemMichael U. Gerber, Alain Hertz, David Schindl. DAM, 132(1-3):109-119, 2003. [doi]

Stable sets in two subclasses of banner-free graphsMichael U. Gerber, Alain Hertz, Vadim V. Lozin. DAM, 132(1-3):121-136, 2003. [doi]

2002

Extension of Turán s Theorem to the 2-Stability NumberMichael U. Gerber, Pierre Hansen, Alain Hertz. gc, 18(3):479-489, 2002. [doi]

2001

A Transformation Which Preserves the Clique NumberMichael U. Gerber, Alain Hertz. JCT, 83(2):320-330, 2001. [doi]

2000

Algorithmic approach to the satisfactory graph partitioning problemMichael U. Gerber, Daniel Kobler. eor, 125(2):283-291, 2000. [doi]

On the Jump Number Problem in Hereditary Classes of Bipartite GraphsVadim V. Lozin, Michael U. Gerber. order, 17(4):377-385, 2000. [doi]

Sign in or sign up to see more results.

runs on WebDSL