LEADER 05842nam 22007095 450 001 9910349386503321 005 20230221034541.0 010 $a3-030-04414-9 024 7 $a10.1007/978-3-030-04414-5 035 $a(CKB)4100000007223560 035 $a(DE-He213)978-3-030-04414-5 035 $a(MiAaPQ)EBC6306943 035 $a(PPN)232963681 035 $a(EXLCZ)994100000007223560 100 $a20181217d2018 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aGraph Drawing and Network Visualization $e26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings /$fedited by Therese Biedl, Andreas Kerren 205 $a1st ed. 2018. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018. 215 $a1 online resource (XVIII, 666 p. 427 illus., 198 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11282 311 $a3-030-04413-0 327 $aInvited Talk -- Image-Based Graph Visualization: Advances and Challenges -- Planarity Variants -- Clustered Planarity = Flat Clustered Planarity -- Level Planarity: Transitivity vs. Even Crossings -- Short Plane Supports for Spatial Hypergraphs -- Turning Cliques into Paths to Achieve Planarity -- Upward Drawings -- Universal Slope Sets for Upward Planar Drawings -- Upward Planar Morphs -- Visualizing the Template of a Chaotic Attractor -- RAC drawings -- On RAC Drawings of Graphs with one Bend per Edge -- Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends -- Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles -- Best paper Track 2 -- Aesthetic Discrimination of Graph Layouts -- Orders -- A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width -- The Queue-Number of Posets of Bounded Width or Height -- Queue Layouts of Planar 3-Trees -- Crossings -- Crossing Minimization in Perturbed Drawings -- The Number of Crossings in Multigraphs with No Empty Lens -- Crossing Numbers and Stress of Random Graphs -- Crossing angles -- A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution -- A Greedy Heuristic for Crossing-Angle Maximization -- Contact representations -- Recognition and Drawing of Stick Graphs -- On Contact Graphs of Paths on a Grid -- Specialized graphs and trees -- On the Area-Universality of Triangulations -- Monotone Drawings of k-Inner Planar Graphs -- On L-shaped Point Set Embeddings of Trees: First Non-embeddable Examples -- How to Fit a Tree in a Box -- Best paper Track 1 -- Pole Dancing: 3D Morphs for Tree Drawings -- Partially fixed drawings -- The Complexity of Drawing a Graph in a Polygonal Region -- Inserting an Edge into a Geometric Embedding -- ?-Stars or On Extending a Drawing of a Connected Subgraph -- Experiments -- Perception of Symmetries in Drawings of Graphs -- Network Alignment by Discrete Ollivier-Ricci Flow -- Same Stats, Different Graphs (Graph Statistics and Why We Need Graph Drawings) -- Orthogonal drawings -- Bend-minimum Orthogonal Drawings in Quadratic Time -- Greedy Rectilinear Drawings -- Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity -- Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs -- Realizability -- Realization and Connectivity of the Graphs of Origami Flat Foldings -- Arrangements of Pseudocircles: On Circularizability -- The Weighted Barycenter Drawing Recognition Problem -- Miscellaneous -- Algorithms and Bounds for Drawing Directed Graphs -- Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity -- Graph Drawing Contest Report. . 330 $aThis book constitutes the refereed proceedings of the 26th International Symposium on Graph Drawing and Network Visualization, GD 2018, held in Barcelona, Spain, in September 2018. The 41 full papers presented in this volume were carefully reviewed and selected from 85 submissions. They were organized in topical sections named: planarity variants; upward drawings; RAC drawings; orders; crossings; crossing angles; contact representations; specialized graphs and trees; partially fixed drawings, experiments; orthogonal drawings; realizability; and miscellaneous. The book also contains one invited talk in full paper length and the Graph Drawing contest report. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11282 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence?Data processing 606 $aComputer graphics 606 $aArtificial intelligence 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 606 $aComputer Graphics 606 $aArtificial Intelligence 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer graphics. 615 0$aArtificial intelligence. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 615 24$aComputer Graphics. 615 24$aArtificial Intelligence. 676 $a005.1 676 $a005.1 702 $aBiedl$b Therese$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKerren$b Andreas$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910349386503321 996 $aGraph Drawing and Network Visualization$93872884 997 $aUNINA