LEADER 06341nam 22006735 450 001 9910357841003321 005 20230330085731.0 010 $a3-030-35802-X 024 7 $a10.1007/978-3-030-35802-0 035 $a(CKB)4100000009939731 035 $a(MiAaPQ)EBC5986849 035 $a(DE-He213)978-3-030-35802-0 035 $a(PPN)257357939 035 $a(EXLCZ)994100000009939731 100 $a20191127d2019 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aGraph Drawing and Network Visualization $e27th International Symposium, GD 2019, Prague, Czech Republic, September 17?20, 2019, Proceedings /$fedited by Daniel Archambault, Csaba D. Tóth 205 $a1st ed. 2019. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2019. 215 $a1 online resource (xxiii, 626 pages) $cillustrations 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11904 311 $a3-030-35801-1 327 $aCartograms and Intersection Graphs -- Stick Graphs with Length Constraints -- Representing Graphs and Hypergraphs by Touching Polygons in 3D -- Optimal Morphs of Planar Orthogonal Drawings II -- Computing Stable Demers Cartograms -- Geometric Graph Theory -- Bundled Crossings Revisited -- Crossing Numbers of Beyond-Planar Graphs -- On the 2-Colored Crossing Number -- Minimal Representations of Order Types by Geometric Graphs -- Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators -- Clustering -- A Quality Metric for Visualization of Clusters in Graphs -- Multi-level Graph Drawing using Infomap Clustering -- On Strict (Outer-)Con?uent Graphs -- Quality Metrics -- On the Edge-Length Ratio of Planar Graphs -- Node Overlap Removal Algorithms: A Comparative Study -- Graphs with large total angular resolution -- Arrangements -- Computing Height-Optimal Tangles Faster -- On Arrangements of Orthogonal Circles -- Extending Simple Drawings -- Coloring Hasse diagrams and disjointness graphs of curves -- A Low Number of Crossings -- E?cient Generation of Di?erent Topological Representations of Graphs Beyond-Planarity -- The QuaSEFE Problem -- ChordLink: A New Hybrid Visualization Model -- Stress-Plus-X (SPX) Graph Layout -- Best Paper in Track 1 -- Exact Crossing Number Parameterized by Vertex Cover -- Morphing and Planarity -- Maximizing Ink in Partial Edge Drawings of k-Plane Graphs -- Graph Drawing with Morphing Partial Edges -- A Note on Universal Point Sets for Planar Graphs -- Parameterized Complexity -- Parameterized Algorithms for Book Embedding Problems -- Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs -- Collinearities -- 4-Connected Triangulations on Few Lines -- Line and Plane Cover Numbers Revisited -- Drawing planar graphs with few segments on a polynomial grid -- Variants of the Segment Number of a Graph -- Topological Graph Theory -- Local and Union Page Numbers -- Mixed Linear Layouts: Complexity, Heuristics, and Experiments -- Homotopy height, grid-major height and graph-drawing height -- On the Edge-Vertex Ratio of Maximal Thrackles -- Best Paper in Track 2 -- Symmetry Detection and Classi?cation in Drawings of Graphs -- Level Planarity -- An SPQR-Tree-Like Embedding Representation for Upward Planarity -- A Natural Quadratic Approach to the Generalized Graph Layering Problem -- Graph Stories in Small Area -- Level-Planar Drawings with Few Slopes -- Graph Drawing Contest Report -- Graph Drawing Contest Report -- Poster Abstracts -- A 1-planarity Testing and Embedding Algorithm -- Stretching Two Pseudolines in Planar Straight-Line Drawings -- Adventures in Abstraction: Reachability in Hierarchical Drawings -- On Topological Book Embedding for k-Plane Graphs -- On Compact RAC Drawings -- FPQ-choosable Planarity Testing -- Packing Trees into 1-Planar Graphs -- Geographic Network Visualization Techniques: A Work-In-Progress Taxonomy -- On the Simple Quasi Crossing Number of K 11 -- Minimising Crossings in a Tree-Based Network -- Crossing Families and Their Generalizations -- Which Sets of Strings are Pseudospherical?. 330 $aThis book constitutes the refereed proceedings of the 27th International Symposium on Graph Drawing and Network Visualization, GD 2019, held in Prague, Czech Republic, in September 2019. The 42 papers and 12 posters presented in this volume were carefully reviewed and selected from 113 submissions. They were organized into the following topical sections: Cartograms and Intersection Graphs, Geometric Graph Theory, Clustering, Quality Metrics, Arrangements, A Low Number of Crossings, Best Paper in Track 1, Morphing and Planarity, Parameterized Complexity, Collinearities, Topological Graph Theory, Best Paper in Track 2, Level Planarity, Graph Drawing Contest Report, and Poster Abstracts. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11904 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aData structures (Computer science) 606 $aInformation theory 606 $aImage processing?Digital techniques 606 $aComputer vision 606 $aAlgorithms 606 $aMathematics of Computing 606 $aData Structures and Information Theory 606 $aComputer Imaging, Vision, Pattern Recognition and Graphics 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aImage processing?Digital techniques. 615 0$aComputer vision. 615 14$aAlgorithms. 615 24$aMathematics of Computing. 615 24$aData Structures and Information Theory. 615 24$aComputer Imaging, Vision, Pattern Recognition and Graphics. 676 $a511.5 702 $aArchambault$b Daniel$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aTóth$b Csaba D$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910357841003321 996 $aGraph Drawing and Network Visualization$93872884 997 $aUNINA