GD 2007 - PDF Preprint Papers

GD 2007 Graph Drawing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed GD-2007 Paper

click to vote

GD
2007
Springer

138views Computer Graphics» more GD 2007»

Minimizing the Area for Planar Straight-Line Grid Drawings

13 years 10 months ago

Download i11www.iti.uni-karlsruhe.de

Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid draw...

Marcus Krug, Dorothea Wagner

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	138	Minimizing the Area for Planar Straight-Line Grid Drawings	claim
2	134	Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices	claim
3	134	Crossing Numbers and Parameterized Complexity	claim
4	133	Cover Contact Graphs	claim
5	131	Drawing Graphs with GLEE	claim
6	120	Constrained Simultaneous and Near-Simultaneous Embeddings	claim
7	118	Multi-circular Layout of Micro/Macro Graphs	claim
8	118	Simultaneous Geometric Graph Embeddings	claim
9	108	Algorithms for Multi-criteria One-Sided Boundary Labeling	claim
10	107	Constrained Stress Majorization Using Diagonally Scaled Gradient Projection	claim
11	103	Visualizing Internet Evolution on the Autonomous Systems Level	claim
12	99	A Bipartite Strengthening of the Crossing Lemma	claim
13	96	Crossing Number of Graphs with Rotation Systems	claim
14	94	Cyclic Level Planarity Testing and Embedding	claim
15	94	Characterization of Unlabeled Level Planar Graphs	claim
16	90	Improvement on the Decay of Crossing Numbers	claim
17	89	Matched Drawings of Planar Graphs	claim
18	88	Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces	claim
19	87	Moving Vertices to Make Drawings Plane	claim
20	80	Efficient Extraction of Multiple Kuratowski Subdivisions	claim
21	78	Minimum Level Nonplanar Patterns for Trees	claim
22	69	Line Crossing Minimization on Metro Maps	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers