Coverart for item
The Resource Graph drawing : 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers, Stephen Wismath, Alexander Wolff (eds.)

Graph drawing : 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers, Stephen Wismath, Alexander Wolff (eds.)

Label
Graph drawing : 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers
Title
Graph drawing
Title remainder
21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers
Statement of responsibility
Stephen Wismath, Alexander Wolff (eds.)
Title variation
GD 2013
Creator
Contributor
Editor
Subject
Genre
Language
eng
Summary
This book constitutes the thoroughly refereed post-conference proceedings of the 21st International Symposium on Graph Drawing, GD 2013, held in Bordeaux, France, in September 2013. The 42 revised full papers presented together with 12 revised short papers, 3 invited talks and 1 poster description were carefully reviewed and selected from 110 submissions. The papers are organized in topical sections on upward drawings, planarity, beyond planarity, geometric representations, 3D et al., universality, practical graph drawing, subgraphs, crossings, geometric graphs and geographic networks, angular restrictions, grids, curves and routes. The book also contains a short description of the graph drawing contest
Member of
Cataloging source
GW5XE
Dewey number
006.6
Illustrations
illustrations
Index
index present
LC call number
T385
LC item number
.S96 2013
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2013
http://bibfra.me/vocab/lite/meetingName
GD (Symposium)
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorName
  • Wismath, Stephen
  • Wolff, Alexander
Series statement
  • Lecture Notes in Computer Science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
8242
http://library.link/vocab/subjectName
  • Computer graphics
  • Graph theory
  • Engineering & Applied Sciences
  • Computer Science
  • Computer Science
  • Discrete Mathematics in Computer Science
  • Algorithm Analysis and Problem Complexity
  • Computer Graphics
  • Computer Science, general
  • Computer graphics
  • Graph theory
Label
Graph drawing : 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers, Stephen Wismath, Alexander Wolff (eds.)
Instantiates
Publication
Note
Includes author index
Antecedent source
unknown
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Christopher Auer [and others]
  • Strip Planarity Testing
  • Patrizio Angelini [and others]
  • Morphing Planar Graph Drawings Efficiently
  • Patrizio Angelini [and others]
  • Invited Talk.
  • Graph Drawing through the Lens of a Framework for Analyzing Visualization Methods
  • Tamara Munzner
  • Beyond Planarity.
  • A Linear-Time Algorithm for Testing Outer-1-Planarity
  • Seok-Hee Hong [and others]
  • Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
  • Md. Jawaherul Alam, Franz J. Brandenburg, Stephen G. Kobourov
  • New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs
  • Andrew Suk, Bartosz Walczak
  • Recognizing Outer 1-Planar Graphs in Linear Time
  • Christopher Auer [and others]
  • Geometric Representations.
  • Straight Line Triangle Representations
  • Nieke Aerts, Stefan Felsner
  • Upward Drawings.
  • On the Upward Planarity of Mixed Plane Graphs
  • Fabrizio Frati [and others]
  • Upward Planarity Testing: A Computational Study
  • Markus Chimani, Robert Zeranski
  • Planarity.
  • Characterizing Planarity by the Splittable Deque
  • Michael T. Goodrich, Paweł Pszona
  • A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes
  • Alexander Igamberdiev, André Schulz
  • Block Additivity of Z2-Embeddings
  • Marcus Schaefer, Daniel Štefankovič
  • Universality.
  • Exploiting Air-Pressure to Map Floorplans on Point Sets
  • Stefan Felsner
  • Superpatterns and Universal Point Sets
  • Michael J. Bannister [and others]
  • Extending Partial Representations of Circle Graphs
  • Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices
  • Thomas Bläsius, Annette Karrer, Ignaz Rutter
  • Practical Graph Drawing.
  • Sketched Graph Drawing: A Lesson in Empirical Studies
  • Helen C. Purchase
  • Many-to-One Boundary Labeling with Backbones
  • Michael A. Bekos [and others]
  • Steven Chaplick, Radoslav Fulek, Pavel Klavík
  • On Balanced -Contact Representations
  • Stephane Durocher, Debajyoti Mondal
  • Strongly-Connected Outerplanar Graphs with Proper Touching Triangle Representations
  • J. Joseph Fowler
  • 3D et al.
  • Achieving Good Angular Resolution in 3D Arc Diagrams
  • Patrizio Angelini [and others]
  • Exploring Complex Drawings via Edge Stratification
  • Emilio Di Giacomo [and others]
  • Drawing Planar Graphs with a Prescribed Inner Face
  • Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter
  • Crossings.
  • Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases
  • Martin Fink, Sergey Pupyrev
  • Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
  • Michael J. Bannister, David Eppstein, Joseph A. Simons
  • Streamed Graph Drawing and the File Maintenance Problem
  • Strict Confluent Drawing
  • David Eppstein [and others]
  • Geometric Graphs and Geographic Networks.
  • A Ramsey-Type Result for Geometric l-Hypergraphs
  • Dhruv Mubayi, Andrew Suk
  • Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations
  • Timothy M. Chan [and others]
  • Michael T. Goodrich, Paweł Pszona
  • COAST: A Convex Optimization Approach to Stress-Based Embedding
  • Emden R. Gansner, Yifan Hu, Shankar Krishnan
  • Subgraphs.
  • Colored Spanning Graphs for Set Visualization
  • Ferran Hurtado [and others]
  • Drawing Non-Planar Graphs with Crossing-Free Subgraphs
  • Michael A. Bekos [and others]
  • Grids.
  • Drawing Arrangement Graphs in Small Grids, or How to Play Planarity
  • David Eppstein
  • Incremental Grid-Like Layout Using Soft and Hard Constraints
  • Steve Kieffer [and others]
  • Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings
  • Therese Biedl [and others]
  • Curves and Routes.
  • Untangling Two Systems of Noncrossing Curves
  • Stub Bundling and Confluent Spirals for Geographic Networks
  • Jiří Matoušek [and others]
  • Drawing Permutations with Few Corners
  • Sergey Bereg [and others]
  • Dynamic Traceroute Visualization at Multiple Abstraction Levels
  • Massimo Candela [and others]
  • Graph Drawing Contest.
  • Graph Drawing Contest Report
  • Christian A. Duncan [and others]
  • Arlind Nocaj, Ulrik Brandes
  • Angular Restrictions.
  • On Orthogonally Convex Drawings of Plane Graphs
  • Yi-Jun Chang, Hsu-Chun Yen
  • Planar and Plane Slope Number of Partial 2-Trees
  • William Lenhart [and others]
  • Slanted Orthogonal Drawings
Control code
871039362
Dimensions
unknown
Extent
1 online resource (xxii, 540 pages)
File format
unknown
Form of item
online
Isbn
9783319038407
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-319-03841-4
Other physical details
illustrations
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)871039362
Label
Graph drawing : 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers, Stephen Wismath, Alexander Wolff (eds.)
Publication
Note
Includes author index
Antecedent source
unknown
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Christopher Auer [and others]
  • Strip Planarity Testing
  • Patrizio Angelini [and others]
  • Morphing Planar Graph Drawings Efficiently
  • Patrizio Angelini [and others]
  • Invited Talk.
  • Graph Drawing through the Lens of a Framework for Analyzing Visualization Methods
  • Tamara Munzner
  • Beyond Planarity.
  • A Linear-Time Algorithm for Testing Outer-1-Planarity
  • Seok-Hee Hong [and others]
  • Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
  • Md. Jawaherul Alam, Franz J. Brandenburg, Stephen G. Kobourov
  • New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs
  • Andrew Suk, Bartosz Walczak
  • Recognizing Outer 1-Planar Graphs in Linear Time
  • Christopher Auer [and others]
  • Geometric Representations.
  • Straight Line Triangle Representations
  • Nieke Aerts, Stefan Felsner
  • Upward Drawings.
  • On the Upward Planarity of Mixed Plane Graphs
  • Fabrizio Frati [and others]
  • Upward Planarity Testing: A Computational Study
  • Markus Chimani, Robert Zeranski
  • Planarity.
  • Characterizing Planarity by the Splittable Deque
  • Michael T. Goodrich, Paweł Pszona
  • A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes
  • Alexander Igamberdiev, André Schulz
  • Block Additivity of Z2-Embeddings
  • Marcus Schaefer, Daniel Štefankovič
  • Universality.
  • Exploiting Air-Pressure to Map Floorplans on Point Sets
  • Stefan Felsner
  • Superpatterns and Universal Point Sets
  • Michael J. Bannister [and others]
  • Extending Partial Representations of Circle Graphs
  • Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices
  • Thomas Bläsius, Annette Karrer, Ignaz Rutter
  • Practical Graph Drawing.
  • Sketched Graph Drawing: A Lesson in Empirical Studies
  • Helen C. Purchase
  • Many-to-One Boundary Labeling with Backbones
  • Michael A. Bekos [and others]
  • Steven Chaplick, Radoslav Fulek, Pavel Klavík
  • On Balanced -Contact Representations
  • Stephane Durocher, Debajyoti Mondal
  • Strongly-Connected Outerplanar Graphs with Proper Touching Triangle Representations
  • J. Joseph Fowler
  • 3D et al.
  • Achieving Good Angular Resolution in 3D Arc Diagrams
  • Patrizio Angelini [and others]
  • Exploring Complex Drawings via Edge Stratification
  • Emilio Di Giacomo [and others]
  • Drawing Planar Graphs with a Prescribed Inner Face
  • Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter
  • Crossings.
  • Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases
  • Martin Fink, Sergey Pupyrev
  • Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
  • Michael J. Bannister, David Eppstein, Joseph A. Simons
  • Streamed Graph Drawing and the File Maintenance Problem
  • Strict Confluent Drawing
  • David Eppstein [and others]
  • Geometric Graphs and Geographic Networks.
  • A Ramsey-Type Result for Geometric l-Hypergraphs
  • Dhruv Mubayi, Andrew Suk
  • Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations
  • Timothy M. Chan [and others]
  • Michael T. Goodrich, Paweł Pszona
  • COAST: A Convex Optimization Approach to Stress-Based Embedding
  • Emden R. Gansner, Yifan Hu, Shankar Krishnan
  • Subgraphs.
  • Colored Spanning Graphs for Set Visualization
  • Ferran Hurtado [and others]
  • Drawing Non-Planar Graphs with Crossing-Free Subgraphs
  • Michael A. Bekos [and others]
  • Grids.
  • Drawing Arrangement Graphs in Small Grids, or How to Play Planarity
  • David Eppstein
  • Incremental Grid-Like Layout Using Soft and Hard Constraints
  • Steve Kieffer [and others]
  • Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings
  • Therese Biedl [and others]
  • Curves and Routes.
  • Untangling Two Systems of Noncrossing Curves
  • Stub Bundling and Confluent Spirals for Geographic Networks
  • Jiří Matoušek [and others]
  • Drawing Permutations with Few Corners
  • Sergey Bereg [and others]
  • Dynamic Traceroute Visualization at Multiple Abstraction Levels
  • Massimo Candela [and others]
  • Graph Drawing Contest.
  • Graph Drawing Contest Report
  • Christian A. Duncan [and others]
  • Arlind Nocaj, Ulrik Brandes
  • Angular Restrictions.
  • On Orthogonally Convex Drawings of Plane Graphs
  • Yi-Jun Chang, Hsu-Chun Yen
  • Planar and Plane Slope Number of Partial 2-Trees
  • William Lenhart [and others]
  • Slanted Orthogonal Drawings
Control code
871039362
Dimensions
unknown
Extent
1 online resource (xxii, 540 pages)
File format
unknown
Form of item
online
Isbn
9783319038407
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-319-03841-4
Other physical details
illustrations
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)871039362

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
Processing Feedback ...