04133oam 2200589 450 99646584140331620210714222118.03-540-46784-X10.1007/3-540-46784-X(CKB)1000000000211126(SSID)ssj0000323616(PQKBManifestationID)11250815(PQKBTitleCode)TC0000323616(PQKBWorkID)10301070(PQKB)11197034(DE-He213)978-3-540-46784-7(MiAaPQ)EBC3072447(MiAaPQ)EBC6485965(PPN)15520209X(EXLCZ)99100000000021112620210714d1999 uy 0engurnn|008mamaatxtccrGraph-theoretic concepts in computer science 25th international workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 : proceedings /edited by Peter Widmayer; Gabriele Neyer; Stephan Eidenbenz1st ed. 1999.Berlin, Germany ;New York, New York :Springer,[1999]©19991 online resource (XI, 416 p.) Lecture notes in computer science ;Volume 1665Includes index.3-540-66731-8 Includes bibliographical references at the end of each chapters and index.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 of Recognizing 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.Lecture notes in computer science ;Volume 1665.Graph theoryCongressesComputer scienceCongressesGraph theoryComputer science004.0151Eidenbenz StephanNeyer GabrieleWidmayer PeterMiAaPQMiAaPQUtOrBLWBOOK996465841403316Graph-Theoretic Concepts in Computer Science2569248UNISA