On the public citation graph

Planar acyclic oriented graphs

https://doi.org/10.1007/bf00353654
0 signed · 36 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.1007/bf00340774openalex-snapshot
Complexity of diagrams
inferredcites →https://doi.org/10.1016/0012-365x(87)90008-2openalex-snapshot
Fundamentals of planar ordered sets
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(80)90083-0openalex-snapshot
Planarity and duality of finite and infinite graphs
inferredcites →https://doi.org/10.1017/cbo9780511662157.008openalex-snapshot
The geometry of planar graphs
inferredcites →https://doi.org/10.4153/cjm-1975-074-0openalex-snapshot
Planar Lattices

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-55706-7_23openalex-snapshot
How to draw a series-parallel digraph
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_42openalex-snapshot
Optimal upward planarity testing of single-source digraphs
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_356openalex-snapshot
On bend-minimum orthogonal upward drawing of directed planar graphs
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-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-31843-9_30openalex-snapshot
Building Blocks of Upward Planar Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_39openalex-snapshot
Classification of Planar Upward Embedding
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_13openalex-snapshot
The Duals of Upward Planar Graphs on Cylinders
inferred← citeshttps://doi.org/10.1007/978-3-642-45043-3_5openalex-snapshot
Rolling Upward Planarity Testing of Strongly Connected Graphs
inferred← citeshttps://doi.org/10.1007/978-94-011-2080-7_23openalex-snapshot
Problems About Planar Orders
inferred← citeshttps://doi.org/10.1007/978-94-017-0697-1_9openalex-snapshot
Reading, Drawing, and Order
inferred← citeshttps://doi.org/10.1007/bf01108622openalex-snapshot
Upward planarity testing
inferred← citeshttps://doi.org/10.1007/bf01188716openalex-snapshot
Upward drawings of triconnected digraphs
inferred← citeshttps://doi.org/10.1007/bf02187850openalex-snapshot
Area requirement and symmetry display of planar upward drawings
inferred← citeshttps://doi.org/10.1007/bfb0021811openalex-snapshot
Upward drawings on planes and spheres
inferred← citeshttps://doi.org/10.1007/s11083-006-9028-yopenalex-snapshot
Upward Three-Dimensional Grid Drawings of Graphs
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90021-jopenalex-snapshot
A note on optimal area algorithms for upward drawings of binary trees
inferred← citeshttps://doi.org/10.1016/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50007-5openalex-snapshot
10.1016/b978-044488002-4/50007-5
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.tcs.2015.01.003openalex-snapshot
Upward planar graphs and their duals
inferred← citeshttps://doi.org/10.1137/s0097539792235724openalex-snapshot
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
inferred← citeshttps://doi.org/10.1137/s0097539792235906openalex-snapshot
Upward Planar Drawing of Single-Source Acyclic Digraphs
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.1145/109648.109679openalex-snapshot
On upward drawing testing of triconnected digraphs (extended abstract)
inferred← citeshttps://doi.org/10.1145/142675.142728openalex-snapshot
A framework for dynamic graph drawing
inferred← citeshttps://doi.org/10.5555/127787.127828openalex-snapshot
Upward planar drawing of single source acyclic digraphs
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.