21st International Symposium on
Graph Drawing
23-25 September 2013, Bordeaux (Talence), France
GD 2013 Accepted Papers
Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases
A Ramsey-type result for geometric $\ell$-hypergraphs
Exploiting Air-Pressure to Map Floorplans on Point Sets
Fixed parameter tractability of crossing minimization of almost-trees
Superpatterns and Universal Point Sets
Sketched graph drawing: a lesson in empirical studies.
Streamed Graph Drawing and the File Maintenance Problem
Achieving Good Angular Resolution in 3D Arc Diagrams
Untangling two systems of noncrossing curves
Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity
Drawing Permutations with Few Corners
Colored Spanning Graphs for Set Visualization
Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations
On Orthogonally Convex Drawings of Plane Graphs
Strongly-Connected Outerplanar Graphs with Proper Touching Triangle Representations
On the Upward Planarity of Mixed Plane Graphs
Block Additivity of Z2-Embeddings
Straight Line Triangle Representations
A duality transform for constructing small grid embeddings of 3d polytopes
Extending Partial Representations of Circle Graphs
Incremental Grid-like Layout Using Soft and Hard Constraints
A Linear-Time Algorithm for Testing Outer-1-Planarity
Dynamic Traceroute Visualization at Multiple Abstraction Levels
Characterizing Planarity by the Splittable Deque
Upward Planarity Testing: A Computational Study
Straight-line Grid Drawings of 3-Connected 1-Planar Graphs
Strip Planarity Testing
Planar and Plane Slope Number of Partial 2-Trees
Slanted Orthogonal Drawings
Drawing Non-planar Graphs with Crossing-free Subgraphs
Exploring Complex Drawings via Edge Stratification
Strict Confluent Drawing
On Balanced +-Contact Representations
Drawing Planar Graphs with a Prescribed Cycle
New bounds on the maximum number of edges in k-quasi-planar graphs
Stub Bundling and Confluent Spirals for Geographic Networks
Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices
Many-to-One Boundary Labeling with Backbones
Using ILP/SAT to determine pathwidth, visbility representations, and other grid-based graph drawings
Recognizing Outer 1-Planar Graphs in Linear Time
Morphing Planar Graph Drawings Efficiently
COAST: A Convex Optimization Approach to Stress-Based Embedding
Diamond Sponsor
Gold Sponsor
Silver Sponsor
Bronze Sponsor
Sponsors
