Michael U. Gerber

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2006
Augmenting chains in graphs without a skew star.
J. Comb. Theory B, 2006

2004
Classes of graphs that can be partitioned to satisfy all their vertices.
Australas. J Comb., 2004

2003
Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
Theor. Comput. Sci., 2003

Robust Algorithms for the Stable Set Problem.
Graphs Comb., 2003

On the stable set problem in special P<sub>5</sub>-free graphs.
Discret. Appl. Math., 2003

P<sub>5</sub>-free augmenting graphs and the maximum stable set problem.
Discret. Appl. Math., 2003

Stable sets in two subclasses of banner-free graphs.
Discret. Appl. Math., 2003

2002
Extension of Turán's Theorem to the 2-Stability Number.
Graphs Comb., 2002

2001
A Transformation Which Preserves the Clique Number.
J. Comb. Theory B, 2001

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

Algorithmic approach to the satisfactory graph partitioning problem.
Eur. J. Oper. Res., 2000


  Loading...