Arboricity and subgraph listing algorithms
SIAM Journal on Computing
The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
Journal of Algorithms
A lower bound on the size of universal sets for planar graphs
ACM SIGACT News
Simple alternating path problem
Discrete Mathematics
On the thickness of graphs of given degree
Information Sciences: an International Journal
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Bipartite embedding of trees in the plane
Discrete Applied Mathematics
Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine
SIAM Journal on Discrete Mathematics
Straight line embeddings of rooted star forests in the plane
Discrete Applied Mathematics
A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs
Information Processing Letters
Curve-constrained drawings of planar graphs
Computational Geometry: Theory and Applications
On simultaneous planar graph embeddings
Computational Geometry: Theory and Applications
Radial drawings of graphs: Geometric constraints and trade-offs
Journal of Discrete Algorithms
Drawing colored graphs on colored points
Theoretical Computer Science
Embeddability Problems for Upward Planar Digraphs
Graph Drawing
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Computing upward topological book embeddings of upward planar digraphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Universal sets of n points for 1-bend drawings of planar graphs with n vertices
GD'07 Proceedings of the 15th international conference on Graph drawing
Plane 3-trees: embeddability and approximation
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
In this talk we digress about the strict interplay between the graph-theoretic problem of computing a Hamiltonian augmentation of a planar graph G and the graph drawing problem of embedding G onto a given set of points. We review different Hamiltonian augmentation techniques and their impact on different variants of the corresponding graph drawing problem. We also look at universal point sets, simultaneous graph embeddings, and radial graph drawings.