05339nam 22008295 450 991076753450332120251226195449.03-540-77537-410.1007/978-3-540-77537-9(CKB)1000000000490614(SSID)ssj0000317976(PQKBManifestationID)11267545(PQKBTitleCode)TC0000317976(PQKBWorkID)10307698(PQKB)10306188(DE-He213)978-3-540-77537-9(MiAaPQ)EBC3062150(MiAaPQ)EBC6711427(Au-PeEL)EBL6711427(OCoLC)233973801(PPN)123743311(MiAaPQ)EBC337138(BIP)37161046(BIP)17712492(EXLCZ)99100000000049061420100301d2008 u| 0engurnn#008mamaatxtccrGraph Drawing 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007, Revised Papers /edited by Seok-Hee Hong, Takao Nishizeki, Wu Quan1st ed. 2008.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2008.1 online resource (XIII, 401 p.)Theoretical Computer Science and General Issues,2512-2029 ;4875Bibliographic Level Mode of Issuance: Monograph3-540-77536-6 Includes bibliographical references and index.Invited 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.This comprehensive new Springer publication constitutes the thoroughly refereed post-conference proceedings of the 15th International Symposium on Graph Drawing, GD 2007, held in Sydney, Australia, in September of 2007. The 27 full papers and 9 short papers presented together with 2 invited talks, and a report on the symposium's graph drawing contest were carefully selected from 74 initial submissions. All of the current hot topics in graph drawing are addressed here.Theoretical Computer Science and General Issues,2512-2029 ;4875Computer scienceMathematicsDiscrete mathematicsAlgorithmsComputer graphicsArtificial intelligenceData processingDiscrete Mathematics in Computer ScienceAlgorithmsComputer GraphicsData ScienceComputer scienceMathematics.Discrete mathematics.Algorithms.Computer graphics.Artificial intelligenceData processing.Discrete Mathematics in Computer Science.Algorithms.Computer Graphics.Data Science.511.5Hong Seok-HeeNishizeki T(Takao),1947-2022,Quan WuSymposium on Graph DrawingMiAaPQMiAaPQMiAaPQBOOK9910767534503321Graph Drawing773153UNINA