Session 18 Graphs II

9:00 AM-10:40 AM
Room: Mencken
Chair: Edward Scheinerman, Johns Hopkins University

9:00-9:17 Approximating Multiroot 3-Outconnected Subgraphs

Zeev Nutov, Max-Planck-Institut für Informatik, Saarbrücken, Germany
9:20-9:37 Using Homogenous Weights for Approximating the Partial Cover Problem: Reuven Bar-Yehuda, Technion-Israel Institute of Technology, Haifa, Israel
9:40-9:57 Computational Complexity of Compaction to Cycles: Narayan Vikas, Simon Fraser University, Burnaby, Canada
10:00-10:17 Some Graphic Uses of an Even Number of Odd Nodes: Kathie Cameron, Wilfrid Laurier University, Waterloo, Canada; and Jack Edmonds, University of Waterloo, Canada
10:20-10:37 LBFS Orderings and Cocomparability Graphs: Derek G. Corneil, University of Toronto, Canada; Stephan Olariu, Old Dominion University; and Lorna Stewart, University of Alberta, Edmonton, Canada

TJF, 9/12/98, MMD, 10/15/98