LEADER 05613oam 2200589 450 001 996465626403316 005 20210714081027.0 010 $a3-540-46648-7 024 7 $a10.1007/3-540-46648-7 035 $a(CKB)1000000000211109 035 $a(SSID)ssj0000323595 035 $a(PQKBManifestationID)11259105 035 $a(PQKBTitleCode)TC0000323595 035 $a(PQKBWorkID)10300021 035 $a(PQKB)11005735 035 $a(DE-He213)978-3-540-46648-2 035 $a(MiAaPQ)EBC3071807 035 $a(MiAaPQ)EBC6485655 035 $a(PPN)155197908 035 $a(EXLCZ)991000000000211109 100 $a20210714d1999 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aGraph drawing $e7th international symposium, gd'99, stirin castle, czech republic, september 15-19, 1999 proceedings /$fedited by Jan Kratochvíl 205 $a1st ed. 1999. 210 1$aBerlin, Germany ;$aNew York, New York :$cSpringer,$d[1999] 210 4$d©1999 215 $a1 online resource (XIV, 426 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1731 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-66904-3 320 $aIncludes bibliographical references and index. 327 $aInvited Talk -- The Anatomy of a Geometric Algorithm -- Orthogonality I -- Turn-Regularity and Planar Orthogonal Drawings -- Combining Graph Labeling and Compaction -- Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time -- Fully Dynamic 3-Dimensional Orthogonal Graph Drawing -- Levels I -- An E log E Line Crossing Algorithm for Levelled Graphs -- Level Planar Embedding in Linear Time -- Higres ? Visualization System for Clustered Graphs and Graph Algorithms -- Clusters I -- Partitioning Approach to Visualization of Large Graphs -- Graph Clustering Using Distance-k Cliques -- Drawing I -- A Framework for Circular Drawings of Networks -- Drawing Planar Graphs with Circular Arcs -- Drawing Graphs in the Hyperbolic Plane -- Invited Talk -- Graph Planarity and Related Topics -- Planarity -- Grid Drawings of Four-Connected Plane Graphs -- Graph Embedding with Topological Cycle-Constraints -- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs -- The Constrained Crossing Minimization Problem -- Clusters II -- Planarity-Preserving Clustering and Embedding for Large Planar Graphs -- An Algorithm for Drawing Compound Graphs -- Levels II -- The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation -- Using Sifting for k-Layer Straightline Crossing Minimization -- On 3-Layer Crossings and Pseudo Arrangements -- Applications -- Visualizing Algorithms for the Design and Analysis of Survivable Networks -- LayoutShow: A Signed Applet/Application for Graph Drawing and Experimentation -- Centrality in Policy Network Drawings -- Straight-Line Drawings of Protein Interactions -- Invited Talk -- Art of Drawing -- Symmetry -- An Heuristic for Graph Symmetry Detection -- Isomorphic Subgraphs -- Orthogonality II -- Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size -- Multi-dimensional Orthogonal Graph Drawing with Small Boxes -- Representations -- Geometric Realization of Simplicial Complexes -- Visibility Representations of Complete Graphs -- Triangle-Free Planar Graphs as Segments Intersection Graphs -- Drawing II -- A Force-Directed Algorithm that Preserves Edge Crossing Properties -- Proximity and Trees -- Rectangle of Influence Drawings of Graphs without Filled 3-Cycles -- Voronoi Drawings of Trees -- Infinite Trees and the Future -- Latour ? A Tree Visualisation System -- Graph Drawing Contest -- Graph-Drawing Contest Report -- Hunting Down Graph B -- Posters -- Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations -- Electronic Biochemical Pathways. 330 $aThe range of issues considered in graph drawing includes algorithms, graph theory, geometry, topology, order theory, graphic languages, perception, app- cations, and practical systems. Much research is motivated by applications to systems for viewing and interacting with graphs. The interaction between th- retical advances and implemented solutions is an important part of the graph drawing eld. The annually organized graph drawing symposium is a forum for researchers, practitioners, developers, and users working on all aspects of graph visualization and representations. The preceding symposia were held in M- treal (GD?98), Rome (GD?97), Berkeley (GD?96), Passau (GD?95), Princeton (GD?94), and Paris (GD?93). The Seventh International Symposium on Graph Drawing GD?99 was or- nized at Sti r n Castle, in the vicinity of Prague, Czech Republic. This baroque castle recently restored as a hotel and conference center provided a secluded place for the participants, who made good use of the working atmosphere of the conference. In total the symposium had 83 registered participants from 16 countries. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1731 606 $aGraph theory$vCongresses 606 $aComputer graphics$vCongresses 615 0$aGraph theory 615 0$aComputer graphics 676 $a511.5 702 $aKratochvíl$b Jan 712 12$aGD (Symposium)$d(7th :$f1999 :$eS?tir?i?n Castle, Czech Republic), 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a996465626403316 996 $aGraph Drawing$9773153 997 $aUNISA