LEADER 04135oam 2200589 450 001 9910143649703321 005 20210714222118.0 010 $a3-540-46784-X 024 7 $a10.1007/3-540-46784-X 035 $a(CKB)1000000000211126 035 $a(SSID)ssj0000323616 035 $a(PQKBManifestationID)11250815 035 $a(PQKBTitleCode)TC0000323616 035 $a(PQKBWorkID)10301070 035 $a(PQKB)11197034 035 $a(DE-He213)978-3-540-46784-7 035 $a(MiAaPQ)EBC3072447 035 $a(MiAaPQ)EBC6485965 035 $a(PPN)15520209X 035 $a(EXLCZ)991000000000211126 100 $a20210714d1999 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aGraph-theoretic concepts in computer science $e25th international workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 : proceedings /$fedited by Peter Widmayer; Gabriele Neyer; Stephan Eidenbenz 205 $a1st ed. 1999. 210 1$aBerlin, Germany ;$aNew York, New York :$cSpringer,$d[1999] 210 4$d©1999 215 $a1 online resource (XI, 416 p.) 225 1 $aLecture notes in computer science ;$vVolume 1665 300 $aIncludes index. 311 $a3-540-66731-8 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aSilver 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. 410 0$aLecture notes in computer science ;$vVolume 1665. 606 $aGraph theory$vCongresses 606 $aComputer science$vCongresses 615 0$aGraph theory 615 0$aComputer science 676 $a004.0151 702 $aEidenbenz$b Stephan 702 $aNeyer$b Gabriele 702 $aWidmayer$b Peter 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a9910143649703321 996 $aGraph-Theoretic Concepts in Computer Science$92569248 997 $aUNINA