Fundamentals of planar ordered sets
Discrete Mathematics
Algorithms for plane representations of acyclic digraphs
Theoretical Computer Science
Embedding planar graphs in four pages
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Constrained visibility representations of graphs
Information Processing Letters
Stack and Queue Layouts of Directed Acyclic Graphs: Part I
SIAM Journal on Computing
Discrete Applied Mathematics
Stack and Queue Layouts of Directed Acyclic Graphs: Part II
SIAM Journal on Computing
Stack and Queue Layouts of Posets
SIAM Journal on Discrete Mathematics
Series-Parallel Planar Ordered Sets Have Pagenumber Two
GD '96 Proceedings of the Symposium on Graph Drawing
On embedding an outer-planar graph in a point set
Computational Geometry: Theory and Applications
Curve-constrained drawings of planar graphs
Computational Geometry: Theory and Applications
Book Embeddability of Series–Parallel Digraphs
Algorithmica
On simultaneous planar graph embeddings
Computational Geometry: Theory and Applications
Simultaneous graph embedding with bends and circular arcs
GD'06 Proceedings of the 14th international conference on Graph drawing
Embedding graphs simultaneously with fixed edges
GD'06 Proceedings of the 14th international conference on Graph drawing
Two trees which are self–intersecting when drawn simultaneously
GD'05 Proceedings of the 13th international conference on Graph Drawing
Upward Straight-Line Embeddings of Directed Graphs into Point Sets
Graph-Theoretic Concepts in Computer Science
Embeddability Problems for Upward Planar Digraphs
Graph Drawing
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Upward straight-line embeddings of directed graphs into point sets
Computational Geometry: Theory and Applications
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Upward point-set embeddability
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Upward geometric graph embeddings into point sets
GD'10 Proceedings of the 18th international conference on Graph drawing
The hamiltonian augmentation problem and its applications to graph drawing
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Upward point set embeddability for convex point sets is in P
GD'11 Proceedings of the 19th international conference on Graph Drawing
On upward point set embeddability
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
This paper studies the problem of computing an upward topological book embedding of an upward planar digraph G, i.e. a topological book embedding of G where all edges are monotonically increasing in the upward direction. Besides having its own inherent interest in the theory of upward book embeddability, the question has applications to well studied research topics of computational geometry and of graph drawing. The main results of the paper are as follows. - Every upward planar digraph G with n vertices admits an upward topological book embedding such that every edge of G crosses the spine of the book at most once. - Every upward planar digraph G with n vertices admits a point-set embedding on any set of n distinct points in the plane such that the drawing is upward and every edge of G has at most two bends. - Every pair of upward planar digraphs sharing the same set of n vertices admits an upward simultaneous embedding with at most two bends per edge.