Graph Drawing 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008, Revised Papers /
This book constitutes the proceedings of the 16th International Symposium on Graph Drawing, GD 2008, held in Heraklion, Crete, Greece, during September 21-24, 2008. The 31 long papers and 8 short papers presented together with 10 posters and two invited papers were carefully reviewed and selected fr...
Clasificación: | Libro Electrónico |
---|---|
Autor Corporativo: | |
Otros Autores: | , |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2009.
|
Edición: | 1st ed. 2009. |
Colección: | Theoretical Computer Science and General Issues,
5417 |
Temas: | |
Acceso en línea: | Texto Completo |
Tabla de Contenidos:
- Invited Talks
- Networks in Biology - From Identification, Analysis to Interpretation
- Graph Drawing for Security Visualization
- Papers
- Succinct Greedy Graph Drawing in the Hyperbolic Plane
- An Algorithm to Construct Greedy Drawings of Triangulations
- Crossing and Weighted Crossing Number of Near-Planar Graphs
- Cubic Graphs Have Bounded Slope Parameter
- Unimaximal Sequences of Pairs in Rectangle Visibility Drawing
- Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
- The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
- Rapid Multipole Graph Drawing on the GPU
- Clustered Planarity: Clusters with Few Outgoing Edges
- Computing Maximum C-Planar Subgraphs
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- Visual Analysis of One-to-Many Matched Graphs
- Topological Morphing of Planar Graphs
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
- Graph Simultaneous Embedding Tool, GraphSET
- Hamiltonian Alternating Paths on Bicolored Double-Chains
- The Binary Stress Model for Graph Drawing
- Efficient Node Overlap Removal Using a Proximity Stress Model
- An Experimental Study on Distance-Based Graph Drawing
- Topology Preserving Constrained Graph Layout
- Embeddability Problems for Upward Planar Digraphs
- A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs
- On the Hardness of Orthogonal-Order Preserving Graph Drawing
- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
- Placing Text Boxes on Graphs
- Removing Node Overlaps Using Multi-sphere Scheme
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
- Connected Rectilinear Graphs on Point Sets
- 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces
- Drawing (Complete) Binary Tanglegrams
- Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
- Cyclic Leveling of Directed Graphs
- Constrained Point-Set Embeddability of Planar Graphs
- Tree Drawings on the Hexagonal Grid
- Isometric Diamond Subgraphs
- Non-convex Representations of Graphs
- Subdivision Drawings of Hypergraphs
- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
- Dunnart: A Constraint-Based Network Diagram Authoring Tool
- Posters
- Approximating the Crossing Number of Apex Graphs
- Policy-Aware Visualization of Internet Dynamics
- Enhancing Visualizations of Business Processes
- A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs
- Visualizing the Results of Metabolic Pathway Queries
- Visual Specification of Layout
- Spine Crossing Minimization in Upward Topological Book Embeddings
- ILOG Elixir
- DAGmap View
- Brain Network Analyzer
- Graph Drawing Contest
- Graph Drawing Contest Report.