473

Testing for the consecutive ones property, interval graphs and graph planarity using PQtree algorithms
– K Booth, G Lueker
 1976

26

O(n 2 ) algorithms for graph planarization
– R Jayakumar, K Thulasiraman, N Swami
 1989

81

Upward Planarity Testing
– Ashim Garg, Roberto Tamassia
 1995

230

Efficient planarity testing
– J E Hopcroft, R E Tarjan
 1974

15

An efficient graph planarization twophase heuristic
– O Goldschmidt, A Takvorian
 1994

17

An O(n2) maximal planarization algorithm based on PQtrees
– G Kant
 1992

15

An algorithm of maximal planarization of graphs
– T Chiba, I Nishioka, I Shirakawa

10988

Computers and Intractability: A Guide to the Theory of NPcompleteness
– M Garey, D Johnson
 1979

31

On the deletion of nonplanar edges of a graph
– P Liu, R Geldmacher
 1977

108

An algorithm for planarity testing of graphs
– A Lempel, S Even, I Cederbaum
 1966

11

A Graphplanarization Algorithm and its Applications to Random Graphs," Graph Theory and Algorithms, Lecture Notes in Computer Science 108(1981),95107 [14J F.P. & R. Tamassia, "Fully Dynamic Point Location in a Monotone Subdivision
– T Ozawa, H Takahashi
 1988

1132

Graph Theory
– F Harary
 1969

92

Automatic graph drawing and readability of diagrams
– Roberto Tamassia, Giuseppe Di Battista, Carlo Batini
 1988

63

Computing an stnumbering
– S Even, R E Tarjan
 1976

342

Graph Algorithms
– S Even
 1979

8

On Heuristics for Determining the Thickness of a Graph
– Robert Cimikowski
 1995

10

Graph theoretic heuristics for the plant layout problem
– L R Foulds, R W Robinson
 1978

76

Planar graphs: Theory and algorithms
– T Nishizeki, N Chiba

33

Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools
– Michael Jünger, Petra Mutzel
 1996
