You have Guest access.
Log In
Ioannis G. Tollis and Maurizio Patrignani
Front matter
1
Networks in Biology – From Identification, Analysis to Interpretation
2-13
Graph Drawing for Security Visualization
14-25
Succinct Greedy Graph Drawing in the Hyperbolic Plane
26-37
An Algorithm to Construct Greedy Drawings of Triangulations
38-49
Crossing and Weighted Crossing Number of Near-Planar Graphs
50-60
Cubic Graphs Have Bounded Slope Parameter
61-66
Unimaximal Sequences of Pairs in Rectangle Visibility Drawing
67-77
Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
78-89
The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
90-101
Rapid Multipole Graph Drawing on the GPU
102-113
Clustered Planarity: Clusters with Few Outgoing Edges
114-120
Computing Maximum C-Planar Subgraphs
121-132
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters (Extended Abstract)
133-144
Visual Analysis of One-to-Many Matched Graphs
145-156
Topological Morphing of Planar Graphs
157-168
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
169-180
Graph Simultaneous Embedding Tool, GraphSET
181-192
Hamiltonian Alternating Paths on Bicolored Double-Chains
193-205
The Binary Stress Model for Graph Drawing
206-217
Efficient Node Overlap Removal Using a Proximity Stress Model
218-229
An Experimental Study on Distance-Based Graph Drawing (Extended Abstract)
230-241
Topology Preserving Constrained Graph Layout
242-253
Embeddability Problems for Upward Planar Digraphs
254-265
A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs
266-277
On the Hardness of Orthogonal-Order Preserving Graph Drawing
278-283
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
284-295
Placing Text Boxes on Graphs A Fast Approximation Algorithm for Maximizing Overlap of a Square and a Simple Polygon
296-301
Removing Node Overlaps Using Multi-sphere Scheme
302-312
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
313-318
Connected Rectilinear Graphs on Point Sets
319-323
3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces
324-335
Drawing (Complete) Binary Tanglegrams Hardness, Approximation, Fixed-Parameter Tractability
336-347
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
348-359
Cyclic Leveling of Directed Graphs
360-371
Constrained Point-Set Embeddability of Planar Graphs
372-383
Tree Drawings on the Hexagonal Grid
384-389
Isometric Diamond Subgraphs
390-395
Non-convex Representations of Graphs
396-407
Subdivision Drawings of Hypergraphs
408-419
Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three (Extended Abstract)
420-431
Dunnart: A Constraint-Based Network Diagram Authoring Tool
432-434
Approximating the Crossing Number of Apex Graphs
435-436
Policy-Aware Visualization of Internet Dynamics
437-438
Enhancing Visualizations of Business Processes
439-440
A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs
441-442
Visualizing the Results of Metabolic Pathway Queries
443-444
Visual Specification of Layout
445-446
Spine Crossing Minimization in Upward Topological Book Embeddings
447-448
ILOG Elixir
449-450
DAGmap View
451-452
Brain Network Analyzer
453-458
Graph Drawing Contest Report
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