On the public citation graph

Partitioning Planar Graphs

https://doi.org/10.1137/0221016
0 signed · 46 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/j.1538-7305.1970.tb01770.xopenalex-snapshot
An Efficient Heuristic Procedure for Partitioning Graphs
inferredcites →https://doi.org/10.1007/bf01840379openalex-snapshot
On the complexity of embedding planar graphs to minimize certain distance measures
inferredcites →https://doi.org/10.1007/bf02579448openalex-snapshot
Graph bisection algorithms with good average case behavior
inferredcites →https://doi.org/10.1016/0022-0000(84)90071-0openalex-snapshot
A framework for solving VLSI graph layout problems
inferredcites →https://doi.org/10.1016/0898-1221(88)90210-6openalex-snapshot
A parallel algorithm for bisection width in trees
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
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.1145/321850.321852openalex-snapshot
Efficient Planarity Testing

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.1149openalex-snapshot
Approximating Layout Problems on Random Geometric Graphs
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_186openalex-snapshot
Graph Partitioning
inferred← citeshttps://doi.org/10.1007/978-3-030-10564-8_2openalex-snapshot
Parameterized Computational Geometry via Decomposition Theorems
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_2openalex-snapshot
Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-45043-3_8openalex-snapshot
On the Parameterized Complexity of Computing Graph Bisections
inferred← citeshttps://doi.org/10.1007/s00224-014-9557-5openalex-snapshot
On the Parameterized Complexity of Computing Balanced Partitions in Graphs
inferred← citeshttps://doi.org/10.1007/s002360050049openalex-snapshot
Parallel Approximation Schemes for problems on planar graphs
inferred← citeshttps://doi.org/10.1007/s00453-021-00806-xopenalex-snapshot
A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90140-qopenalex-snapshot
Finding good approximate vertex and edge partitions is NP-hard
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100796openalex-snapshot
Parameterized algorithms on geometric intersection graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.12.001openalex-snapshot
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.02.002openalex-snapshot
Bisection of bounded treewidth graphs by convolutions
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00226-6openalex-snapshot
Generating irregular partitionable data structures
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00379-8openalex-snapshot
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601837openalex-snapshot
Multilevel graph partitioning: an evolutionary approach
inferred← citeshttps://doi.org/10.1093/comjnl/bxm033openalex-snapshot
The Bidimensionality Theory and Its Algorithmic Applications
inferred← citeshttps://doi.org/10.1109/12.508322openalex-snapshot
Genetic algorithm and graph partitioning
inferred← citeshttps://doi.org/10.1109/12.580427openalex-snapshot
Optimal partitioning of heterogeneous traffic sources in mobile communications networks
inferred← citeshttps://doi.org/10.1109/12.762522openalex-snapshot
Greedy, prohibition, and reactive heuristics for graph partitioning
inferred← citeshttps://doi.org/10.1109/cahpc.2018.8645916openalex-snapshot
A Scalability and Sensitivity Study of Parallel Geometric Algorithms for Graph Partitioning
inferred← citeshttps://doi.org/10.1109/icc.1995.524516openalex-snapshot
Heuristics for multiway partitioning in hexagonal cellular systems
inferred← citeshttps://doi.org/10.1109/mpcs.1994.367082openalex-snapshot
Divide-and-conquer minimal-cut bisectioning of task graphs
inferred← citeshttps://doi.org/10.1137/1.9781611977073.82openalex-snapshot
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H -Minor-Free Graphs
inferred← citeshttps://doi.org/10.1137/140988553openalex-snapshot
Minimum Bisection Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1142/9789812777638_0014openalex-snapshot
Subgraph Isomorphism in Planar Graphs and Related Problems
inferred← citeshttps://doi.org/10.1145/1457255.1457258openalex-snapshot
Throughput-driven synthesis of embedded software for pipelined execution on multicore architectures
inferred← citeshttps://doi.org/10.1145/167088.167284openalex-snapshot
Finding minimum-quotient cuts in planar graphs
inferred← citeshttps://doi.org/10.1145/174644.174650openalex-snapshot
Approximation algorithms for NP-complete problems on planar graphs
inferred← citeshttps://doi.org/10.1145/2591796.2591852openalex-snapshot
Minimum bisection is fixed parameter tractable
inferred← citeshttps://doi.org/10.1145/3648594openalex-snapshot
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity
inferred← citeshttps://doi.org/10.1145/3656042openalex-snapshot
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs
inferred← citeshttps://doi.org/10.1145/568522.568523openalex-snapshot
A survey of graph layout problems
inferred← citeshttps://doi.org/10.1360/02yf9001openalex-snapshot
Neural networks and graph theory
inferred← citeshttps://doi.org/10.48550/arxiv.1311.2563openalex-snapshot
Minimum Bisection is fixed parameter tractable
inferred← citeshttps://doi.org/10.5555/313651.313830openalex-snapshot
Subgraph isomorphism in planar graphs and related problems
inferred← citeshttps://doi.org/10.5555/3310435.3310499openalex-snapshot
Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity
inferred← citeshttps://doi.org/10.7155/jgaa.00014openalex-snapshot
Subgraph Isomorphism in Planar Graphs and Related Problems
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.