On the public citation graph

On the complexity of embedding planar graphs to minimize certain distance measures

https://doi.org/10.1007/bf01840379
0 signed · 65 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.3230190107openalex-snapshot
Optimal enclosing regions in planar graphs
inferredcites →https://doi.org/10.1007/978-1-349-16482-0_10openalex-snapshot
Problems and Exercises
inferredcites →https://doi.org/10.1016/0095-8956(84)90013-3openalex-snapshot
Graph minors. III. Planar tree-width
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1109/sfcs.1983.7openalex-snapshot
Approximation algorithms for NP-complete problems on planar graphs
inferredcites →https://doi.org/10.1109/sfcs.1985.37openalex-snapshot
Multi-layer grid embeddings
inferredcites →https://doi.org/10.1137/0202012openalex-snapshot
Dividing a Graph into Triconnected Components
inferredcites →https://doi.org/10.1137/0217004openalex-snapshot
On the Complexity of Covering Vertices by Faces in a Planar Graph

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200001)35:1<26::aid-net3>3.0.co;2-mopenalex-snapshot
Degree-preserving trees
inferred← citeshttps://doi.org/10.1002/net.3230190107openalex-snapshot
Optimal enclosing regions in planar graphs
inferred← citeshttps://doi.org/10.1002/net.3230220105openalex-snapshot
Steiner tree problems
inferred← citeshttps://doi.org/10.1007/11618058_36openalex-snapshot
Minimum Depth Graph Embeddings and Quality of the Drawings: An Experimental Analysis
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_8openalex-snapshot
A Linear Time Implementation of SPQR-Trees
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_41openalex-snapshot
On the Parameterized Complexity of Layered Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_10openalex-snapshot
Computing Optimal Embeddings for Planar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_4openalex-snapshot
The SPQR-Tree Data Structure in Graph Drawing
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_33openalex-snapshot
Minimum Depth Graph Embedding
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_52openalex-snapshot
Bend Minimization in Orthogonal Drawings Using Integer Programming
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_27openalex-snapshot
Optimizing over All Combinatorial Embeddings of a Planar Graph (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_36openalex-snapshot
Homotopy Height, Grid-Major Height and Graph-Drawing Height
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_39openalex-snapshot
An SPQR-Tree-Like Embedding Representation for Upward Planarity
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_1openalex-snapshot
Drawing Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_7openalex-snapshot
Improved Outerplanarity Bounds for Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-24024-4_8openalex-snapshot
On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations
inferred← citeshttps://doi.org/10.1007/978-3-319-90530-3_23openalex-snapshot
Facility Location on Planar Graphs with Unreliable Links
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_6openalex-snapshot
10 Reasons to Get Interested in Graph Drawing
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_39openalex-snapshot
Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_26openalex-snapshot
Computing Radial Drawings on the Minimum Number of Circles
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_26openalex-snapshot
Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time
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-00219-9_15openalex-snapshot
Topological Morphing of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_11openalex-snapshot
A Tighter Insertion-Based Approximation of the Crossing Number
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_33openalex-snapshot
TESTING MUTUAL DUALITY OF PLANAR GRAPHS
inferred← citeshttps://doi.org/10.1007/978-3-662-01069-3_30openalex-snapshot
Optimieren über alle kombinatorischen Einbettungen eines planaren Graphen
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_9openalex-snapshot
Minimum Planar Multi-sink Cuts with Connectivity Priors
inferred← citeshttps://doi.org/10.1007/978-981-96-4445-2_9openalex-snapshot
On the Twin-width of Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/bf02071979openalex-snapshot
Polynomially solvable special cases of the Steiner problem in planar networks
inferred← citeshttps://doi.org/10.1007/s00453-007-9151-1openalex-snapshot
On the Parameterized Complexity of Layered Graph Drawing
inferred← citeshttps://doi.org/10.1007/s00453-009-9380-6openalex-snapshot
Finding a Minimum-depth Embedding of a Planar Graph in O(n 4) Time
inferred← citeshttps://doi.org/10.1007/s10878-016-0030-zopenalex-snapshot
A tighter insertion-based approximation of the crossing number
inferred← citeshttps://doi.org/10.1007/s11590-015-0876-5openalex-snapshot
Approximating the minimum hub cover problem on planar graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.03.009openalex-snapshot
Disjoint paths in sparse graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.10.005openalex-snapshot
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111703openalex-snapshot
On exteriority notions in book embeddings and treewidth
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.06.011openalex-snapshot
A note on the complexity of matching patterns with variables
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.08.018openalex-snapshot
Topological morphing of planar graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferred← citeshttps://doi.org/10.1137/0217004openalex-snapshot
On the Complexity of Covering Vertices by Faces in a Planar Graph
inferred← citeshttps://doi.org/10.1137/0221016openalex-snapshot
Partitioning Planar Graphs
inferred← citeshttps://doi.org/10.1137/040614086openalex-snapshot
Bend Minimization in Planar Orthogonal Drawings Using Integer Programming
inferred← citeshttps://doi.org/10.1137/s0895480102417379openalex-snapshot
Embedding k-Outerplanar Graphs into l1
inferred← citeshttps://doi.org/10.1142/s0129054115500227openalex-snapshot
A Note on the Minimum H-Subgraph Edge Deletion
inferred← citeshttps://doi.org/10.1145/174644.174650openalex-snapshot
Approximation algorithms for NP-complete problems on planar graphs
inferred← citeshttps://doi.org/10.1201/b15385-11openalex-snapshot
- Spine and Radial Drawings
inferred← citeshttps://doi.org/10.1201/b15385-4openalex-snapshot
- Planarity Testing and Embedding
inferred← citeshttps://doi.org/10.17877/de290r-367openalex-snapshot
Computing crossing numbers
inferred← citeshttps://doi.org/10.2197/ipsjjip.28.876openalex-snapshot
Randomized Reductions and the Topology of Conjectured Classes of Uniquely Hamiltonian Graphs
inferred← citeshttps://doi.org/10.22215/etd/2007-06323openalex-snapshot
On improving FPT K-VERTEX COVER with applications to some combinatorial problems
inferred← citeshttps://doi.org/10.23638/dmtcs-19-3-8openalex-snapshot
Circular Separation Dimension of a Subclass of Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0602057openalex-snapshot
Plane Decompositions as Tools for Approximation
inferred← citeshttps://doi.org/10.5555/644108.644197openalex-snapshot
Embedding k-outerplanar graphs into e1
inferred← citeshttps://doi.org/10.7151/dmgt.2060openalex-snapshot
An efficient polynomial time approximation scheme for the vertex cover P_ 3 problem on planar graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00114openalex-snapshot
Computing Radial Drawings on the Minimum Number of Circles
inferred← citeshttps://doi.org/10.7155/jgaa.00631openalex-snapshot
Inserting Multiple Edges into a Planar Graph
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.