Sunday, January 9

Session 1B

9:00 AM-10:40 AM
Room: Oregon/Nevada

9:00 Coloring Non-uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma
Artur Czumaj and Christian Scheideler, Paderborn University, Germany
9:25 On the Complexity of Bicoloring Clique Hypergraphs of Graphs
J. Kratochvil, Charles University, Czech Republic; and Zs. Tuza, Hungarian Academy of Sciences, Hungary
9:50 Weakly Chordal Graph Algorithms via Handles
Ryan Hayward, University of Alberta, Canada; Jeremy Spinrad, Vanderbilt University; and R. Sritharan, Indiana State University
10:15 Recognizing Dart-Free Perfect Graphs
V. Chvátal, Rutgers University; J. Fonlupt, Université Pierre et Marie Curie, France; L. Sun and A. Zemirline, Université de Bretagne Occidentale, France

© 1999, Society for Industrial and Applied Mathematics
Designed by Donaghy's Web Consulting
Created 11/7/99; Last Updated 11/7/99