Drawing Planar Graphs

Drawing Planar Graphs (1999)

Cached

Download Links

[www.ads.tuwien.ac.at]

Other Repositories/Bibliography

DBLP

by René Weiskircher

Citations:

2 - 0 self

BibTeX

@MISC{Weiskircher99drawingplanar,
    author = {René Weiskircher},
    title = {Drawing Planar Graphs},
    year = {1999}
}

Bookmark

OpenURL

Abstract

Citations

593	LEDA: A Platform for Combinatorial and Geometric Computing. MaxPlanck-Institut fuer Informatik, Saarbruecken - Mehlhorn, Naeher - 1995
314	How to draw a graph - Tutte - 1962
168	Embedding planar graphs on the grid - Schnyder - 1990
95	An algorithm for planarity testing of graphs - Lempel, Even, et al. - 1967
76	Convex representation of graphs - Tutte - 1960
42	The node deletion problem for hereditary properties is NPcomplete - Lewis, Yannakakis - 1980
41	Data Structures and Algorithms 2: Graph Algorithms and NP{ Completeness - Mehlhorn - 1984
30	Maximum planar subgraphs and nice embeddings: Practical layout tools - unger, Mutzel - 1993
29	On the deletion of nonplanar edges of a graph - Liu, Geldmacher - 1977
28	Planarizing graphs — a survey and annotated bibliography - Liebers
25	Drawing planar graphs using the canonical ordering. Algorithmica 16(1):4–32 - Kant - 1996
10	Planar graph augmentation problems - Kant, Bodlaender
10	Alpha-algorithms for incremental planarity testing - Poutré, A - 1994
5	Planar Graphs: Theory and Algorithms, volume 32 of Annals of Discrete Mathematics - Nishizeki, Chiba - 1988
3	Planarity and duality of and in planar graphs - Thomassen - 1980
2	The Maximum Planar Subgraph Problem, Ph.D. Dissertation, Universit at zu K oln - Mutzel - 1994
1	personal communication - Kant - 1994
1	Anewgraph theoretic heuristic for facilitylayout. Management Science - Leung - 1992
1	On the NP-hardness of edgedeletion and-contraction problems. Discrete Applied Mathematics - Watanabe, Ae, et al. - 1983