On the public citation graph

Upward drawings of triconnected digraphs

https://doi.org/10.1007/bf01188716
0 signed · 152 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118033104openalex-snapshot
Graphs: Theory and Algorithms
inferredcites →https://doi.org/10.1007/978-1-4612-2972-8_4openalex-snapshot
Congruent Graphs and the Connectivity of Graphs
inferredcites →https://doi.org/10.1007/978-94-009-2639-4_1openalex-snapshot
Graphical Data Structures for Ordered Sets
inferredcites →https://doi.org/10.1007/978-94-009-5315-4_3openalex-snapshot
The Diagram
inferredcites →https://doi.org/10.1007/bf00353654openalex-snapshot
Planar acyclic oriented graphs
inferredcites →https://doi.org/10.1007/bf00714475openalex-snapshot
Representing orders on the plane by translating convex figures
inferredcites →https://doi.org/10.1007/bf02187705openalex-snapshot
A unified approach to visibility representations of planar graphs
inferredcites →https://doi.org/10.1007/bf02187850openalex-snapshot
Area requirement and symmetry display of planar upward drawings
inferredcites →https://doi.org/10.1016/0012-365x(87)90008-2openalex-snapshot
Fundamentals of planar ordered sets
inferredcites →https://doi.org/10.1016/0020-0190(90)90045-yopenalex-snapshot
Bipartite graphs, upward drawings, and planarity
inferredcites →https://doi.org/10.1016/0022-0000(85)90004-2openalex-snapshot
A linear algorithm for embedding planar graphs using PQ-trees
inferredcites →https://doi.org/10.1016/0095-8956(76)90024-1openalex-snapshot
Planar lattices and planar graphs
inferredcites →https://doi.org/10.1016/0095-8956(77)90048-xopenalex-snapshot
The dimension of planar posets
inferredcites →https://doi.org/10.1016/0304-3975(88)90123-5openalex-snapshot
Algorithms for plane representations of acyclic digraphs
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-snapshot
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7180-4openalex-snapshot
Planar Graphs: Theory and Algorithms
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1109/21.87055openalex-snapshot
Automatic graph drawing and readability of diagrams
inferredcites →https://doi.org/10.1109/sfcs.1989.63515openalex-snapshot
Incremental planarity testing
inferredcites →https://doi.org/10.1109/tsmc.1981.4308636openalex-snapshot
Methods for Visual Understanding of Hierarchical System Structures
inferredcites →https://doi.org/10.1109/wvl.1989.77035openalex-snapshot
How to draw a directed graph
inferredcites →https://doi.org/10.1137/0216030openalex-snapshot
On Embedding a Graph in the Grid with the Minimum Number of Bends
inferredcites →https://doi.org/10.1145/10515.10528openalex-snapshot
Geometry of planar graphs with angles
inferredcites →https://doi.org/10.1145/129712.129764openalex-snapshot
On the angular resolution of planar graphs
inferredcites →https://doi.org/10.1145/321850.321852openalex-snapshot
Efficient Planarity Testing
inferredcites →https://doi.org/10.2307/2371086openalex-snapshot
Congruent Graphs and the Connectivity of Graphs
inferredcites →https://doi.org/10.4153/cjm-1975-074-0openalex-snapshot
Planar Lattices
inferredcites →https://doi.org/10.5555/127787.127828openalex-snapshot
Upward planar drawing of single source acyclic digraphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/spe.474openalex-snapshot
Drawing database schemas
inferred← citeshttps://doi.org/10.1007/11618058_10openalex-snapshot
Volume Requirements of 3D Upward Drawings
inferred← citeshttps://doi.org/10.1007/11618058_12openalex-snapshot
Upward Spirality and Upward Planarity Testing
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_2openalex-snapshot
Quasi-Upward Planarity
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_6openalex-snapshot
Upward Planarity Checking: “Faces Are More than Polygons”
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_32openalex-snapshot
Upward Embeddings and Orientations of Undirected Planar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_33openalex-snapshot
An Approach for Mixed Upward Planarization
inferred← citeshttps://doi.org/10.1007/3-540-44969-8_11openalex-snapshot
Software Packages
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_2openalex-snapshot
Turn-Regularity and Planar Orthogonal Drawings
inferred← citeshttps://doi.org/10.1007/3-540-57811-0_2openalex-snapshot
Advances in graph drawing
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_384openalex-snapshot
On the computational complexity of upward and rectilinear planarity testing
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_450openalex-snapshot
Undirected Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_9openalex-snapshot
Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_653openalex-snapshot
Upward Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_7openalex-snapshot
Upward Planar Morphs
inferred← citeshttps://doi.org/10.1007/978-3-030-10564-8_18openalex-snapshot
Multilevel Planarity
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_25openalex-snapshot
Extending Upward Planar Graph Drawings
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_15openalex-snapshot
Reaching 3-Connectivity via Edge-Edge Additions
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_36openalex-snapshot
Homotopy Height, Grid-Major Height and Graph-Drawing Height
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_39openalex-snapshot
An SPQR-Tree-Like Embedding Representation for Upward Planarity
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_9openalex-snapshot
Path-Monotonic Upward Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-67731-2_30openalex-snapshot
Drawing Two Posets
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_11openalex-snapshot
Upward Planar Drawings with Three and More Slopes
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_14openalex-snapshot
Quasi-upward Planar Drawings with Minimum Curve Complexity
inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_13openalex-snapshot
Testing Upward Planarity of Partial 2-Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-23101-8_8openalex-snapshot
Parameterized Approaches to Orthogonal Compaction
inferred← citeshttps://doi.org/10.1007/978-3-031-49275-4_14openalex-snapshot
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_1openalex-snapshot
On the Upward Planarity of Mixed Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_2openalex-snapshot
Upward Planarity Testing: A Computational Study
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_4openalex-snapshot
Strip Planarity Testing
inferred← citeshttps://doi.org/10.1007/978-3-319-04657-0_28openalex-snapshot
Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods
inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_5openalex-snapshot
Vertex Disjoint Paths in Upward Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-12340-0_15openalex-snapshot
Towards the Hanani-Tutte Theorem for Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_3openalex-snapshot
Bounded Embeddings of Graphs in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_18openalex-snapshot
Bitonic st-orderings for Upward Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_8openalex-snapshot
C-Planarity of Embedded Cyclic c-Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-68953-1_2openalex-snapshot
A Characterization of Horoidal Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_16openalex-snapshot
A Parameterized Algorithm for Upward Planarity Testing
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_15openalex-snapshot
Computing Upward Planar Drawings Using Switch-Regularity Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_23openalex-snapshot
Fixed-Parameter Tractable Algorithms for Testing Upward Planarity
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_30openalex-snapshot
Building Blocks of Upward Planar Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-68552-4_5openalex-snapshot
Layer-Free Upward Crossing Minimization
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_13openalex-snapshot
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_20openalex-snapshot
Maximum Upward Planar Subgraphs of Embedded Planar Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_27openalex-snapshot
Constrained Simultaneous and Near-Simultaneous Embeddings
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_29openalex-snapshot
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_29openalex-snapshot
An Improved Upward Planarity Testing Algorithm and Related Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_24openalex-snapshot
A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_6openalex-snapshot
Switch-Regular Upward Planar Embeddings of Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_14openalex-snapshot
Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph
inferred← citeshttps://doi.org/10.1007/978-3-642-18638-7_2openalex-snapshot
Technical Foundations
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_29openalex-snapshot
Simultaneous Embedding of Embedded Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_40openalex-snapshot
Upward Planarity Testing of Embedded Mixed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_685-1openalex-snapshot
Unified View of Graph Searching and LDFS-Based Certifying Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_44openalex-snapshot
On the Number of Upward Planar Orientations of Maximal Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_22openalex-snapshot
Upward Planarity Testing via SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_30openalex-snapshot
Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-60744-8_28openalex-snapshot
Easy Planarity Testing for Ordered Sets
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_23openalex-snapshot
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_35openalex-snapshot
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-981-96-2845-2_10openalex-snapshot
Ranking and Unranking of the Planar Embeddings of a Planar Graph
inferred← citeshttps://doi.org/10.1007/bf01108622openalex-snapshot
Upward planarity testing
inferred← citeshttps://doi.org/10.1007/bfb0021798openalex-snapshot
Upward numbering testing for triconnected graphs
inferred← citeshttps://doi.org/10.1007/s00453-016-0128-9openalex-snapshot
Strip Planarity Testing for Embedded Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-020-00714-6openalex-snapshot
Upward Planar Morphs
inferred← citeshttps://doi.org/10.1007/s00453-020-00725-3openalex-snapshot
Embedding Graphs into Embedded Graphs
inferred← citeshttps://doi.org/10.1007/s10878-010-9373-zopenalex-snapshot
Computing maximum upward planar subgraphs of single-source embedded digraphs
inferred← citeshttps://doi.org/10.1007/s40304-018-0169-2openalex-snapshot
Combinatorial Characterization of Upward Planarity
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50022-xopenalex-snapshot
Graph Drawing**Work supported in part by the National Science Foundation under grant CCR-9732327, and by the U.S. Army Research Office under grant DAAH04-96-1-0013.
inferred← citeshttps://doi.org/10.1016/j.amc.2005.03.007openalex-snapshot
A better heuristic for area-compaction of orthogonal representations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.02.001openalex-snapshot
Maximum upward planar subgraphs of embedded planar digraphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.08.003openalex-snapshot
Upward planar drawings on the standing and the rolling cylinders
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101668openalex-snapshot
Extending upward planar graph drawings
inferred← citeshttps://doi.org/10.1016/j.disc.2006.09.053openalex-snapshot
On the sphericity testing of single source digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.061openalex-snapshot
Volume requirements of 3D upward drawings
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.02.004openalex-snapshot
Improving the running time of embedded upward planarity testing
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103692openalex-snapshot
Parameterized approaches to orthogonal compaction
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103775openalex-snapshot
Rectilinear-upward planarity testing of digraphs
inferred← citeshttps://doi.org/10.1016/j.jda.2014.11.006openalex-snapshot
Computing upward topological book embeddings of upward planar digraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.09.029openalex-snapshot
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.015openalex-snapshot
Upward and quasi-upward planarity testing of embedded mixed graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.04.024openalex-snapshot
On the number of upward planar orientations of maximal planar graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.003openalex-snapshot
Upward planar graphs and their duals
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114541openalex-snapshot
Upward planarity testing of biconnected outerplanar DAGs solves partition
inferred← citeshttps://doi.org/10.1016/s0925-7721(99)00054-1openalex-snapshot
Turn-regularity and optimal area drawings of orthogonal representations
inferred← citeshttps://doi.org/10.1023/a:1006095702164openalex-snapshot
The Complexity of Upward Drawings on Spheres
inferred← citeshttps://doi.org/10.1093/comjnl/bxv082openalex-snapshot
Computing Quasi-Upward Planar Drawings of Mixed Graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxw064openalex-snapshot
Dynamic Upward Planarity Testing of Single Source Embedded Digraphs
inferred← citeshttps://doi.org/10.1109/32.403790openalex-snapshot
Parametric graph drawing
inferred← citeshttps://doi.org/10.1109/fit.2012.71openalex-snapshot
Comparison of Maximal Upward Planar Subgraph Computation Algorithms
inferred← citeshttps://doi.org/10.1109/icict.2007.375362openalex-snapshot
Current Research on Planar Graphs
inferred← citeshttps://doi.org/10.1109/iisa.2014.6878792openalex-snapshot
Upward-rightward planar drawings
inferred← citeshttps://doi.org/10.1137/070696854openalex-snapshot
Upward Spirality and Upward Planarity Testing
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch70openalex-snapshot
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges
inferred← citeshttps://doi.org/10.1137/24m1679240openalex-snapshot
Upward and Rectilinear Planarity are W[1]-Hard Parameterized by Treewidth
inferred← citeshttps://doi.org/10.1137/s0097539794277123openalex-snapshot
On the Computational Complexity of Upward and Rectilinear Planarity Testing
inferred← citeshttps://doi.org/10.1137/s0097539794279626openalex-snapshot
Optimal Upward Planarity Testing of Single-Source Digraphs
inferred← citeshttps://doi.org/10.1142/s0129054119500011openalex-snapshot
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
inferred← citeshttps://doi.org/10.1142/s021819590800260xopenalex-snapshot
ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS
inferred← citeshttps://doi.org/10.1142/s0218195913600029openalex-snapshot
SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS
inferred← citeshttps://doi.org/10.1145/1671970.1671975openalex-snapshot
Layer-free upward crossing minimization
inferred← citeshttps://doi.org/10.1145/2699875openalex-snapshot
Upward Planarity Testing in Practice
inferred← citeshttps://doi.org/10.1145/3239561openalex-snapshot
Windrose Planarity
inferred← citeshttps://doi.org/10.1201/b15385-4openalex-snapshot
- Planarity Testing and Embedding
inferred← citeshttps://doi.org/10.1216/rmj-2008-38-1-107openalex-snapshot
On the Upward Embedding on the Torus
inferred← citeshttps://doi.org/10.15496/publikation-17933openalex-snapshot
Upward-rightward planar drawings
inferred← citeshttps://doi.org/10.20382/jocg.v9i1openalex-snapshot
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
inferred← citeshttps://doi.org/10.4230/lipics.esa.2019.19openalex-snapshot
Computing k-Modal Embeddings of Planar Digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1309.0683openalex-snapshot
Strip Planarity Testing of Embedded Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1312.1526openalex-snapshot
Vertex Disjoint Path in Upward Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1410.1006openalex-snapshot
A Survey on Small-Area Planar Graph Drawing
inferred← citeshttps://doi.org/10.48550/arxiv.1410.3022openalex-snapshot
Toward the Hanani-Tutte Theorem for Clustered Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1608.08578openalex-snapshot
Bitonic st-orderings for Upward Planar Graphs
inferred← citeshttps://doi.org/10.5281/zenodo.205722openalex-snapshot
FIGURE 2 in A new species of the genus Gonatodes Fitzinger, 1843 (Reptilia: Sphaerodactylidae) from central Guyana, northern South America
inferred← citeshttps://doi.org/10.7155/jgaa.00067openalex-snapshot
An Approach for Mixed Upward Planarization
inferred← citeshttps://doi.org/10.7155/jgaa.00127openalex-snapshot
Upward Planar Drawings and Switch-regularity Heuristics
inferred← citeshttps://doi.org/10.7155/jgaa.00191openalex-snapshot
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
inferred← citeshttps://doi.org/10.7155/jgaa.00194openalex-snapshot
Constrained Simultaneous and Near-Simultaneous Embeddings
inferred← citeshttps://doi.org/10.7155/jgaa.00241openalex-snapshot
Switch-Regular Upward Planarity Testing of Directed Trees
inferred← citeshttps://doi.org/10.7155/jgaa.00262openalex-snapshot
DAGmaps and ε-Visibility Representations for DAGs: Algorithms and Characterizations
inferred← citeshttps://doi.org/10.7155/jgaa.00347openalex-snapshot
1-Planarity of Graphs with a Rotation System
inferred← citeshttps://doi.org/10.7155/jgaa.00561openalex-snapshot
Radial Level Planarity with Fixed Embedding
inferred← citeshttps://doi.org/10.7155/jgaa.00587openalex-snapshot
Upward planar drawings with two slopes
inferred← citeshttps://doi.org/10.7155/jgaa.00617openalex-snapshot
Upward Planar Drawings with Three and More Slopes
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.