Graph-Theoretic Concepts in Computer Science: 27th InternationalWorkshop, WG 2001 Boltenhagen, Germany, June 14–16, 2001 Proceedings<br />Author: Andreas Brandstädt, Van Bang Le<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-42707-0<br /> DOI: 10.1007/3-540-45477-2<br /><br />Table of Contents:<p></p><ul><li>Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces </li><li>Data Management in Networks </li><li>Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs </li><li>Approximate Constrained Bipartite Edge Coloring </li><li>Maximum Clique Transversals </li><li>On the Tree-Degree of Graphs </li><li>On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms </li><li>(k+) -Disatance- Herediatry Graphs </li><li>On the Relationship between Clique-Width and Treewidth </li><li>Planarity of the 2-Level Cactus Model </li><li>Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach </li><li>How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time </li><li>(g, f)-Factorizations Orthogonal to k Subgraphs </li><li>On Star Coloring of Graphs </li><li>Graph Subcolorings: Complexity and Algorithms </li><li>Approximation of Pathwidth of Outerplanar Graphs </li><li>On the Monotonicity of Games Generated by Symmetric Submodular Functions </li><li>Multiple Hotlink Assignment </li><li>Small k-Dominating Sets in Planar Graphs with Applications </li><li>Lower Bounds for Algorithms for the Steiner Tree Problem</li></ul>