LEADER 04760nam 22007815 450 001 9910767534503321 005 20230406043930.0 010 $a3-540-77537-4 024 7 $a10.1007/978-3-540-77537-9 035 $a(CKB)1000000000490614 035 $a(SSID)ssj0000317976 035 $a(PQKBManifestationID)11267545 035 $a(PQKBTitleCode)TC0000317976 035 $a(PQKBWorkID)10307698 035 $a(PQKB)10306188 035 $a(DE-He213)978-3-540-77537-9 035 $a(MiAaPQ)EBC3062150 035 $a(MiAaPQ)EBC6711427 035 $a(Au-PeEL)EBL6711427 035 $a(OCoLC)233973801 035 $a(PPN)123743311 035 $a(EXLCZ)991000000000490614 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph Drawing $e15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007, Revised Papers /$fedited by Seok-Hee Hong, Takao Nishizeki, Wu Quan 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XIII, 401 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4875 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-77536-6 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Computing Symmetries of Combinatorial Objects -- Large-Scale Graphics: Digital Nature and Laser Projection -- Papers -- Crossing Number of Graphs with Rotation Systems -- A Bipartite Strengthening of the Crossing Lemma -- Improvement on the Decay of Crossing Numbers -- Crossing Numbers and Parameterized Complexity -- Characterization of Unlabeled Level Planar Graphs -- Cyclic Level Planarity Testing and Embedding -- Practical Level Planarity Testing and Layout with Embedding Constraints -- Minimum Level Nonplanar Patterns for Trees -- Straight-Line Orthogonal Drawings of Binary and Ternary Trees -- Polynomial Area Bounds for MST Embeddings of Trees -- Moving Vertices to Make Drawings Plane -- Point-Set Embedding of Trees with Edge Constraints -- Representation of Planar Hypergraphs by Contacts of Triangles -- The Complexity of Several Realizability Problems for Abstract Topological Graphs -- Efficient Extraction of Multiple Kuratowski Subdivisions -- Cover Contact Graphs -- Matched Drawings of Planar Graphs -- Maximum Upward Planar Subgraphs of Embedded Planar Digraphs -- Minimizing the Area for Planar Straight-Line Grid Drawings -- On Planar Polyline Drawings -- Constrained Stress Majorization Using Diagonally Scaled Gradient Projection -- Line Crossing Minimization on Metro Maps -- Algorithms for Multi-criteria One-Sided Boundary Labeling -- Multi-circular Layout of Micro/Macro Graphs -- Constrained Simultaneous and Near-Simultaneous Embeddings -- Simultaneous Geometric Graph Embeddings -- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces -- Clustered Planarity: Small Clusters in Eulerian Graphs -- Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge -- Colorability in Orthogonal Graph Drawing -- A Note on Minimum-Area Straight-Line Drawings of Planar Graphs -- Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices -- LunarVis ? Analytic Visualizations of Large Graphs -- Visualizing Internet Evolution on the Autonomous Systems Level -- Treemaps for Directed Acyclic Graphs -- Drawing Graphs with GLEE -- Graph Drawing Contest -- Graph Drawing Contest Report. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4875 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aComputer graphics 606 $aArtificial intelligence?Data processing 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aComputer Graphics 606 $aData Science 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aComputer graphics. 615 0$aArtificial intelligence?Data processing. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aComputer Graphics. 615 24$aData Science. 676 $a511.5 702 $aHong$b Seok-Hee 702 $aNishizeki$b T$g(Takao),$f1947-2022, 702 $aQuan$b Wu 712 12$aSymposium on Graph Drawing 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910767534503321 996 $aGraph Drawing$9773153 997 $aUNINA