On the public citation graph
Efficient Approximation Schemes for Geometric Problems?
0 signed · 74 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.1016/0020-0190(88)90174-3openalex-snapshot
A study on two geometric location problems
inferredcites →https://doi.org/10.1016/j.ipl.2004.10.003openalex-snapshot
Refined memorization for vertex cover
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/s0020-0190(97)00164-6openalex-snapshot
On the efficiency of polynomial time approximation schemes
inferredcites →https://doi.org/10.1016/s0925-7721(98)00028-5openalex-snapshot
Label placement by maximum independent set in rectangles
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1109/ccc.2003.1214417openalex-snapshot
Parameterized complexity for the skeptic
inferredcites →https://doi.org/10.1109/sfcs.1996.548458openalex-snapshot
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
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/290179.290180openalex-snapshot
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
inferredcites →https://doi.org/10.5555/365411.365562openalex-snapshot
Polynomial-time approximation schemes for geometric graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11785293_30openalex-snapshot
Better Approximation Schemes for Disk Graphs
inferred← citeshttps://doi.org/10.1007/11847250_14openalex-snapshot
Parameterized Complexity of Independence and Domination on Geometric Graphs
inferred← citeshttps://doi.org/10.1007/11847250_16openalex-snapshot
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_19openalex-snapshot
Complexity Issues on PTAS
inferred← citeshttps://doi.org/10.1007/978-1-4614-1701-9openalex-snapshot
Design and Analysis of Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_19-1openalex-snapshot
Complexity Issues on PTAS
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_14openalex-snapshot
Maximum Bipartite Subgraph of Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-59267-7_29openalex-snapshot
Dispersing and Grouping Points on Segments in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_15openalex-snapshot
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_23openalex-snapshot
Computing List Homomorphisms in Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-18263-6_12openalex-snapshot
Linear-Time Approximation Algorithms for Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_43openalex-snapshot
Unique Covering Problems with Geometric Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-73013-4_33openalex-snapshot
Stabbing Line Segments with Disks: Complexity and Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_38openalex-snapshot
Shifting Strategy for Geometric Graphs without Geometry
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_30openalex-snapshot
Polynomial Kernels for Hard Problems on Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_22openalex-snapshot
Minimum Vertex Cover in Rectangle Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-28050-4_14openalex-snapshot
Safe Approximation and Its Relation to Kernelization
inferred← citeshttps://doi.org/10.1007/978-3-642-31265-6_34openalex-snapshot
On Approximating String Selection Problems with Outliers
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_54openalex-snapshot
Parameterized Complexity of Induced H-Matching on Claw-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_39openalex-snapshot
Trajectory-Based Dynamic Map Labeling
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_21openalex-snapshot
Consensus Patterns (Probably) Has no EPTAS
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_12openalex-snapshot
Token Jumping in Minor-Closed Classes
inferred← citeshttps://doi.org/10.1007/s00224-021-10050-zopenalex-snapshot
Exact Multi-Covering Problems with Geometric Sets
inferred← citeshttps://doi.org/10.1007/s00453-014-9877-5openalex-snapshot
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs
inferred← citeshttps://doi.org/10.1007/s00453-016-0216-xopenalex-snapshot
Multivariate Complexity Analysis of Geometric Red Blue Set Cover
inferred← citeshttps://doi.org/10.1007/s00453-019-00600-wopenalex-snapshot
Parameterized Complexity of Geometric Covering Problems Having Conflicts
inferred← citeshttps://doi.org/10.1007/s00453-020-00683-wopenalex-snapshot
The Parameterized Hardness of the k-Center Problem in Transportation Networks
inferred← citeshttps://doi.org/10.1007/s00453-020-00694-7openalex-snapshot
A Unified Model and Algorithms for Temporal Map Labeling
inferred← citeshttps://doi.org/10.1007/s00454-018-00054-xopenalex-snapshot
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/s00454-021-00282-8openalex-snapshot
Fractal Dimension and Lower Bounds for Geometric Problems
inferred← citeshttps://doi.org/10.1007/s00454-021-00343-yopenalex-snapshot
A Tight Analysis of Geometric Local Search
inferred← citeshttps://doi.org/10.1007/s00454-025-00793-8openalex-snapshot
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time
inferred← citeshttps://doi.org/10.1007/s10878-010-9319-5openalex-snapshot
Shifting strategy for geometric graphs without geometry
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.03.002openalex-snapshot
Minimum vertex cover in rectangle graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.06.005openalex-snapshot
Fixed-parameter tractability and lower bounds for stabbing problems
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100796openalex-snapshot
Parameterized algorithms on geometric intersection graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.11.002openalex-snapshot
Structural parameters, tight bounds, and approximation for ( k , r ) -center
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.08.003openalex-snapshot
On the parameterized complexity of d-dimensional point set pattern matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.065openalex-snapshot
On the parameterized complexity of multiple-interval graph problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.05.037openalex-snapshot
On approximating string selection problems with outliers
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.08.008openalex-snapshot
On some matching problems under the color-spanning model
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.08.011openalex-snapshot
Dispersing and grouping points on planar segments
inferred← citeshttps://doi.org/10.1093/comjnl/bxm048openalex-snapshot
Parameterized Complexity and Approximation Algorithms
inferred← citeshttps://doi.org/10.1093/comjnl/bxm053openalex-snapshot
Parameterized Complexity of Geometric Problems
inferred← citeshttps://doi.org/10.1109/focs.2007.26openalex-snapshot
On the Optimality of Planar and Geometric Approximation Schemes
inferred← citeshttps://doi.org/10.1109/focs.2007.50openalex-snapshot
Space-Efficient Identity Based EncryptionWithout Pairings
inferred← citeshttps://doi.org/10.1134/s0081543818090158openalex-snapshot
Computational Complexity for the Problem of Optimal Intersection of Straight Line Segments by Disks
inferred← citeshttps://doi.org/10.1137/1.9781611976465.118openalex-snapshot
Twin-width II: small classes
inferred← citeshttps://doi.org/10.1137/s0097539704446591openalex-snapshot
Computing Maximally Separated Sets in the Plane
inferred← citeshttps://doi.org/10.1142/s021819592350005xopenalex-snapshot
Maximum Bipartite Subgraphs of Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1145/3483425openalex-snapshot
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
inferred← citeshttps://doi.org/10.1145/3744252openalex-snapshot
Hybrid k-Clustering: Blending k-Median and k-Center
inferred← citeshttps://doi.org/10.1145/3774904.3792370openalex-snapshot
Online Advertising with Spatial Interactions
inferred← citeshttps://doi.org/10.1145/3798129.3800753openalex-snapshot
Fine-Grained Complexity of Continuous Euclidean k-Center
inferred← citeshttps://doi.org/10.1145/3798129.3800815openalex-snapshot
Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1145/3820880openalex-snapshot
A (2 + ε )-Approximation Algorithm for Maximum Independent Set of Rectangles
inferred← citeshttps://doi.org/10.25904/1912/1694openalex-snapshot
The NP-Hardness of Covering Points with Lines, Paths and Tours and their Tractability with FPT-Algorithms
inferred← citeshttps://doi.org/10.3390/a13060146openalex-snapshot
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1111.0376openalex-snapshot
Outlier Detection for DNA Fragment Assembly
inferred← citeshttps://doi.org/10.70675/5040d861zebb7z424bz8a75z37fe027a71beopenalex-snapshot
Structurally Parameterized Tight Bounds and Approximation for Generalizations of Independence and Domination
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.