Peter Widmayer / Gabriele Neyer / Stephan Eidenbenz (eds.)

Graph-Theoretic Concepts in Computer Science

25th International Workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 Proceedings
Herausgegeben:Widmayer, Peter; Neyer, Gabriele; Eidenbenz, Stephan

• Broschiertes Buch

Produktbeschreibung

The 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 99) celebrated the anniversaryof the workshop series at the Centro Stefano Franscini on Monte Verit`a, Ascona, Switzerland, from June 17 to 19, 1999. It was organized byETH Z urich, sponsored byETH, the Centro Stefano Franscini, the Swiss National Science Foundation, and Swissphone. The workshop looks back on a remarkable tradition of a quarter century, with predecessors organized at various places in Europe. WG 99 has been an insp- ing mix of questions from theoryand practice, and of 74 young scientists and established researchers from all over the world, including Bangladesh, Belgium, Canada, the Czech Republic, France, Germany, Israel, Italy, Japan, Korea, the Netherlands, Russia, the Slovak Republic, Spain, Sweden, Switzerland, the UK, and the USA. Four invited lectures re?ect the history, theory, practice and this year s s- ting. Hartmut Noltemeier as the onlyone of four founding members of the WG series who served on the program committee throughout the entire historyof WG talked about past achievements and future challenges of WG and of the ?eld. Susanne Albers lectured on the theoryof online algorithms. Thomas Lengauer presented practical packing problems from the textile and car manufacturing industries, as well as their solutions. A workshop held at the Centro Stefano Franscini traditionallyo?ers a talk that is open to the general (Italian speaking) public Nicola Santoro delivered this Stefano Franscini talk byreporting on computer science, school, and community, as seen from the eye of the storm.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 1665
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 10704274, 978-3-540-66731-5
• 1999.
• Seitenzahl: 432
• Erscheinungstermin: 27. Oktober 1999
• Englisch
• Abmessung: 235mm x 155mm x 24mm
• Gewicht: 565g
• ISBN-13: 9783540667315
• ISBN-10: 3540667318
• Artikelnr.: 09258331

Inhaltsangabe

Silver Graphs: Achievements and New Challenges.- Online Algorithms: A Study of Graph-Theoretic Concepts.- Discrete Optimization Methods for Packing Problems in Two and Three Dimensions - With Applications in the Textile and Car Manufacturing Industries.- Informatica, Scuola, Communità: Uno Sguardo dall' Occhio del Ciclone.- Proximity-Preserving Labeling Schemes and Their Applications.- Euler Is Standing in Line.- Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2.- Complexity Classification of Some Edge Modification Problems.- On Minimum Diameter Spanning Trees under Reload Costs.- Induced Matchings in Regular Graphs and Trees.- Mod-2 Independence and Domination in Graphs.- NLC2-Decomposition in Polynomial Time.- On the Nature of Structure and Its Identification.- On the Clique-Width of Perfect Graph Classes.- An Improved Algorithm for Finding Tree Decompositions of Small Width.- Efficient Analy sis of Graphs with Small Minimal Separators.- Generating All the Minimal Separators of a Graph.- Two Broadcasting Problems in FaultyHypercubes.- Routing Permutations in the Hypercube.- An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs.- Optimal Irreversible Dy namos in Chordal Rings.- Recognizing Bipartite Incident-Graphs of Circulant Digraphs.- Optimal Cuts for Powers of the Petersen Graph.- Dihamiltonian Decomposition of Regular Graphs with Degree Three.- Box-Rectangular Drawings of Plane Graphs.- A Multi-Scale Algorithm for Drawing Graphs Nicely.- All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Poly nomial Time.- Linear Orderings of Random Geometric Graphs.- Finding Smallest Supertrees Under Minor Containment.- Vertex Cover: Further Observations and Further Improvements.- On the Hardness ofRecognizing Bundles in Time Table Graphs.- Optimal Solutions for Frequency Assignment Problems via Tree Decomposition.- Fixed-Parameter Complexity of ?-Labelings.- Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs.- On Claw-Free Asteroidal Triple-Free Graphs.- Vertex Partitioning of Crown-Free Interval Graphs.- Triangulated Neighbourhoods in C 4-Free Berge Graphs.