Thursday, June 15

CP11
Graph Algorithms

10:30 am - 12:30 pm
Room: Section C
Chair: Tanya Y. Berger-Wolf, University of Illinois at Urbana-Champaign, USA

10:30 - 10:45 The Width and Length of Graph Products
Tanya Y. Berger-Wolf and Edward M. Reingold, University of Illinois at Urbana-Champaign, USA
10:40 - 11:05 A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
Roded Sharan, and Ron Shamir, Tel-Aviv University, Israel; and Pavol Hell, Simon Fraser University, Canada
11:10 - 11:25 On the Reduction of Yutsis Graphs
Veerle Fack, University of Ghent, Belgium
11:30 - 11:45 Complexity Classification of Some Edge Modification Problems
Roded Sharan, Assaf Natanzon, and Ron Shamir, Tel-Aviv University, Israel
11:50 - 12:05 Cancelled Isomorphism Testing of Some Subclasses of Chordal Graphs
K.Balaji, IBM India Research Laboratory, Indian Institute of Technology, India
12:10 - 12:25 Cancelled On the Quasi-Locally Paw-Free Graphs
Hacéne Ait Haddadene and Myriem Mechebbek, Institut de Mathématiques, USTHB, Alger

©2000 Society for Industrial and Applied Mathematics
Designed by Donaghy's Web Consulting
Created 3/16/00; Updated 6/18/00