CP2
Graph Theory: Algorithms and Computer Science I

10:00 Efficient Planarity Testing via Embedding

Christoph Hundack, Max-Planck-Institut fur Informatik, Germany; and Hermann Stamm-Wilbrandt, Wissenschaftliches Zentrum der IBM Heidelberg, Germany

10:20 On Marked Graphs

Shaoji Xu, Rutgers University

10:40 Improved Approximation Algorithms for Weighted Triconnectivity Augmentation Problems

Zeev Nutov and Michal Penn, Technion-Israel Institute of Technology, Israel

11:00 Approximation Algorithms for the P-Cluster Problem

Nili Guttmann and Refael Hassing, Tel Aviv University, Israel

11:20 A Genetic Algorithm for Finding Minimum Number of Independent Sets in a Graph

Don Cooley and Li Chen, Utah State University

11:40 Helicopter Search Problems, Split Bandwidth and Pathwidth

Fedor V. Fomin, St. Petersburg State University, Russia

Registration | Hotel Information | Dormitory Information | Transportation | Speaker Index