On the public citation graph
On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
0 signed · 71 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/3-540-63165-8_161openalex-snapshot
LEDA: a platform for combinatorial and geometric computing
inferredcites →https://doi.org/10.1007/978-3-642-76118-8_3openalex-snapshot
LEDA A Library of Efficient Data Types and Algorithms
inferredcites →https://doi.org/10.1007/bf02122694openalex-snapshot
How to draw a planar graph on a grid
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/0304-3975(76)90086-4openalex-snapshot
Computing an st-numbering
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.1145/1634.322451openalex-snapshot
Depth-First Search and Kuratowski Subgraphs
inferredcites →https://doi.org/10.1145/219717.219797openalex-snapshot
Principles and applications of chaotic systems
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.1006/jagm.2000.1132openalex-snapshot
Efficient Algorithms for Petersen's Matching Theorem
inferred← citeshttps://doi.org/10.1007/11533719_80openalex-snapshot
A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_27openalex-snapshot
Local Problems, Planar Local Problems and Linear Time
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_161openalex-snapshot
LEDA: a platform for combinatorial and geometric computing
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_10openalex-snapshot
Using Brouwer’s Fixed Point Theorem
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_2openalex-snapshot
An Experimental Study of Crossing Minimization Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_24openalex-snapshot
Graph Embedding with Minimum Depth and Maximum External Face
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_3openalex-snapshot
Stop Minding Your P’s and Q’s: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_14openalex-snapshot
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_33openalex-snapshot
Determining the Smallest k Such That G Is k-Outerplanar
inferred← citeshttps://doi.org/10.1007/978-3-642-02538-9_6openalex-snapshot
Algorithm Engineering: Concepts and Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_22openalex-snapshot
Algorithm Engineering – An Attempt at a Definition
inferred← citeshttps://doi.org/10.1007/978-3-642-14866-8_5openalex-snapshot
Chapter 5. Realistic Computer Models
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_29openalex-snapshot
On the Density of Maximal 1-Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_67openalex-snapshot
A Planarity Test via Construction Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-60831-5_10openalex-snapshot
Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen
inferred← citeshttps://doi.org/10.1007/978-3-662-05148-1_2openalex-snapshot
Some Algorithmic Problems in Polytope Theory
inferred← citeshttps://doi.org/10.1007/bfb0055759openalex-snapshot
From algorithms to working programs: On the use of program checking in LEDA
inferred← citeshttps://doi.org/10.1007/pl00009189openalex-snapshot
An Algorithm for Straight-Line Drawing of Planar Graphs
inferred← citeshttps://doi.org/10.1007/s002870050066openalex-snapshot
Algorithmen zum automatischen Zeichnen von Graphen
inferred← citeshttps://doi.org/10.1007/s00453-004-1128-8openalex-snapshot
Inserting an Edge into a Planar Graph
inferred← citeshttps://doi.org/10.1016/j.dam.2014.11.001openalex-snapshot
Tree t -spanners in outerplanar graphs via supply demand partition
inferred← citeshttps://doi.org/10.1016/j.mechmachtheory.2022.105161openalex-snapshot
A matrix-based method for searching configurations of planetary gear trains
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.030openalex-snapshot
Fixed-parameter algorithms for the weighted Max-Cut problem on embedded 1-planar graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00153-1openalex-snapshot
A simple linear algorithm for the edge-disjoint (s, t)-paths problem in undirected planar graphs
inferred← citeshttps://doi.org/10.1016/s0898-1221(00)90217-7openalex-snapshot
LEDA: A platform for combinatorial and geometric computing
inferred← citeshttps://doi.org/10.1057/jors.2014.98openalex-snapshot
An algorithm and upper bounds for the weighted maximal planar graph problem
inferred← citeshttps://doi.org/10.1057/palgrave.ivs.9500078openalex-snapshot
Automatic Layout of UML Class Diagrams in Orthogonal Style
inferred← citeshttps://doi.org/10.1080/09728600.2023.2218459openalex-snapshot
An annotated review on graph drawing and its applications
inferred← citeshttps://doi.org/10.1109/2945.841119openalex-snapshot
Graph visualization and navigation in information visualization: A survey
inferred← citeshttps://doi.org/10.1109/iv.2003.1218030openalex-snapshot
Planarity testing for graphs represented by a rotation scheme
inferred← citeshttps://doi.org/10.1109/tvcg.2025.3545481openalex-snapshot
Interweaving Mathematics and Art: Drawing Graphs as Celtic Knots and Links With CelticGraph
inferred← citeshttps://doi.org/10.1137/110848311openalex-snapshot
Contractions, Removals, and Certifying 3-Connectivity in Linear Time
inferred← citeshttps://doi.org/10.1137/22m152058xopenalex-snapshot
Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion
inferred← citeshttps://doi.org/10.1145/3519935.3520021openalex-snapshot
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
inferred← citeshttps://doi.org/10.1155/2013/783710openalex-snapshot
Graphs with no K3,3 Minor Containing a Fixed Edge
inferred← citeshttps://doi.org/10.11606/d.45.2003.tde-20210729-133142openalex-snapshot
Análise experimental de algoritmos de planaridade
inferred← citeshttps://doi.org/10.1201/9781420035179.ch32openalex-snapshot
PQ Trees, PC Trees, and Planar Graphs
inferred← citeshttps://doi.org/10.1365/s13291-022-00247-7openalex-snapshot
Graph Theory – A Survey on the Occasion of the Abel Prize for László Lovász
inferred← citeshttps://doi.org/10.17169/refubium-18086openalex-snapshot
Structure and constructions of 3-connected graphs
inferred← citeshttps://doi.org/10.24200/sci.2017.4116openalex-snapshot
Time complexity of two disjoint simple paths
inferred← citeshttps://doi.org/10.48550/arxiv.1011.6187openalex-snapshot
Contractions, Removals and How to Certify 3-Connectivity in Linear Time
inferred← citeshttps://doi.org/10.48550/arxiv.1202.5003openalex-snapshot
A Planarity Test via Construction Sequences
inferred← citeshttps://doi.org/10.5555/1496770.1496812openalex-snapshot
Inserting a vertex into a planar graph
inferred← citeshttps://doi.org/10.5555/365411.365455openalex-snapshot
Inserting an edge into a planar graph
inferred← citeshttps://doi.org/10.7155/jgaa.00032openalex-snapshot
Planarizing Graphs - A Survey and Annotated Bibliography
inferred← citeshttps://doi.org/10.7155/jgaa.00044openalex-snapshot
Planar Graphs with Topological Constraints
inferred← citeshttps://doi.org/10.7155/jgaa.00091openalex-snapshot
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
inferred← citeshttps://doi.org/10.7155/jgaa.00094openalex-snapshot
Algorithm and Experiments in Testing Planar Graphs for Isomorphism
inferred← citeshttps://doi.org/10.82308/1812openalex-snapshot
Guarding problems and geometric split 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.