Nonplanar topological inference and political-map graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A new approximation algorithm for the planar augmentation problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Computing Orthogonal Drawings with the Minimum Number of Bends
IEEE Transactions on Computers
Inserting an edge into a planar graph
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Optimizing over All Combinatorial Embeddings of a Planar Graph
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Computing Orthogonal Drawings in a Variable Embedding Setting
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Hierarchical Topological Inference on Planar Disc Maps
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Computing Optimal Embeddings for Planar Graphs
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Bend Minimization in Orthogonal Drawings Using Integer Programming
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Graph Drawing Algorithm Engineering with AGD
Revised Lectures on Software Visualization, International Seminar
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Linear Time Implementation of SPQR-Trees
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Semi-dynamic Orthogonal Drawings of Planar Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Advances in C-Planarity Testing of Clustered Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Towards area requirements for drawing hierarchically planar graphs
Theoretical Computer Science - Algorithms,automata, complexity and games
Finding Double Euler Trails of Planar Graphs in Linear Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Inserting a vertex into a planar graph
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Topological Morphing of Planar Graphs
Graph Drawing
Spherical-Rectangular Drawings
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
An algorithm for constructing star-shaped drawings of plane graphs
Computational Geometry: Theory and Applications
On the Hardness and Approximability of Planar Biconnectivity Augmentation
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Planarity testing and optimal edge insertion with embedding constraints
GD'06 Proceedings of the 14th international conference on Graph drawing
The SPQR-tree data structure in graph drawing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Area minimization for grid visibility representation of hierarchically planar graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Dynamic distance hereditary graphs using split decomposition
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Testing planarity of partially embedded graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Upward Spirality and Upward Planarity Testing
SIAM Journal on Discrete Mathematics
GD'10 Proceedings of the 18th international conference on Graph drawing
Orthogonal graph drawing with flexibility constraints
GD'10 Proceedings of the 18th international conference on Graph drawing
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
A kuratowski-type theorem for planarity of partially embedded graphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
A tighter insertion-based approximation of the crossing number
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Upward spirality and upward planarity testing
GD'05 Proceedings of the 13th international conference on Graph Drawing
C-planarity of extrovert clustered graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Non-planar core reduction of graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
No-bend orthogonal drawings of series-parallel graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Fixed-Parameter tractable algorithms for testing upward planarity
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
A linear time algorithm for constructing maximally symmetric straight-line drawings of planar graphs
GD'04 Proceedings of the 12th international conference on Graph Drawing
Advances in the planarization method: effective multiple edge insertions
GD'11 Proceedings of the 19th international conference on Graph Drawing
Monotone drawings of graphs with fixed embedding
GD'11 Proceedings of the 19th international conference on Graph Drawing
Simultaneous embedding of embedded planar graphs
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Journal of Discrete Algorithms
Theoretical Computer Science
A branch-and-cut approach to the crossing number problem
Discrete Optimization
Computing a minimum-depth planar graph embedding in O(n4) time
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A Kuratowski-type theorem for planarity of partially embedded graphs
Computational Geometry: Theory and Applications
Disconnectivity and relative positions in simultaneous embeddings
GD'12 Proceedings of the 20th international conference on Graph Drawing
Implementing a partitioned 2-page book embedding testing algorithm
GD'12 Proceedings of the 20th international conference on Graph Drawing
Optimal orthogonal graph drawing with convex bend costs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Topological morphing of planar graphs
Theoretical Computer Science
| Hi-index | 0.01 |
The on-line planarity-testing problem consists of performing the following operations on a planar graph $G$: (i) testing if a new edge can be added to $G$ so that the resulting graph is itself planar; (ii) adding vertices and edges such that planarity is preserved. An efficient technique for on-line planarity testing of a graph is presented that uses $O(n)$ space and supports tests and insertions of vertices and edges in $O(\log n)$ time, where $n$ is the current number of vertices of $G$. The bounds for tests and vertex insertions are worst-case and the bound for edge insertions is amortized. We also present other applications of this technique to dynamic algorithms for planar graphs.