Graph-Theoretic Concepts in Computer Science: 26th International Workshop, WG 2000 Konstanz, Germany, June 15–17, 2000 Proceedings<br />Author: Ulrik Brandes, Dorothea Wagner<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-41183-3<br /> DOI: 10.1007/3-540-40064-8<br /><br />Table of Contents:<p></p><ul><li>On the Expected Runtime and the Success Probability of Evolutionary Algorithms (Invited Presentation) </li><li>n Points and One Line: Analysis of Randomized Games (Abstract of Invited Lecture) </li><li>Approximating Call-Scheduling Makespan in All-Optical Networks </li><li>New Spectral Lower Bounds on the Bisection Width of Graphs </li><li>Traversing Directed Eulerian Mazes (Extended Abstract) </li><li>On the Space and Access Complexity of Computation DAGs </li><li>Approximating the Treewidth of AT-Free Graphs </li><li>Split-Perfect Graphs: Characterizations and Algorithmic Use </li><li>Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs </li><li>Networks with Small Stretch Number (Extended Abstract) </li><li>Efficient Dispersion Algorithms for Geometric Intersection Graphs </li><li>Optimizing Cost Flows by Modifying Arc Costs and Capacities </li><li>Update Networks and Their Routing Strategies </li><li>Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults </li><li>Diameter of the Knödel Graph </li><li>On the Domination Search Number </li><li>Efficient Communication in Unknown Networks </li><li>Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract) </li><li>The Tree-Width of Clique-Width Bounded Graphs without Kn,n </li><li>Tree Spanners for Subgraphs and Related Tree Covering Problems</li></ul>