On the public citation graph
Reduced constants for simple cycle graph separation
0 signed · 57 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.1016/0196-6774(84)90019-1openalex-snapshot
A separator theorem for graphs of bounded genus
inferredcites →https://doi.org/10.1109/sfcs.1991.185417openalex-snapshot
A unified geometric approach to graph separators
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0603022openalex-snapshot
On the Problem of Partitioning Planar Graphs
inferredcites →https://doi.org/10.1137/s0895480194272183openalex-snapshot
Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
inferredcites →https://doi.org/10.1145/100216.100255openalex-snapshot
Separators in two and three dimensions
inferredcites →https://doi.org/10.1145/800057.808703openalex-snapshot
Finding small simple cycle separators for 2-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.1002/jgt.20121openalex-snapshot
New upper bounds on the decomposability of planar graphs
inferred← citeshttps://doi.org/10.1007/11561071_56openalex-snapshot
Engineering Planar Separator Algorithms
inferred← citeshttps://doi.org/10.1007/11602613_99openalex-snapshot
Multi-directional Width-Bounded Geometric Separator and Protein Folding
inferred← citeshttps://doi.org/10.1007/11672142_22openalex-snapshot
Theory and Application of Width Bounded Geometric Separator
inferred← citeshttps://doi.org/10.1007/11775096_15openalex-snapshot
Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem
inferred← citeshttps://doi.org/10.1007/11917496_5openalex-snapshot
A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators
inferred← citeshttps://doi.org/10.1007/3-540-36379-3_17openalex-snapshot
Graph Separator Algorithms: A Refined Analysis
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_35openalex-snapshot
Graph Separators: A Parameterized View
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_22openalex-snapshot
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_11openalex-snapshot
Weighted graph separators and their applications
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_3openalex-snapshot
Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_32openalex-snapshot
How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths
inferred← citeshttps://doi.org/10.1007/978-3-031-20796-9_14openalex-snapshot
Bounds for the Oriented Diameter of Planar Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_24openalex-snapshot
Counting Cycles on Planar Graphs in Subexponential Time
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_6openalex-snapshot
A Simple and Fast Approach for Solving Problems on Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-14553-7_12openalex-snapshot
Improved Sublinear Time Algorithm for Width-Bounded Separators
inferred← citeshttps://doi.org/10.1007/978-3-642-24983-9_9openalex-snapshot
Edge Clique Partition of K 4-Free and Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_33openalex-snapshot
Drawing Planar Graphs with Reduced Height
inferred← citeshttps://doi.org/10.1007/s00453-022-01041-8openalex-snapshot
Clique-Based Separators for Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/s00453-023-01182-4openalex-snapshot
Counting Cycles on Planar Graphs in Subexponential Time
inferred← citeshttps://doi.org/10.1007/s00453-025-01337-5openalex-snapshot
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $$\mathbb {R}^2$$
inferred← citeshttps://doi.org/10.1007/s004530010031openalex-snapshot
Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications
inferred← citeshttps://doi.org/10.1007/s00454-023-00564-3openalex-snapshot
Maximum Matchings in Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/s10878-007-9092-2openalex-snapshot
Sublinear time width-bounded separators and their application to the protein side-chain packing problem
inferred← citeshttps://doi.org/10.1007/s10878-024-01177-zopenalex-snapshot
On the oriented diameter of planar triangulations
inferred← citeshttps://doi.org/10.1007/s10898-011-9783-1openalex-snapshot
Tabu search for the BWC problem
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.12.006openalex-snapshot
Counting triangulations and other crossing-free structures approximately
inferred← citeshttps://doi.org/10.1016/j.disc.2009.03.027openalex-snapshot
Anticoloring and separation of graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2008.02.001openalex-snapshot
Anticoloring of a family of grid graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.02.032openalex-snapshot
On classes of graphs with strongly sublinear separators
inferred← citeshttps://doi.org/10.1016/j.jalgor.2003.10.001openalex-snapshot
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.05.003openalex-snapshot
Theory and application of width bounded geometric separators
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00072-2openalex-snapshot
Graph separators: a parameterized view
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferred← citeshttps://doi.org/10.1103/physrevlett.131.180601openalex-snapshot
Simulating Quantum Circuits Using Efficient Tensor Network Contraction Algorithms with Subexponential Upper Bound
inferred← citeshttps://doi.org/10.1137/s0097539704440727openalex-snapshot
Geometric Separators and Their Applications to Protein Folding in the HP-Model
inferred← citeshttps://doi.org/10.1142/s0218195908002696openalex-snapshot
MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING
inferred← citeshttps://doi.org/10.1145/1146381.1146411openalex-snapshot
Object location using path separators
inferred← citeshttps://doi.org/10.1145/1498698.1571635openalex-snapshot
Engineering planar separator algorithms
inferred← citeshttps://doi.org/10.1145/1597036.1597043openalex-snapshot
A linear-time algorithm to find a separator in a graph excluding a minor
inferred← citeshttps://doi.org/10.1145/237218.237404openalex-snapshot
Disk packings and planar separators
inferred← citeshttps://doi.org/10.1145/2488608.2488672openalex-snapshot
Structured recursive separator decompositions for planar graphs in linear time
inferred← citeshttps://doi.org/10.1145/2957318openalex-snapshot
Short and Simple Cycle Separators in Planar Graphs
inferred← citeshttps://doi.org/10.18419/opus-2455openalex-snapshot
Hierarchische Graphen zur Wegesuche
inferred← citeshttps://doi.org/10.26493/1855-3974.788.89aopenalex-snapshot
Search for the end of a path in the d-dimensional grid and in other graphs
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.36openalex-snapshot
Distributed Vertex Cover Reconfiguration
inferred← citeshttps://doi.org/10.46298/dmtcs.3388openalex-snapshot
Two-anticoloring of planar and related graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1404.0261openalex-snapshot
Counting Triangulations and other Crossing-Free Structures Approximately
inferred← citeshttps://doi.org/10.48550/arxiv.1406.3860openalex-snapshot
The Minimum Bends in a Polyline Drawing with Fixed Vertex Locations
inferred← citeshttps://doi.org/10.5445/ir/1000002042openalex-snapshot
Timetable information and shortest paths
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.