You have Guest access.
Log In
Patrick Healy and Nikola S. Nikolov
Front matter
1-12
Crossings and Permutations
13-24
Morphing Planar Graphs While Preserving Edge Directions
25-36
Dynamic Spectral Layout of Small Worlds
37-48
Exact Crossing Minimization
49-60
On Embedding a Cycle in a Plane Graph (Extended Abstract)
61-72
On Rectilinear Duals for Vertex-Weighted Plane Graphs
73-82
Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness
83-88
Drawing Kn in Three Dimensions with One Bend Per Edge
89-100
Small Area Drawings of Outerplanar Graphs (Extended Abstract)
101-110
Volume Requirements of 3D Upward Drawings
111-116
How to Embed a Path onto Two Sets of Points
117-128
Upward Spirality and Upward Planarity Testing
129-140
Graph Treewidth and Geometric Thickness Parameters
141-152
Stress Majorization with Orthogonal Ordering Constraints
153-164
Fast Node Overlap Removal
165-176
Delta-Confluent Drawings
177-188
Transversal Structures on Triangulations, with Application to Straight-Line Drawing
189-200
A Hybrid Model for Drawing Dynamic and Evolving Graphs
201-210
Two Trees Which Are Self–intersecting When Drawn Simultaneously
211-222
C-Planarity of Extrovert Clustered Graphs
223-234
Non-planar Core Reduction of Graphs
235-250
An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs
251-261
Hierarchical Layouts of Directed Graphs in Three Dimensions
262-273
Layout Effects on Sociogram Perception
274-284
On Edges Crossing Few Other Edges in Simple Topological Complete Graphs
285-296
On Balloon Drawings of Rooted Trees
297-308
Convex Drawings of Plane Graphs of Minimum Outer Apices
309-320
Energy-Based Clustering of Graphs with Nonuniform Degrees
321-333
A Mixed-Integer Program for Drawing High-Quality Metro Maps
334-342
Crossing Number of Toroidal Graphs
343-354
Drawing Graphs Using Modular Decomposition
355-367
Applications of Parameterized st-Orientations in Graph Drawing Algorithms
368-379
Complexity Results for Three-Dimensional Orthogonal Graph Drawing (Extended Abstract)
380-385
On Extending a Partial Straight-Line Drawing
386-396
Odd Crossing Number Is Not Crossing Number
397-408
Minimum Depth Graph Embeddings and Quality of the Drawings: An Experimental Analysis
409-420
No-bend Orthogonal Drawings of Series-Parallel Graphs (Extended Abstract)
421-433
Parallel-Redrawing Mechanisms, Pseudo-Triangulations and Kinetic Planar Graphs
434-445
Proper and Planar Drawings of Graphs on Three Layers
446-457
Incremental Connector Routing
458-467
An Application of Well-Orderly Trees in Graph Drawing
468-479
GEOMI: GEOmetry for Maximum Insight
480-491
WhatsOnWeb: Using Graph Drawing to Search the Web
492-502
Drawing Clustered Graphs in Three Dimensions
503-504
BLer: A Boundary Labeller for Technical Drawings
505-507
D-Dupe: An Interactive Tool for Entity Resolution in Social Networks
508-511
A New Method for Efficiently Generating Planar Graph Visibility Representations
512-513
SDE: Graph Drawing Using Spectral Distance Embedding
514-515
MultiPlane: A New Framework for Drawing Graphs in Three Dimensions
516-518
Visualizing Graphs as Trees: Plant a Seed and Watch it Grow
519-521
On Straightening Low-Diameter Unit Trees
522-523
Mixed Upward Planarization – Fast and Robust
524-527
Network Analysis and Visualisation
528-531
Graph-Drawing Contest Report
532
Minimum Cycle Bases and Surface Reconstruction (Abstract)
533
Hierarchy Visualization: From Research to Practice (Abstract)
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info