Conferences in DBLP

Symposium on Graph Drawing (GD) (gd)
2008 (conf/gd/2008)

1. 
   Networks in Biology - From Identification, Analysis to Interpretation. [Citation Graph (, )][DBLP]
   
   
2. 
   Graph Drawing for Security Visualization. [Citation Graph (, )][DBLP]
   
   
3. 
   Succinct Greedy Graph Drawing in the Hyperbolic Plane. [Citation Graph (, )][DBLP]
   
   
4. 
   An Algorithm to Construct Greedy Drawings of Triangulations. [Citation Graph (, )][DBLP]
   
   
5. 
   Crossing and Weighted Crossing Number of Near-Planar Graphs. [Citation Graph (, )][DBLP]
   
   
6. 
   Cubic Graphs Have Bounded Slope Parameter. [Citation Graph (, )][DBLP]
   
   
7. 
   Unimaximal Sequences of Pairs in Rectangle Visibility Drawing. [Citation Graph (, )][DBLP]
   
   
8. 
   Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights. [Citation Graph (, )][DBLP]
   
   
9. 
   The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing. [Citation Graph (, )][DBLP]
   
   
10. 
    Rapid Multipole Graph Drawing on the GPU. [Citation Graph (, )][DBLP]
    
    
11. 
    Clustered Planarity: Clusters with Few Outgoing Edges. [Citation Graph (, )][DBLP]
    
    
12. 
    Computing Maximum C-Planar Subgraphs. [Citation Graph (, )][DBLP]
    
    
13. 
    Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. [Citation Graph (, )][DBLP]
    
    
14. 
    Visual Analysis of One-to-Many Matched Graphs. [Citation Graph (, )][DBLP]
    
    
15. 
    Topological Morphing of Planar Graphs. [Citation Graph (, )][DBLP]
    
    
16. 
    An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. [Citation Graph (, )][DBLP]
    
    
17. 
    Graph Simultaneous Embedding Tool, GraphSET. [Citation Graph (, )][DBLP]
    
    
18. 
    Hamiltonian Alternating Paths on Bicolored Double-Chains. [Citation Graph (, )][DBLP]
    
    
19. 
    The Binary Stress Model for Graph Drawing. [Citation Graph (, )][DBLP]
    
    
20. 
    Efficient Node Overlap Removal Using a Proximity Stress Model. [Citation Graph (, )][DBLP]
    
    
21. 
    An Experimental Study on Distance-Based Graph Drawing. [Citation Graph (, )][DBLP]
    
    
22. 
    Topology Preserving Constrained Graph Layout. [Citation Graph (, )][DBLP]
    
    
23. 
    Embeddability Problems for Upward Planar Digraphs. [Citation Graph (, )][DBLP]
    
    
24. 
    A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs. [Citation Graph (, )][DBLP]
    
    
25. 
    On the Hardness of Orthogonal-Order Preserving Graph Drawing. [Citation Graph (, )][DBLP]
    
    
26. 
    Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints. [Citation Graph (, )][DBLP]
    
    
27. 
    Placing Text Boxes on Graphs. [Citation Graph (, )][DBLP]
    
    
28. 
    Removing Node Overlaps Using Multi-sphere Scheme. [Citation Graph (, )][DBLP]
    
    
29. 
    Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. [Citation Graph (, )][DBLP]
    
    
30. 
    Connected Rectilinear Graphs on Point Sets. [Citation Graph (, )][DBLP]
    
    
31. 
    3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces. [Citation Graph (, )][DBLP]
    
    
32. 
    Drawing (Complete) Binary Tanglegrams. [Citation Graph (, )][DBLP]
    
    
33. 
    Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem. [Citation Graph (, )][DBLP]
    
    
34. 
    Cyclic Leveling of Directed Graphs. [Citation Graph (, )][DBLP]
    
    
35. 
    Constrained Point-Set Embeddability of Planar Graphs. [Citation Graph (, )][DBLP]
    
    
36. 
    Tree Drawings on the Hexagonal Grid. [Citation Graph (, )][DBLP]
    
    
37. 
    Isometric Diamond Subgraphs. [Citation Graph (, )][DBLP]
    
    
38. 
    Non-convex Representations of Graphs. [Citation Graph (, )][DBLP]
    
    
39. 
    Subdivision Drawings of Hypergraphs. [Citation Graph (, )][DBLP]
    
    
40. 
    Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three. [Citation Graph (, )][DBLP]
    
    
41. 
    Dunnart: A Constraint-Based Network Diagram Authoring Tool. [Citation Graph (, )][DBLP]
    
    
42. 
    Approximating the Crossing Number of Apex Graphs. [Citation Graph (, )][DBLP]
    
    
43. 
    Policy-Aware Visualization of Internet Dynamics. [Citation Graph (, )][DBLP]
    
    
44. 
    Enhancing Visualizations of Business Processes. [Citation Graph (, )][DBLP]
    
    
45. 
    A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs. [Citation Graph (, )][DBLP]
    
    
46. 
    Visualizing the Results of Metabolic Pathway Queries. [Citation Graph (, )][DBLP]
    
    
47. 
    Visual Specification of Layout. [Citation Graph (, )][DBLP]
    
    
48. 
    Spine Crossing Minimization in Upward Topological Book Embeddings. [Citation Graph (, )][DBLP]
    
    
49. 
    ILOG Elixir. [Citation Graph (, )][DBLP]
    
    
50. 
    DAGmap View. [Citation Graph (, )][DBLP]
    
    
51. 
    Brain Network Analyzer. [Citation Graph (, )][DBLP]
    
    
52. 
    Graph Drawing Contest Report. [Citation Graph (, )][DBLP]