On the public citation graph
Area requirement and symmetry display of planar upward drawings
0 signed · 159 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230140202openalex-snapshot
On minimal‐node‐cost planar embeddings
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-7798-3_5openalex-snapshot
Dimension Theory for Ordered Sets
inferredcites →https://doi.org/10.1007/bf00289576openalex-snapshot
The complexity of drawing trees nicely
inferredcites →https://doi.org/10.1007/bf00714475openalex-snapshot
Representing orders on the plane by translating convex figures
inferredcites →https://doi.org/10.1007/bf01703328openalex-snapshot
Jahresbericht der deutschen Mathematiker-Vereinigung
inferredcites →https://doi.org/10.1007/bf01840401openalex-snapshot
Dynamic maintenance of planar digraphs, with applications
inferredcites →https://doi.org/10.1007/bf02122694openalex-snapshot
How to draw a planar graph on a grid
inferredcites →https://doi.org/10.1007/bf02187705openalex-snapshot
A unified approach to visibility representations of planar graphs
inferredcites →https://doi.org/10.1007/bf02187706openalex-snapshot
Rectilinear planar layouts and bipolar orientations of planar graphs
inferredcites →https://doi.org/10.1007/bfb0038465openalex-snapshot
Computational complexity of geometric symmetry detection in graphs
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(75)90019-8openalex-snapshot
On the vector representation of the reachability in planar directed graphs
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/0166-218x(92)90112-nopenalex-snapshot
Fast detection and display of symmetry in outerplanar 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/s0304-0208(08)73550-3openalex-snapshot
A Depth-First-Search Characterization of Planarity
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/31.34669openalex-snapshot
Planar grid embedding in linear time
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/109648.109679openalex-snapshot
On upward drawing testing of triconnected digraphs (extended abstract)
inferredcites →https://doi.org/10.1145/62212.62254openalex-snapshot
Small sets supporting fary embeddings of planar graphs
inferredcites →https://doi.org/10.1145/800141.804663openalex-snapshot
On translating a set of rectangles
inferredcites →https://doi.org/10.5555/127787.127828openalex-snapshot
Upward planar drawing of single source acyclic digraphs
inferredcites →https://doi.org/10.5555/320176.320191openalex-snapshot
Embedding planar graphs on the grid
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.1002/net.21449openalex-snapshot
Succinct greedy drawings do not always exist
inferred← citeshttps://doi.org/10.1006/jagm.1996.0044openalex-snapshot
On-line Planar Graph Embedding
inferred← citeshttps://doi.org/10.1007/10692760_11openalex-snapshot
Drawing Planar Partitions II: HH-Drawings
inferred← citeshttps://doi.org/10.1007/11618058_10openalex-snapshot
Volume Requirements of 3D Upward Drawings
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_52openalex-snapshot
AGD: A Library of Algorithms for Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-45875-1_24openalex-snapshot
Graph Drawing Algorithm Engineering with AGD
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_9openalex-snapshot
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
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-57899-4_70openalex-snapshot
A more compact visibility representation
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_351openalex-snapshot
Three-dimensional 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_394openalex-snapshot
Drawing graphs by example efficiently: Trees and planar acyclic digraphs (extended abstract)
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/3-540-62592-5_67openalex-snapshot
Area requirement of Gabriel drawings (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_64openalex-snapshot
Area requirements for drawing hierarchically planar graphs
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_655openalex-snapshot
Clustered Graph Drawing
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-35802-0_30openalex-snapshot
4-Connected Triangulations on Few Lines
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_16openalex-snapshot
Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
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_15openalex-snapshot
st-Orientations with Few Transitive Edges
inferred← citeshttps://doi.org/10.1007/978-3-031-23101-8_5openalex-snapshot
Dominance Drawings for DAGs with Bounded Modular Width
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_25openalex-snapshot
Straight-Line Drawability of a Planar Graph Plus an Edge
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_21openalex-snapshot
The Partial Visibility Representation Extension Problem
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-540-31843-9_38openalex-snapshot
3D Visualization of Semantic Metadata Models and Ontologies
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_28openalex-snapshot
Upright-Quad Drawing of st-Planar Learning Spaces
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_9openalex-snapshot
How to Draw a Clustered Tree
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-92248-3_12openalex-snapshot
Upward Straight-Line Embeddings of Directed Graphs into Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_11openalex-snapshot
Upward Planarization Layout
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_17openalex-snapshot
Succinct Greedy Drawings Do Not Always Exist
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_5openalex-snapshot
On the Perspectives Opened by Right Angle Crossing Drawings
inferred← citeshttps://doi.org/10.1007/978-3-642-18638-7_7openalex-snapshot
AGD — A Library of Algorithms for Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_24openalex-snapshot
Overloaded Orthogonal Drawings
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_654-1openalex-snapshot
Symmetric Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_655-1openalex-snapshot
Clustered Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_44openalex-snapshot
DAGView: An Approach for Visualizing Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_5openalex-snapshot
Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_52openalex-snapshot
Weak Dominance Drawings for Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_9openalex-snapshot
Right Angle Crossing Drawings of Graphs
inferred← citeshttps://doi.org/10.1007/bf01188716openalex-snapshot
Upward drawings of triconnected digraphs
inferred← citeshttps://doi.org/10.1007/bf02086606openalex-snapshot
Drawing Planar Graphs Using the Canonical Ordering
inferred← citeshttps://doi.org/10.1007/bfb0021802openalex-snapshot
The strength of weak proximity (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0030816openalex-snapshot
How to draw a planar clustered graph
inferred← citeshttps://doi.org/10.1007/bfb0049393openalex-snapshot
Planar drawings and angular resolution: Algorithms and bounds
inferred← citeshttps://doi.org/10.1007/s00453-002-1011-4openalex-snapshot
Drawing Trees Symmetrically in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00453-023-01111-5openalex-snapshot
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario
inferred← citeshttps://doi.org/10.1007/s00453-023-01142-yopenalex-snapshot
Upward Book Embeddability of st-Graphs: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1007/s11083-021-09589-wopenalex-snapshot
Characterization of B0-VPG Cocomparability Graphs and a 2D Visualization of their Posets
inferred← citeshttps://doi.org/10.1007/s42979-021-00713-6openalex-snapshot
Constant-Time Reachability in DAGs Using Multidimensional Dominance Drawings
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00085-ropenalex-snapshot
Bipolar orientations revisited
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.comgeo.2004.03.015openalex-snapshot
Proximity drawings in polynomial area and volume
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.2009.07.002openalex-snapshot
Upward straight-line embeddings of directed graphs into point sets
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.2007.12.061openalex-snapshot
Volume requirements of 3D upward drawings
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.093openalex-snapshot
Transversal structures on triangulations: A combinatorial study and straight-line drawings
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103870openalex-snapshot
On the enumeration of plane bipolar posets and transversal structures
inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.011openalex-snapshot
Baxter permutations and plane bipolar orientations
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.12.004openalex-snapshot
Monotone drawings of graphs with few directions
inferred← citeshttps://doi.org/10.1016/j.jda.2005.12.004openalex-snapshot
The strength of weak proximity
inferred← citeshttps://doi.org/10.1016/j.jda.2008.09.015openalex-snapshot
How to draw a clustered tree
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114819openalex-snapshot
A fixed-parameter algorithm for dominance drawings of DAGs
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00048-3openalex-snapshot
Area requirement of visibility representations of trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00031-2openalex-snapshot
Towards area requirements for drawing hierarchically planar graphs
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.1016/s0304-3975(99)00239-xopenalex-snapshot
Spring algorithms and symmetry
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00016-3openalex-snapshot
New results on drawing angle graphs
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00016-9openalex-snapshot
Minimum-width grid drawings of plane 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/090748640openalex-snapshot
Nonconvex Representations of Plane Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611973204.9openalex-snapshot
Small Superpatterns for Dominance Drawing
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch70openalex-snapshot
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges
inferred← citeshttps://doi.org/10.1137/1.9781611977073.42openalex-snapshot
A Sublinear Bound on the Page Number of Upward Planar Graphs
inferred← citeshttps://doi.org/10.1137/22m1522450openalex-snapshot
A Sublinear Bound on the Page Number of Upward Planar Graphs
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/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.1142/s0218195900000358openalex-snapshot
DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY
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.1145/142675.142728openalex-snapshot
A framework for dynamic graph drawing
inferred← citeshttps://doi.org/10.1145/160985.161165openalex-snapshot
Area-efficient upward tree drawings
inferred← citeshttps://doi.org/10.1145/237218.237401openalex-snapshot
Convex drawings of graphs in two and three dimensions (preliminary version)
inferred← citeshttps://doi.org/10.1145/3301281openalex-snapshot
A Survey on Graph Drawing Beyond Planarity
inferred← citeshttps://doi.org/10.1155/2018/6208509openalex-snapshot
A Force-Directed Algorithm for Drawing Directed Graphs Symmetrically
inferred← citeshttps://doi.org/10.15496/publikation-17933openalex-snapshot
Upward-rightward planar drawings
inferred← citeshttps://doi.org/10.20868/upm.thesis.70082openalex-snapshot
Latin Polytopes and Their Applications
inferred← citeshttps://doi.org/10.3390/foundations1020020openalex-snapshot
Multidimensional Dominance Drawings and Their Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1108.1439openalex-snapshot
Weak Dominance Drawings and Linear Extension Diameter
inferred← citeshttps://doi.org/10.48550/arxiv.1209.0756openalex-snapshot
Data-Oblivious Graph Drawing Model and Algorithms
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.1504.06540openalex-snapshot
Straight-line Drawability of a Planar Graph Plus an Edge
inferred← citeshttps://doi.org/10.48550/arxiv.1608.08578openalex-snapshot
Bitonic st-orderings for Upward Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1906.09224openalex-snapshot
Multidimensional Dominance Drawings
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0607094openalex-snapshot
Upright-Quad Drawing of st-Planar Learning Spaces
inferred← citeshttps://doi.org/10.48550/arxiv.math/0602163openalex-snapshot
Transversal structures on triangulations: a combinatorial study and straight-line drawings
inferred← citeshttps://doi.org/10.5281/zenodo.171028openalex-snapshot
the generic status of Baiyankamys and description of a new species of Hydromys
inferred← citeshttps://doi.org/10.5441/002/edbt.2014.46openalex-snapshot
Reachability Queries in Very Large Graphs: A Fast Refined Online Search Approach
inferred← citeshttps://doi.org/10.7155/jgaa.00127openalex-snapshot
Upward Planar Drawings and Switch-regularity Heuristics
inferred← citeshttps://doi.org/10.7155/jgaa.00391openalex-snapshot
Algorithms and Bounds for Overloaded Orthogonal Drawings
inferred← citeshttps://doi.org/10.7155/jgaa.00587openalex-snapshot
Upward planar drawings with two slopes
inferred← citeshttps://doi.org/10.7301/z0833qcbopenalex-snapshot
Data-Oblivious Algorithms for Privacy-Preserving Access to Cloud Storage
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.