On the public citation graph

Upward planarity testing

https://doi.org/10.1007/bf01108622
0 signed · 64 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/net.3230020103openalex-snapshot
Partial orders of dimension 2
inferredcites →https://doi.org/10.1007/3-540-57273-2_42openalex-snapshot
Optimal upward planarity testing of single-source digraphs
inferredcites →https://doi.org/10.1007/3-540-58950-3_384openalex-snapshot
On the computational complexity of upward and rectilinear planarity testing
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-94-017-0697-1_9openalex-snapshot
Reading, Drawing, and Order
inferredcites →https://doi.org/10.1007/bf00353654openalex-snapshot
Planar acyclic oriented graphs
inferredcites →https://doi.org/10.1007/bf01188716openalex-snapshot
Upward drawings of triconnected digraphs
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/0095-8956(76)90024-1openalex-snapshot
Planar lattices and planar graphs
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/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
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)73550-3openalex-snapshot
A Depth-First-Search Characterization of Planarity
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1137/0202012openalex-snapshot
Dividing a Graph into Triconnected Components
inferredcites →https://doi.org/10.1137/s0097539794277123openalex-snapshot
On the Computational Complexity of Upward and Rectilinear Planarity Testing
inferredcites →https://doi.org/10.1142/s0218195994000215openalex-snapshot
HOW TO DRAW A SERIES-PARALLEL DIGRAPH
inferredcites →https://doi.org/10.1145/321850.321852openalex-snapshot
Efficient Planarity Testing
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.1002/1097-024x(200009)30:11<1235::aid-spe339>3.0.co;2-bopenalex-snapshot
Experimental studies on graph drawing algorithms
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_2openalex-snapshot
Quasi-Upward Planarity
inferred← citeshttps://doi.org/10.1007/3-540-44969-8_11openalex-snapshot
Software Packages
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_39openalex-snapshot
Drawing directed acyclic graphs: An experimental study
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_28openalex-snapshot
Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders
inferred← citeshttps://doi.org/10.1007/978-3-031-82670-2_17openalex-snapshot
Minimum Monotone Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-98740-3_5openalex-snapshot
Drawing Reeb 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_40openalex-snapshot
Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings
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-27261-0_11openalex-snapshot
The Book Embedding Problem from a SAT-Solving Perspective
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_21openalex-snapshot
The Partial Visibility Representation Extension Problem
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-77537-9_20openalex-snapshot
Maximum Upward Planar Subgraphs of Embedded Planar Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_36openalex-snapshot
Monotone Drawings of Graphs with Fixed Embedding
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-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_32openalex-snapshot
Height-Preserving Transformations of Planar Graph Drawings
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_52openalex-snapshot
An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
inferred← citeshttps://doi.org/10.1007/bfb0021811openalex-snapshot
Upward drawings on planes and spheres
inferred← citeshttps://doi.org/10.1007/s00453-001-0083-xopenalex-snapshot
Quasi-Upward Planarity
inferred← citeshttps://doi.org/10.1007/s00453-013-9790-3openalex-snapshot
Monotone Drawings of Graphs with Fixed Embedding
inferred← citeshttps://doi.org/10.1007/s10485-018-9549-8openalex-snapshot
A Graphical Calculus for Semi-Groupal Categories
inferred← citeshttps://doi.org/10.1007/s40304-018-0169-2openalex-snapshot
Combinatorial Characterization of Upward Planarity
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.jcss.2023.02.007openalex-snapshot
Parameterized complexity of graph planarity with restricted cyclic orders
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.003openalex-snapshot
Upward planar graphs and their duals
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00272-2openalex-snapshot
Advances in the theory and practice of graph drawing
inferred← citeshttps://doi.org/10.1023/a:1006095702164openalex-snapshot
The Complexity of Upward Drawings on Spheres
inferred← citeshttps://doi.org/10.1109/icict.2007.375362openalex-snapshot
Current Research on Planar Graphs
inferred← citeshttps://doi.org/10.1109/tcbb.2022.3185670openalex-snapshot
Planar Rooted Phylogenetic Networks
inferred← citeshttps://doi.org/10.1137/070696854openalex-snapshot
Upward Spirality and Upward Planarity Testing
inferred← citeshttps://doi.org/10.1142/s0129054106004285openalex-snapshot
TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
inferred← citeshttps://doi.org/10.1142/s0218195900000358openalex-snapshot
DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY
inferred← citeshttps://doi.org/10.1145/3154857openalex-snapshot
An O ( n ϵ ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
inferred← citeshttps://doi.org/10.1145/3607869openalex-snapshot
Consistency Constraints for Mapping Dataflow Graphs to Hybrid Dataflow/von Neumann Architectures
inferred← citeshttps://doi.org/10.1201/b15385-20openalex-snapshot
- The Open Graph Drawing Framework (OGDF)
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.48550/arxiv.1209.0598openalex-snapshot
Implementing a Partitioned 2-page Book Embedding Testing Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1904.12596openalex-snapshot
Graph Planarity Testing with Hierarchical Embedding Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.2010.11582openalex-snapshot
Remark on topological nature of upward planarity
inferred← citeshttps://doi.org/10.7155/jgaa.00127openalex-snapshot
Upward Planar Drawings and Switch-regularity Heuristics
inferred← citeshttps://doi.org/10.7155/jgaa.00241openalex-snapshot
Switch-Regular Upward Planarity Testing of Directed Trees
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.