Drawing graphs in the plane with high resolution

Authors:
M. Formann;T. Hagerup;J. Haralambides;M. Kaufmann;F. T. Leighton;A. Symvonis;E. Welzl;G. Woeginger
Affiliations:
Freie Univ. Berlin, Berlin, Germany;Freie Univ. Berlin, Berlin, Germany/ and Univ. des Saarlandes, Saarbrucken, Germany;Barry Univ., Miami Shores, FL;Univ. des Saarlandes, Saarbrucken, Germany;Massachusetts Institute of Technology, Cambridge;Univ. of Sydney, Sydney, Australia;Freie Univ. Berlin, Berlin, Germany;Technical Univ. of Graz, Graz, Austria
Venue:
SIAM Journal on Computing
Year:
1993

Convex drawings of graphs in two and three dimensions (preliminary version)

Proceedings of the twelfth annual symposium on Computational geometry
An experimental study of the basis for graph drawing algorithms

Journal of Experimental Algorithmics (JEA)
Higher order Delaunay triangulations

Computational Geometry: Theory and Applications
A Framework for Drawing Planar Graphs with Curves and Polylines

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Higher Order Delaunay Triangulations

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Radiocoloring in planar graphs: complexity and approximations

Theoretical Computer Science - Mathematical foundations of computer science 2000
The straight-line RAC drawing problem is NP-hard

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Maximizing the total resolution of graphs

GD'10 Proceedings of the 18th international conference on Graph drawing
Complexity of finding non-planar rectilinear drawings of graphs

GD'10 Proceedings of the 18th international conference on Graph drawing
A new force-directed graph drawing method based on edge-edge repulsion

Journal of Visual Languages and Computing
Triangulations with circular arcs

GD'11 Proceedings of the 19th international conference on Graph Drawing

Hi-index	0.00