On the public citation graph
Theory and Application of Width Bounded Geometric Separator
0 signed · 52 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.1006/jagm.1997.0903openalex-snapshot
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
inferredcites →https://doi.org/10.1007/11775096_15openalex-snapshot
Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem
inferredcites →https://doi.org/10.1007/3-540-44679-6_35openalex-snapshot
Graph Separators: A Parameterized View
inferredcites →https://doi.org/10.1007/3-540-48224-5_22openalex-snapshot
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_54openalex-snapshot
A $2^{O(n^{1-{1\over d}}\log n)}$ Time Algorithm for d-Dimensional Protein Folding in the HP-Model
inferredcites →https://doi.org/10.1007/bf02573984openalex-snapshot
A new bound on the local density of sphere packings
inferredcites →https://doi.org/10.1007/s002360050082openalex-snapshot
Reduced constants for simple cycle graph separation
inferredcites →https://doi.org/10.1007/s00453-001-0110-yopenalex-snapshot
Exact and Approximation Algorithms for Clustering
inferredcites →https://doi.org/10.1016/0020-0190(81)90111-3openalex-snapshot
Optimal packing and covering in the plane are NP-complete
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/0020-0190(88)90174-3openalex-snapshot
A study on two geometric location problems
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/0196-6774(84)90019-1openalex-snapshot
A separator theorem for graphs of bounded genus
inferredcites →https://doi.org/10.1016/j.jalgor.2003.10.001openalex-snapshot
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
inferredcites →https://doi.org/10.1016/s0022-0000(03)00072-2openalex-snapshot
Graph separators: a parameterized view
inferredcites →https://doi.org/10.1021/ma00200a030openalex-snapshot
A lattice statistical mechanics model of the conformational and sequence spaces of proteins
inferredcites →https://doi.org/10.1049/ip-i-1.1981.0010openalex-snapshot
Introduction to V.L.S.I. Systems
inferredcites →https://doi.org/10.1109/jsac.1984.1146097openalex-snapshot
C 900 - An Advanced Mobile Radio Telephone System with Optimum Frequency Utilization
inferredcites →https://doi.org/10.1109/proc.1980.11899openalex-snapshot
Frequency assignment: Theory and applications
inferredcites →https://doi.org/10.1109/sfcs.1991.185417openalex-snapshot
A unified geometric approach to graph separators
inferredcites →https://doi.org/10.1109/sfcs.1998.743449openalex-snapshot
Geometric separator theorems and applications
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/0213014openalex-snapshot
On the Complexity of Some Common Geometric Location Problems
inferredcites →https://doi.org/10.1137/0603022openalex-snapshot
On the Problem of Partitioning Planar Graphs
inferredcites →https://doi.org/10.1145/100216.100254openalex-snapshot
A separator theorem for graphs with an excluded minor and its applications
inferredcites →https://doi.org/10.1145/100216.100255openalex-snapshot
Separators in two and three dimensions
inferredcites →https://doi.org/10.1145/237218.237404openalex-snapshot
Disk packings and planar separators
inferredcites →https://doi.org/10.1145/2455.214106openalex-snapshot
Approximation schemes for covering and packing problems in image processing and VLSI
inferredcites →https://doi.org/10.1145/62212.62255openalex-snapshot
Optimal algorithms for approximate clustering
inferredcites →https://doi.org/10.48550/arxiv.math/0305012openalex-snapshot
A computer verification of the Kepler conjecture
inferredcites →https://doi.org/10.5555/314464.314625openalex-snapshot
Shallow excluded minors and improved graph decompositions
inferredcites →https://doi.org/10.5555/365411.365562openalex-snapshot
Polynomial-time approximation schemes for geometric graphs
inferredcites →https://doi.org/10.5555/982792.982865openalex-snapshot
Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11533719_50openalex-snapshot
A PTAS for a Disc Covering Problem Using Width-Bounded Separators
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/978-3-540-73951-7_28openalex-snapshot
Spanners for Geometric Intersection 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-22685-4_12openalex-snapshot
Strong I/O Lower Bounds for Binomial and FFT Computation Graphs
inferred← citeshttps://doi.org/10.1007/s00224-011-9353-4openalex-snapshot
An Improved Approximation Algorithm for the Most Points Covering Problem
inferred← citeshttps://doi.org/10.1007/s00224-018-9870-5openalex-snapshot
The Most Points Connected-Covering Problem with Two Disks
inferred← citeshttps://doi.org/10.1007/s10878-006-7132-yopenalex-snapshot
A PTAS for a disc covering problem using width-bounded separators
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.1016/j.tcs.2014.01.026openalex-snapshot
A PTAS for the cardinality constrained covering with unit balls
inferred← citeshttps://doi.org/10.1145/1146381.1146411openalex-snapshot
Object location using path separators
inferred← citeshttps://doi.org/10.20382/jocg.v3i1a3openalex-snapshot
Spanners for geometric intersection graphs with applications
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.