LEADER 05400nam 22007455 450 001 996466237103316 005 20200704203440.0 010 $a3-540-68048-9 024 7 $a10.1007/3-540-62495-3 035 $a(CKB)1000000000234588 035 $a(SSID)ssj0000323592 035 $a(PQKBManifestationID)11242997 035 $a(PQKBTitleCode)TC0000323592 035 $a(PQKBWorkID)10303318 035 $a(PQKB)10780834 035 $a(DE-He213)978-3-540-68048-2 035 $a(PPN)155195905 035 $a(EXLCZ)991000000000234588 100 $a20121227d1997 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph Drawing$b[electronic resource] $eSymposium on Graph Drawing GD'96, Berkeley, California, USA, September 18 - 20, 1996, Proceedings /$fedited by Stephen North 205 $a1st ed. 1997. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1997. 215 $a1 online resource (XIII, 415 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1190 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-62495-3 327 $aBipartite embeddings of trees in the plane -- Series-parallel planar ordered sets have pagenumber two -- On rectangle visibility graphs -- A graph drawing and translation service on the WWW -- Drawing 2-, 3- and 4-colorable graphs in O(n2) volume -- Optimizing area and aspect ratio in straight-line orthogonal tree drawings -- Drawing directed acyclic graphs: An experimental study -- Circular layout in the Graph Layout toolkit -- Multilevel visualization of clustered graphs -- Straight-line drawing algorithms for hierarchical graphs and clustered graphs -- Graph-Drawing contest report -- Two algorithms for three dimensional orthogonal graph drawing -- 2-Visibility drawings of planar graphs -- Upper bounds on the number of hidden nodes in Sugiyama's algorithm -- Integration of declarative approaches (System Demonstration) -- GIOTTO3D: A system for visualizing hierarchical structures in 3D -- A new minimum cost flow algorithm with applications to graph drawing -- Constrained graph layout -- The graphlet system (system demonstration) -- On the Edge Label Placement problem -- Intersection graphs of noncrossing arc-connected sets in the plane -- Wiring edge-disjoint layouts -- Proximity drawings of outerplanar graphs (extended abstract) -- Automatic visualization of two-dimensional cellular complexes -- An alternative method to crossing minimization on hierarchical graphs -- A linear-time algorithm for four-partitioning four-connected planar graphs -- Graphs drawn with few crossings per edge -- A pairing technique for area-efficient orthogonal drawings (extended abstract) -- Experimental and theoretical results in interactive orthogonal graph drawing -- An interactive system for drawing graphs -- Automatic graph clustering (system demonstration) -- Qualitative visualization of processes: Attributed graph layout and focusing techniques. 330 $aThis book constitutes the strictly refereed post-conference proceedings of the International Symposium on Graph Drawing, GD'96, held in Berkeley, California, in September 1996. The 24 revised full papers and the 8 systems demonstrations presented in the book were carefully selected from a total of 50 papers and 24 demos submitted. Also included is a summary of the annual graph drawing competition. Among the topics covered are planarity, upward and orthogonal drawing, heuristics, experimental results, and graph drawing systems. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1190 606 $aComputer science?Mathematics 606 $aComputer-aided engineering 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aComputer graphics 606 $aCombinatorics 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aComputer-Aided Engineering (CAD, CAE) and Design$3https://scigraph.springernature.com/ontologies/product-market-codes/I23044 606 $aDiscrete Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29000 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aComputer science?Mathematics. 615 0$aComputer-aided engineering. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aComputer graphics. 615 0$aCombinatorics. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aComputer-Aided Engineering (CAD, CAE) and Design. 615 24$aDiscrete Mathematics. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputer Graphics. 615 24$aCombinatorics. 676 $a511/.5 702 $aNorth$b Stephen$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aSymposium on Graph Drawing 906 $aBOOK 912 $a996466237103316 996 $aGraph Drawing$9773153 997 $aUNISA LEADER 06555nam 22007095 450 001 996210508003316 005 20230329235512.0 010 $a3-662-45803-9 024 7 $a10.1007/978-3-662-45803-7 035 $a(CKB)3710000000306324 035 $a(SSID)ssj0001386512 035 $a(PQKBManifestationID)11799002 035 $a(PQKBTitleCode)TC0001386512 035 $a(PQKBWorkID)11351365 035 $a(PQKB)10290317 035 $a(DE-He213)978-3-662-45803-7 035 $a(MiAaPQ)EBC6298960 035 $a(MiAaPQ)EBC5585249 035 $a(Au-PeEL)EBL5585249 035 $a(OCoLC)897803429 035 $a(PPN)183094948 035 $a(EXLCZ)993710000000306324 100 $a20141126d2014 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph Drawing$b[electronic resource] $e22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014, Revised Selected Papers /$fedited by Christian Duncan, Antonios Symvonis 205 $a1st ed. 2014. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2014. 215 $a1 online resource (XX, 530 p. 218 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8871 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-662-45802-0 327 $aPlanar Subgraphs -- Planar Induced Subgraphs of Sparse Graphs -- Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph -- Drawing Partially Embedded and Simultaneously Planar Graphs -- Simultaneous Embeddings -- Drawing Simultaneously Embedded Graphs with Few Bends -- Planar and Quasi Planar Simultaneous Geometric Embedding -- Simultaneous Embeddability of Two Partitions -- Applications -- Luatodonotes: Boundary Labeling for Annotations in Texts -- A Coloring Algorithm for Disambiguating Graph and Map Drawings -- Untangling Hairballs: From 3 to 14 Degrees of Separation -- GION: Interactively Untangling Large Graphs on Wall-Sized Displays -- Contact Representations -- Balanced Circle Packings for Planar Graphs -- Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D -- The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings -- Bitonic st-orderings of Biconnected Planar Graphs -- k-Planar Graphs -- Drawing Outer 1-planar Graphs with Few Slopes -- Fan-Planar Graphs: Combinatorial Properties and Complexity Results -- On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs -- Crossing Minimization Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth -- A Crossing Lemma for the Pair-Crossing Number -- Are Crossings Important for Drawing Large Graphs? -- Level Drawings -- The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity) -- Column Planarity and Partial Simultaneous Geometric Embedding -- Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths -- Theory -- Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture -- Morphing Schnyder Drawings of Planar Triangulations -- Trade-Offs in Planar Polyline Drawings -- Fixed Edge Directions -- Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports -- Planar Octilinear Drawings with One Bend Per Edge -- On the Complexity of HV-rectilinear Planarity Testing -- Embedding Four-Directional Paths on Convex Point Sets -- Drawing under Constraints -- Drawing Graphs within Restricted Area -- Height-Preserving Transformations of Planar Graph Drawings -- Drawing Planar Graphs with Reduced Height -- Anchored Drawings of Planar Graphs -- Clustered Planarity -- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs -- Clustered Planarity Testing Revisited -- A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem -- MapSets: Visualizing Embedded and Clustered Graphs -- Greedy Graphs -- Increasing-Chord Graphs On Point Sets -- On Self-approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs -- On Monotone Drawings of Trees -- Graph Drawing Contest -- Graph Drawing Contest Report -- Posters -- A User Study on the Visualization of Directed Graphs -- GraphBook: Making Graph Paging Real -- Circular Tree Drawing by Simulating Network Synchronisation Dynamics and Scaling -- PiGra? A Tool for Pixelated Graph Representations -- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends -- Touching Triangle Representations in a k-gon of Biconnected Outerplanar Graphs -- 3D Graph Visualization with the Oculus Rift -- Force-Directed 3D Arc Diagrams -- People Prefer Less Stress and Fewer Crossings -- A New Approach to Visualizing General Trees Using Thickness-Adjustable Quadratic Curves -- Minimum Representations of Rectangle Visibility Graphs. 330 $aThis book constitutes the proceedings of the 22nd International Symposium on Graph Drawing, GD 2014, held in Würzburg, Germany, in September 2014. The 41 full papers presented in this volume were carefully reviewed and selected from 72 submissions. The back matter of the book also contains 2 page poster papers presented at the conference. The contributions are organized in topical sections named: planar subgraphs; simultaneous embeddings; applications; contact representations; k-planar graphs; crossing minimization; level drawings; theory; fixed edge directions; drawing under constraints; clustered planarity; and greedy graphs. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8871 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer graphics 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Graphics 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer graphics. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 676 $a511.5 702 $aDuncan$b Christian$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSymvonis$b Antonios$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996210508003316 996 $aGraph Drawing$9773153 997 $aUNISA