Borrow it
Coverart for item
The Resource Graph drawing : 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014 : revised selected papers, Christian Duncan, Antonios Symvonis (Eds.)

Graph drawing : 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014 : revised selected papers, Christian Duncan, Antonios Symvonis (Eds.)

Creator
Editor
Contributor
Summary
This 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
Language
eng
Work
Publication
Extent
1 online resource.
Contents
  • Planar 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
Isbn
9783662458037
Instance
Label
Graph drawing : 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014 : revised selected papers
Title
Graph drawing
Title remainder
22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014 : revised selected papers
Statement of responsibility
Christian Duncan, Antonios Symvonis (Eds.)
Title variation
GD 2014
Creator
Contributor
Editor
Subject
Genre
Language
eng
Summary
This 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
Member of
Cataloging source
NLGGC
Dewey number
005.1
Index
no index present
LC call number
QA76.9.A43
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2014
http://bibfra.me/vocab/lite/meetingName
GD (Symposium)
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorName
  • Duncan, Christian
  • Symvonis, Antonios
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
8871
http://library.link/vocab/subjectName
  • Graph theory
  • Computer graphics
  • Computational complexity
  • Computer science
  • Computer software
  • Computational complexity
  • Computer graphics
  • Computer science
  • Computer software
  • Graph theory
Label
Graph drawing : 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014 : revised selected papers, Christian Duncan, Antonios Symvonis (Eds.)
Instantiates
Publication
Copyright
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
  • text
  • text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Planar 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
Control code
897803429
Extent
1 online resource.
Form of item
online
Isbn
9783662458037
Media category
  • computer
  • computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-662-45803-7
Specific material designation
remote
System control number
(OCoLC)897803429
Label
Graph drawing : 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014 : revised selected papers, Christian Duncan, Antonios Symvonis (Eds.)
Publication
Copyright
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
  • text
  • text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Planar 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
Control code
897803429
Extent
1 online resource.
Form of item
online
Isbn
9783662458037
Media category
  • computer
  • computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-662-45803-7
Specific material designation
remote
System control number
(OCoLC)897803429

Subject

Genre

Member of

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Missouri Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...