On the public citation graph

Edge separators for planar graphs and their applications

https://doi.org/10.1007/bfb0017151
0 signed · 33 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.1007/3-540-16766-8_20openalex-snapshot
Linear and book embeddings of graphs
inferredcites →https://doi.org/10.1007/bfb0028814openalex-snapshot
The complexity of embedding graphs into binary trees
inferredcites →https://doi.org/10.1016/0020-0190(79)90075-9openalex-snapshot
Linear algorithms to recognize outerplanar and maximal outerplanar graphs
inferredcites →https://doi.org/10.1016/0020-0190(87)90206-7openalex-snapshot
An application of the planar separator theorem to counting problems
inferredcites →https://doi.org/10.1016/0022-0000(86)90030-9openalex-snapshot
Finding small simple cycle separators for 2-connected planar graphs
inferredcites →https://doi.org/10.1016/0196-6774(84)90019-1openalex-snapshot
A separator theorem for graphs of bounded genus
inferredcites →https://doi.org/10.1016/0196-6774(86)90029-5openalex-snapshot
Finding short cycles in planar graphs using separators
inferredcites →https://doi.org/10.1016/0196-6774(87)90051-4openalex-snapshot
Improved constants for some separator theorems
inferredcites →https://doi.org/10.1016/0743-7315(87)90018-9openalex-snapshot
On mapping parallel algorithms into parallel architectures
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1980.13openalex-snapshot
Area-efficient graph layouts
inferredcites →https://doi.org/10.1109/sfcs.1987.26openalex-snapshot
Finding near optimal separators in planar graphs
inferredcites →https://doi.org/10.1109/sfcs.1987.3openalex-snapshot
A parallel algorithm for finding a separator in planar graphs
inferredcites →https://doi.org/10.1109/tc.1981.6312176openalex-snapshot
Universality considerations in VLSI circuits
inferredcites →https://doi.org/10.1109/tc.1985.5009416openalex-snapshot
A Hypergraph Model for Fault-Tolerant VLSI Processor Arrays
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0209046openalex-snapshot
Applications of a Planar Separator Theorem
inferredcites →https://doi.org/10.1137/0211018openalex-snapshot
Graphs That are Almost Binary Trees
inferredcites →https://doi.org/10.1137/0603022openalex-snapshot
On the Problem of Partitioning Planar Graphs
inferredcites →https://doi.org/10.1137/0608018openalex-snapshot
Embedding Outerplanar Graphs in Small Books
inferredcites →https://doi.org/10.1137/0716027openalex-snapshot
Generalized Nested Dissection
inferredcites →https://doi.org/10.1145/359361.359447openalex-snapshot
Preserving average proximity in arrays

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-52921-7_83openalex-snapshot
Planar separators and the Euclidean norm
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_15openalex-snapshot
Edge separators for graphs of bounded genus with applications
inferred← citeshttps://doi.org/10.1007/3-540-60618-1_66openalex-snapshot
Planarization of graphs embedded on surfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_17openalex-snapshot
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-34191-5_19openalex-snapshot
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area
inferred← citeshttps://doi.org/10.1007/bf02086610openalex-snapshot
Applications of the crossing number
inferred← citeshttps://doi.org/10.1007/s10107-020-01614-xopenalex-snapshot
Electrical flows over spanning trees
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90031-nopenalex-snapshot
Edge separators for graphs of bounded genus with applications
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50015-1openalex-snapshot
Graph Algorithms
inferred← citeshttps://doi.org/10.1093/comjnl/bxaf082openalex-snapshot
Exponential time complexity for contracting tensor networks
inferred← citeshttps://doi.org/10.1145/177424.177629openalex-snapshot
Applications of the crossing number
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.