↓ Skip to main content

Graph drawing : 14th international symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006 : revised papers

Overview of attention for book
Cover of 'Graph drawing : 14th international symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006 : revised papers'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Number of Triangulations on Planar Point Sets
  3. Altmetric Badge
    Chapter 2 The Algorithmic Beauty of Digital Nature
  4. Altmetric Badge
    Chapter 3 Integrating Edge Routing into Force-Directed Layout
  5. Altmetric Badge
    Chapter 4 Multipole-Based Force Approximation Revisited – A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree
  6. Altmetric Badge
    Chapter 5 SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
  7. Altmetric Badge
    Chapter 6 Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
  8. Altmetric Badge
    Chapter 7 Angle and Distance Constraints on Tree Drawings
  9. Altmetric Badge
    Chapter 8 Schematisation of Tree Drawings
  10. Altmetric Badge
    Chapter 9 Trees with Convex Faces and Optimal Angles
  11. Altmetric Badge
    Chapter 10 Three-Dimensional Drawings of Bounded Degree Trees
  12. Altmetric Badge
    Chapter 11 Simultaneous Graph Embedding with Bends and Circular Arcs
  13. Altmetric Badge
    Chapter 12 Embedding Graphs Simultaneously with Fixed Edges
  14. Altmetric Badge
    Chapter 13 Drawing Cubic Graphs with at Most Five Slopes
  15. Altmetric Badge
    Chapter 14 Planarity Testing and Optimal Edge Insertion with Embedding Constraints
  16. Altmetric Badge
    Chapter 15 Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs
  17. Altmetric Badge
    Chapter 16 Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
  18. Altmetric Badge
    Chapter 17 On the Crossing Number of Almost Planar Graphs
  19. Altmetric Badge
    Chapter 18 On the Decay of Crossing Numbers
  20. Altmetric Badge
    Chapter 19 How Important Is the “Mental Map”? – An Empirical Investigation of a Dynamic Graph Layout Algorithm
  21. Altmetric Badge
    Chapter 20 Computing Geometric Minimum-Dilation Graphs Is NP-Hard
  22. Altmetric Badge
    Chapter 21 Chordal Graphs as Intersection Graphs of Pseudosegments
  23. Altmetric Badge
    Chapter 22 Parameterized st-Orientations of Graphs: Algorithms and Experiments
  24. Altmetric Badge
    Chapter 23 Straight-Line Drawing of Quadrangulations
  25. Altmetric Badge
    Chapter 24 Visualizing Large and Clustered Networks
  26. Altmetric Badge
    Chapter 25 Partitioned Drawings
  27. Altmetric Badge
    Chapter 26 Path Simplification for Metro Map Layout
  28. Altmetric Badge
    Chapter 27 Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps
  29. Altmetric Badge
    Chapter 28 Upright-Quad Drawing of st-Planar Learning Spaces
  30. Altmetric Badge
    Chapter 29 Choosing Colors for Geometric Graphs Via Color Space Embeddings
  31. Altmetric Badge
    Chapter 30 Morphing Planar Graphs in Spherical Space
  32. Altmetric Badge
    Chapter 31 k-Colored Point-Set Embeddability of Outerplanar Graphs
  33. Altmetric Badge
    Chapter 32 Thickness of Bar 1-Visibility Graphs
  34. Altmetric Badge
    Chapter 33 A New Approximation Algorithm for Bend Minimization in the Kandinsky Model
  35. Altmetric Badge
    Chapter 34 Radial Drawings of Graphs: Geometric Constraints and Trade-Offs
  36. Altmetric Badge
    Chapter 35 Characterization of Unlabeled Level Planar Trees
  37. Altmetric Badge
    Chapter 36 Drawing Bipartite Graphs on Two Curves
  38. Altmetric Badge
    Chapter 37 Improved Circular Layouts
  39. Altmetric Badge
    Chapter 38 Controllable and Progressive Edge Clustering for Large Networks
  40. Altmetric Badge
    Chapter 39 Biclique Edge Cover Graphs and Confluent Drawings
  41. Altmetric Badge
    Chapter 40 Schnyder Woods and Orthogonal Surfaces
  42. Altmetric Badge
    Chapter 41 Partitions of Graphs into Trees
  43. Altmetric Badge
    Chapter 42 The Website for Graph Visualization Software References (GVSR)
  44. Altmetric Badge
    Chapter 43 Smoother Transitions Between Breadth-First-Spanning-Tree-Based Drawings
  45. Altmetric Badge
    Chapter 44 Fast Node Overlap Removal—Correction
  46. Altmetric Badge
    Chapter 45 Graph-Drawing Contest Report
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users
wikipedia
10 Wikipedia pages

Citations

dimensions_citation
10 Dimensions

Readers on

mendeley
46 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Graph drawing : 14th international symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006 : revised papers
Published by
Springer, January 2007
DOI 10.1007/978-3-540-70904-6
ISBNs
978-3-54-070903-9, 978-3-54-070904-6
Authors

Kaufmann, Michael, Wagner, Dorothea

Editors

Michael Kaufmann, Dorothea Wagner

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 46 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 46 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 2%
Professor > Associate Professor 1 2%
Lecturer 1 2%
Student > Master 1 2%
Unknown 42 91%
Readers by discipline Count As %
Mathematics 1 2%
Computer Science 1 2%
Agricultural and Biological Sciences 1 2%
Engineering 1 2%
Unknown 42 91%