Graph Drawing

Planar Induced Subgraphs of Sparse Graphs
Planar Induced Subgraphs of Sparse Graphs
Planar Induced Subgraphs of Sparse Graphs
Planar Induced Subgraphs of Sparse Graphs
Planar Induced Subgraphs of Sparse Graphs
Planar Induced Subgraphs of Sparse Graphs
Planar Induced Subgraphs of Sparse Graphs
Planar Induced Subgraphs of Sparse Graphs
Planar Induced Subgraphs of Sparse Graphs
Planar Induced Subgraphs of Sparse Graphs
Planar Induced Subgraphs of Sparse Graphs
Planar Induced Subgraphs of Sparse Graphs
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
Drawing Partially Embedded and Simultaneously Planar Graphs
Drawing Partially Embedded and Simultaneously Planar Graphs
Drawing Partially Embedded and Simultaneously Planar Graphs
Drawing Partially Embedded and Simultaneously Planar Graphs
Drawing Partially Embedded and Simultaneously Planar Graphs
Drawing Partially Embedded and Simultaneously Planar Graphs
Drawing Partially Embedded and Simultaneously Planar Graphs
Drawing Partially Embedded and Simultaneously Planar Graphs
Drawing Partially Embedded and Simultaneously Planar Graphs
Drawing Partially Embedded and Simultaneously Planar Graphs
Drawing Partially Embedded and Simultaneously Planar Graphs
Drawing Partially Embedded and Simultaneously Planar Graphs
Drawing Partially Embedded and Simultaneously Planar Graphs
Drawing Partially Embedded and Simultaneously Planar Graphs
Drawing Partially Embedded and Simultaneously Planar Graphs
Drawing Simultaneously Embedded Graphs with Few Bends
Drawing Simultaneously Embedded Graphs with Few Bends
Drawing Simultaneously Embedded Graphs with Few Bends
Drawing Simultaneously Embedded Graphs with Few Bends
Drawing Simultaneously Embedded Graphs with Few Bends
Drawing Simultaneously Embedded Graphs with Few Bends
Drawing Simultaneously Embedded Graphs with Few Bends
Drawing Simultaneously Embedded Graphs with Few Bends
Drawing Simultaneously Embedded Graphs with Few Bends
Drawing Simultaneously Embedded Graphs with Few Bends
Drawing Simultaneously Embedded Graphs with Few Bends
Drawing Simultaneously Embedded Graphs with Few Bends
Planar and Quasi Planar Simultaneous Geometric Embedding
Planar and Quasi Planar Simultaneous Geometric Embedding
Planar and Quasi Planar Simultaneous Geometric Embedding
Planar and Quasi Planar Simultaneous Geometric Embedding
Planar and Quasi Planar Simultaneous Geometric Embedding
Planar and Quasi Planar Simultaneous Geometric Embedding
Planar and Quasi Planar Simultaneous Geometric Embedding
Planar and Quasi Planar Simultaneous Geometric Embedding
Planar and Quasi Planar Simultaneous Geometric Embedding
Planar and Quasi Planar Simultaneous Geometric Embedding
Planar and Quasi Planar Simultaneous Geometric Embedding
Planar and Quasi Planar Simultaneous Geometric Embedding
Simultaneous Embeddability of Two Partitions
Simultaneous Embeddability of Two Partitions
Simultaneous Embeddability of Two Partitions
Simultaneous Embeddability of Two Partitions
Simultaneous Embeddability of Two Partitions
Simultaneous Embeddability of Two Partitions
Simultaneous Embeddability of Two Partitions
Simultaneous Embeddability of Two Partitions
Simultaneous Embeddability of Two Partitions
Simultaneous Embeddability of Two Partitions
Simultaneous Embeddability of Two Partitions
Simultaneous Embeddability of Two Partitions
Luatodonotes: Boundary Labeling for Annotations in Texts
Luatodonotes: Boundary Labeling for Annotations in Texts
Luatodonotes: Boundary Labeling for Annotations in Texts
Luatodonotes: Boundary Labeling for Annotations in Texts
Luatodonotes: Boundary Labeling for Annotations in Texts
Luatodonotes: Boundary Labeling for Annotations in Texts
Luatodonotes: Boundary Labeling for Annotations in Texts
Luatodonotes: Boundary Labeling for Annotations in Texts
Luatodonotes: Boundary Labeling for Annotations in Texts
Luatodonotes: Boundary Labeling for Annotations in Texts
Luatodonotes: Boundary Labeling for Annotations in Texts
Luatodonotes: Boundary Labeling for Annotations in Texts
Luatodonotes: Boundary Labeling for Annotations in Texts
A Coloring Algorithm for Disambiguating Graph and Map Drawings
A Coloring Algorithm for Disambiguating Graph and Map Drawings
A Coloring Algorithm for Disambiguating Graph and Map Drawings
A Coloring Algorithm for Disambiguating Graph and Map Drawings
A Coloring Algorithm for Disambiguating Graph and Map Drawings
A Coloring Algorithm for Disambiguating Graph and Map Drawings
A Coloring Algorithm for Disambiguating Graph and Map Drawings
A Coloring Algorithm for Disambiguating Graph and Map Drawings
A Coloring Algorithm for Disambiguating Graph and Map Drawings
A Coloring Algorithm for Disambiguating Graph and Map Drawings
A Coloring Algorithm for Disambiguating Graph and Map Drawings
A Coloring Algorithm for Disambiguating Graph and Map Drawings
Untangling Hairballs
Untangling Hairballs
Untangling Hairballs
Untangling Hairballs
Untangling Hairballs
Untangling Hairballs
Untangling Hairballs
Untangling Hairballs
Untangling Hairballs
Untangling Hairballs
Untangling Hairballs
Untangling Hairballs
GION: Interactively Untangling Large Graphs on Wall-Sized Displays
GION: Interactively Untangling Large Graphs on Wall-Sized Displays
GION: Interactively Untangling Large Graphs on Wall-Sized Displays
GION: Interactively Untangling Large Graphs on Wall-Sized Displays
GION: Interactively Untangling Large Graphs on Wall-Sized Displays
GION: Interactively Untangling Large Graphs on Wall-Sized Displays
GION: Interactively Untangling Large Graphs on Wall-Sized Displays
GION: Interactively Untangling Large Graphs on Wall-Sized Displays
GION: Interactively Untangling Large Graphs on Wall-Sized Displays
GION: Interactively Untangling Large Graphs on Wall-Sized Displays
GION: Interactively Untangling Large Graphs on Wall-Sized Displays
GION: Interactively Untangling Large Graphs on Wall-Sized Displays
Balanced Circle Packings for Planar Graphs
Balanced Circle Packings for Planar Graphs
Balanced Circle Packings for Planar Graphs
Balanced Circle Packings for Planar Graphs
Balanced Circle Packings for Planar Graphs
Balanced Circle Packings for Planar Graphs
Balanced Circle Packings for Planar Graphs
Balanced Circle Packings for Planar Graphs
Balanced Circle Packings for Planar Graphs
Balanced Circle Packings for Planar Graphs
Balanced Circle Packings for Planar Graphs
Balanced Circle Packings for Planar Graphs
Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
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
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
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
Bitonic st-orderings of Biconnected Planar Graphs
Bitonic st-orderings of Biconnected Planar Graphs
Bitonic st-orderings of Biconnected Planar Graphs
Bitonic st-orderings of Biconnected Planar Graphs
Bitonic st-orderings of Biconnected Planar Graphs
Bitonic st-orderings of Biconnected Planar Graphs
Bitonic st-orderings of Biconnected Planar Graphs
Bitonic st-orderings of Biconnected Planar Graphs
Bitonic st-orderings of Biconnected Planar Graphs
Bitonic st-orderings of Biconnected Planar Graphs
Bitonic st-orderings of Biconnected Planar Graphs
Drawing Outer 1-planar Graphs with Few Slopes
Drawing Outer 1-planar Graphs with Few Slopes
Drawing Outer 1-planar Graphs with Few Slopes
Drawing Outer 1-planar Graphs with Few Slopes
Drawing Outer 1-planar Graphs with Few Slopes
Drawing Outer 1-planar Graphs with Few Slopes
Drawing Outer 1-planar Graphs with Few Slopes
Drawing Outer 1-planar Graphs with Few Slopes
Drawing Outer 1-planar Graphs with Few Slopes
Drawing Outer 1-planar Graphs with Few Slopes
Drawing Outer 1-planar Graphs with Few Slopes
Drawing Outer 1-planar Graphs with Few Slopes
Fan-Planar Graphs: Combinatorial Properties and Complexity Results
Fan-Planar Graphs: Combinatorial Properties and Complexity Results
Fan-Planar Graphs: Combinatorial Properties and Complexity Results
Fan-Planar Graphs: Combinatorial Properties and Complexity Results
Fan-Planar Graphs: Combinatorial Properties and Complexity Results
Fan-Planar Graphs: Combinatorial Properties and Complexity Results
Fan-Planar Graphs: Combinatorial Properties and Complexity Results
Fan-Planar Graphs: Combinatorial Properties and Complexity Results
Fan-Planar Graphs: Combinatorial Properties and Complexity Results
Fan-Planar Graphs: Combinatorial Properties and Complexity Results
Fan-Planar Graphs: Combinatorial Properties and Complexity Results
Fan-Planar Graphs: Combinatorial Properties and Complexity Results
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
A Crossing Lemma for the Pair-Crossing Number
A Crossing Lemma for the Pair-Crossing Number
A Crossing Lemma for the Pair-Crossing Number
A Crossing Lemma for the Pair-Crossing Number
A Crossing Lemma for the Pair-Crossing Number
A Crossing Lemma for the Pair-Crossing Number
A Crossing Lemma for the Pair-Crossing Number
A Crossing Lemma for the Pair-Crossing Number
A Crossing Lemma for the Pair-Crossing Number
A Crossing Lemma for the Pair-Crossing Number
A Crossing Lemma for the Pair-Crossing Number
A Crossing Lemma for the Pair-Crossing Number
Are Crossings Important for Drawing Large Graphs?
Are Crossings Important for Drawing Large Graphs?
Are Crossings Important for Drawing Large Graphs?
Are Crossings Important for Drawing Large Graphs?
Are Crossings Important for Drawing Large Graphs?
Are Crossings Important for Drawing Large Graphs?
Are Crossings Important for Drawing Large Graphs?
Are Crossings Important for Drawing Large Graphs?
Are Crossings Important for Drawing Large Graphs?
Are Crossings Important for Drawing Large Graphs?
Are Crossings Important for Drawing Large Graphs?
Are Crossings Important for Drawing Large Graphs?
The Importance of Being Proper
The Importance of Being Proper
The Importance of Being Proper
The Importance of Being Proper
The Importance of Being Proper
The Importance of Being Proper
The Importance of Being Proper
The Importance of Being Proper
The Importance of Being Proper
The Importance of Being Proper
The Importance of Being Proper
The Importance of Being Proper
The Importance of Being Proper
Column Planarity and Partial Simultaneous Geometric Embedding
Column Planarity and Partial Simultaneous Geometric Embedding
Column Planarity and Partial Simultaneous Geometric Embedding
Column Planarity and Partial Simultaneous Geometric Embedding
Column Planarity and Partial Simultaneous Geometric Embedding
Column Planarity and Partial Simultaneous Geometric Embedding
Column Planarity and Partial Simultaneous Geometric Embedding
Column Planarity and Partial Simultaneous Geometric Embedding
Column Planarity and Partial Simultaneous Geometric Embedding
Column Planarity and Partial Simultaneous Geometric Embedding
Column Planarity and Partial Simultaneous Geometric Embedding
Column Planarity and Partial Simultaneous Geometric Embedding
Column Planarity and Partial Simultaneous Geometric Embedding
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture
Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture
Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture
Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture
Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture
Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture
Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture
Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture
Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture
Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture
Morphing Schnyder Drawings of Planar Triangulations
Morphing Schnyder Drawings of Planar Triangulations
Morphing Schnyder Drawings of Planar Triangulations
Morphing Schnyder Drawings of Planar Triangulations
Morphing Schnyder Drawings of Planar Triangulations
Morphing Schnyder Drawings of Planar Triangulations
Morphing Schnyder Drawings of Planar Triangulations
Morphing Schnyder Drawings of Planar Triangulations
Morphing Schnyder Drawings of Planar Triangulations
Morphing Schnyder Drawings of Planar Triangulations
Morphing Schnyder Drawings of Planar Triangulations
Morphing Schnyder Drawings of Planar Triangulations
Trade-Offs in Planar Polyline Drawings
Trade-Offs in Planar Polyline Drawings
Trade-Offs in Planar Polyline Drawings
Trade-Offs in Planar Polyline Drawings
Trade-Offs in Planar Polyline Drawings
Trade-Offs in Planar Polyline Drawings
Trade-Offs in Planar Polyline Drawings
Trade-Offs in Planar Polyline Drawings
Trade-Offs in Planar Polyline Drawings
Trade-Offs in Planar Polyline Drawings
Trade-Offs in Planar Polyline Drawings
Trade-Offs in Planar Polyline Drawings
Trade-Offs in Planar Polyline Drawings
Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
Planar Octilinear Drawings with One Bend Per Edge
Planar Octilinear Drawings with One Bend Per Edge
Planar Octilinear Drawings with One Bend Per Edge
Planar Octilinear Drawings with One Bend Per Edge
Planar Octilinear Drawings with One Bend Per Edge
Planar Octilinear Drawings with One Bend Per Edge
Planar Octilinear Drawings with One Bend Per Edge
Planar Octilinear Drawings with One Bend Per Edge
Planar Octilinear Drawings with One Bend Per Edge
Planar Octilinear Drawings with One Bend Per Edge
Planar Octilinear Drawings with One Bend Per Edge
Planar Octilinear Drawings with One Bend Per Edge
On the Complexity of HV-rectilinear Planarity Testing
On the Complexity of HV-rectilinear Planarity Testing
On the Complexity of HV-rectilinear Planarity Testing
On the Complexity of HV-rectilinear Planarity Testing
On the Complexity of HV-rectilinear Planarity Testing
On the Complexity of HV-rectilinear Planarity Testing
On the Complexity of HV-rectilinear Planarity Testing
On the Complexity of HV-rectilinear Planarity Testing
On the Complexity of HV-rectilinear Planarity Testing
On the Complexity of HV-rectilinear Planarity Testing
On the Complexity of HV-rectilinear Planarity Testing
On the Complexity of HV-rectilinear Planarity Testing
Embedding Four-Directional Paths on Convex Point Sets
Embedding Four-Directional Paths on Convex Point Sets
Embedding Four-Directional Paths on Convex Point Sets
Embedding Four-Directional Paths on Convex Point Sets
Embedding Four-Directional Paths on Convex Point Sets
Embedding Four-Directional Paths on Convex Point Sets
Embedding Four-Directional Paths on Convex Point Sets
Embedding Four-Directional Paths on Convex Point Sets
Embedding Four-Directional Paths on Convex Point Sets
Embedding Four-Directional Paths on Convex Point Sets
Embedding Four-Directional Paths on Convex Point Sets
Embedding Four-Directional Paths on Convex Point Sets
Drawing Graphs within Restricted Area
Drawing Graphs within Restricted Area
Drawing Graphs within Restricted Area
Drawing Graphs within Restricted Area
Drawing Graphs within Restricted Area
Drawing Graphs within Restricted Area
Drawing Graphs within Restricted Area
Drawing Graphs within Restricted Area
Drawing Graphs within Restricted Area
Drawing Graphs within Restricted Area
Drawing Graphs within Restricted Area
Drawing Graphs within Restricted Area
Drawing Graphs within Restricted Area
Height-Preserving Transformations of Planar Graph Drawings
Height-Preserving Transformations of Planar Graph Drawings
Height-Preserving Transformations of Planar Graph Drawings
Height-Preserving Transformations of Planar Graph Drawings
Height-Preserving Transformations of Planar Graph Drawings
Height-Preserving Transformations of Planar Graph Drawings
Height-Preserving Transformations of Planar Graph Drawings
Height-Preserving Transformations of Planar Graph Drawings
Height-Preserving Transformations of Planar Graph Drawings
Height-Preserving Transformations of Planar Graph Drawings
Height-Preserving Transformations of Planar Graph Drawings
Height-Preserving Transformations of Planar Graph Drawings
Drawing Planar Graphs with Reduced Height
Drawing Planar Graphs with Reduced Height
Drawing Planar Graphs with Reduced Height
Drawing Planar Graphs with Reduced Height
Drawing Planar Graphs with Reduced Height
Drawing Planar Graphs with Reduced Height
Drawing Planar Graphs with Reduced Height
Drawing Planar Graphs with Reduced Height
Drawing Planar Graphs with Reduced Height
Drawing Planar Graphs with Reduced Height
Drawing Planar Graphs with Reduced Height
Drawing Planar Graphs with Reduced Height
Anchored Drawings of Planar Graphs
Anchored Drawings of Planar Graphs
Anchored Drawings of Planar Graphs
Anchored Drawings of Planar Graphs
Anchored Drawings of Planar Graphs
Anchored Drawings of Planar Graphs
Anchored Drawings of Planar Graphs
Anchored Drawings of Planar Graphs
Anchored Drawings of Planar Graphs
Anchored Drawings of Planar Graphs
Anchored Drawings of Planar Graphs
Anchored Drawings of Planar Graphs
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Clustered Planarity Testing Revisited
Clustered Planarity Testing Revisited
Clustered Planarity Testing Revisited
Clustered Planarity Testing Revisited
Clustered Planarity Testing Revisited
Clustered Planarity Testing Revisited
Clustered Planarity Testing Revisited
Clustered Planarity Testing Revisited
Clustered Planarity Testing Revisited
Clustered Planarity Testing Revisited
Clustered Planarity Testing Revisited
Clustered Planarity Testing Revisited
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
MapSets: Visualizing Embedded and Clustered Graphs
MapSets: Visualizing Embedded and Clustered Graphs
MapSets: Visualizing Embedded and Clustered Graphs
MapSets: Visualizing Embedded and Clustered Graphs
MapSets: Visualizing Embedded and Clustered Graphs
MapSets: Visualizing Embedded and Clustered Graphs
MapSets: Visualizing Embedded and Clustered Graphs
MapSets: Visualizing Embedded and Clustered Graphs
MapSets: Visualizing Embedded and Clustered Graphs
MapSets: Visualizing Embedded and Clustered Graphs
MapSets: Visualizing Embedded and Clustered Graphs
MapSets: Visualizing Embedded and Clustered Graphs
Increasing-Chord Graphs On Point Sets
Increasing-Chord Graphs On Point Sets
Increasing-Chord Graphs On Point Sets
Increasing-Chord Graphs On Point Sets
Increasing-Chord Graphs On Point Sets
Increasing-Chord Graphs On Point Sets
Increasing-Chord Graphs On Point Sets
Increasing-Chord Graphs On Point Sets
Increasing-Chord Graphs On Point Sets
Increasing-Chord Graphs On Point Sets
Increasing-Chord Graphs On Point Sets
Increasing-Chord Graphs On Point Sets
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
On Monotone Drawings of Trees
On Monotone Drawings of Trees
On Monotone Drawings of Trees
On Monotone Drawings of Trees
On Monotone Drawings of Trees
On Monotone Drawings of Trees
On Monotone Drawings of Trees
On Monotone Drawings of Trees
On Monotone Drawings of Trees
On Monotone Drawings of Trees
On Monotone Drawings of Trees
On Monotone Drawings of Trees
On Monotone Drawings of Trees
Graph Drawing Contest Report
Graph Drawing Contest Report
Graph Drawing Contest Report
Graph Drawing Contest Report
Graph Drawing Contest Report
Graph Drawing Contest Report
A User Study on the Visualization of Directed Graphs
A User Study on the Visualization of Directed Graphs
GraphBook: Making Graph Paging Real
GraphBook: Making Graph Paging Real
Circular Tree Drawing by Simulating Network Synchronisation Dynamics and Scaling
Circular Tree Drawing by Simulating Network Synchronisation Dynamics and Scaling
PIGRA– A Tool for Pixelated Graph Representations
PIGRA– A Tool for Pixelated Graph Representations
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
Touching Triangle Represenations in a k-gon of Biconnected Outerplanar Graphs
Touching Triangle Represenations in a k-gon of Biconnected Outerplanar Graphs
3D Graph Visualization with the Oculus Rift
3D Graph Visualization with the Oculus Rift
Force-Directed 3D Arc Diagrams
Force-Directed 3D Arc Diagrams
People Prefer Less Stress and Fewer Crossings
People Prefer Less Stress and Fewer Crossings
A New Approach to Visualizing General Trees Using Thickness-Adjustable Quadratic Curves
A New Approach to Visualizing General Trees Using Thickness-Adjustable Quadratic Curves
Minimum Representations of Rectangle Visibility Graphs
Minimum Representations of Rectangle Visibility Graphs