On the public citation graph
Drawing Planar Partitions II: HH-Drawings
0 signed · 43 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.1007/10692760_11openalex-snapshot
Drawing Planar Partitions II: HH-Drawings
inferredcites →https://doi.org/10.1007/3-540-58950-3_361openalex-snapshot
Minimum-width grid drawings of plane graphs extend abstract
inferredcites →https://doi.org/10.1007/3-540-62592-5_66openalex-snapshot
Nice drawings for planar bipartite graphs
inferredcites →https://doi.org/10.1007/3-540-63938-1_67openalex-snapshot
Which aesthetic has the greatest effect on human understanding?
inferredcites →https://doi.org/10.1007/bf01209713openalex-snapshot
Satisfiability of co-nested formulas
inferredcites →https://doi.org/10.1007/bf02086606openalex-snapshot
Drawing Planar Graphs Using the Canonical Ordering
inferredcites →https://doi.org/10.1007/bf02086610openalex-snapshot
Applications of the crossing number
inferredcites →https://doi.org/10.1007/bf02122694openalex-snapshot
How to draw a planar graph on a grid
inferredcites →https://doi.org/10.1007/bf02187850openalex-snapshot
Area requirement and symmetry display of planar upward drawings
inferredcites →https://doi.org/10.1016/0020-0255(91)90052-vopenalex-snapshot
On the thickness of graphs of given degree
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/s0925-7721(98)00016-9openalex-snapshot
Minimum-width grid drawings of plane graphs
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.1142/s0218195997000144openalex-snapshot
Convex Grid Drawings of 3-Connected Planar Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11618058_5openalex-snapshot
On Embedding a Cycle in a Plane Graph
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_4openalex-snapshot
Drawing Graphs on Two and Three Lines
inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_23openalex-snapshot
Towards a Characterization of Stretchable Aligned Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_1openalex-snapshot
Aligned Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_33openalex-snapshot
Planar Drawings of Fixed-Mobile Bigraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_7openalex-snapshot
Grid-Obstacle Representations with Connections to Staircase Guarding
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_12openalex-snapshot
Clustering Cycles into Cycles of Clusters
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_26openalex-snapshot
Colored Simultaneous Geometric Embeddings
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_28openalex-snapshot
Upper Bound Constructions for Untangling Planar Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_8openalex-snapshot
Implementing a Partitioned 2-Page Book Embedding Testing Algorithm
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-45803-7_37openalex-snapshot
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
inferred← citeshttps://doi.org/10.1007/s00453-010-9433-xopenalex-snapshot
Colored Simultaneous Geometric Embeddings and Universal Pointsets
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.039openalex-snapshot
Simpler algorithms for testing two-page book embedding of partitioned graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.07.025openalex-snapshot
Planar drawings of fixed-mobile bigraphs
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.1309.0683openalex-snapshot
Strip Planarity Testing of Embedded Planar Graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00115openalex-snapshot
Clustering Cycles into Cycles of Clusters
inferred← citeshttps://doi.org/10.7155/jgaa.00165openalex-snapshot
C-Planarity of C-Connected Clustered Graphs
showing the first 27 of 28 · page through all 28
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.