On the public citation graph
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
0 signed · 81 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/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1007/11561071_41openalex-snapshot
Efficient Approximation Schemes for Geometric Problems?
inferredcites →https://doi.org/10.1007/11847250_14openalex-snapshot
Parameterized Complexity of Independence and Domination on Geometric Graphs
inferredcites →https://doi.org/10.1007/978-3-319-21275-3_14openalex-snapshot
Lower Bounds Based on the Exponential-Time Hypothesis
inferredcites →https://doi.org/10.1007/978-3-540-24749-4_6openalex-snapshot
A Simple and Fast Approach for Solving Problems on Planar Graphs
inferredcites →https://doi.org/10.1007/978-3-540-31843-9_57openalex-snapshot
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth
inferredcites →https://doi.org/10.1007/978-3-642-23719-5_31openalex-snapshot
Fast Sub-exponential Algorithms and Compactness in Planar Graphs
inferredcites →https://doi.org/10.1007/978-3-642-31594-7_48openalex-snapshot
Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time
inferredcites →https://doi.org/10.1007/978-3-642-31594-7_57openalex-snapshot
A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals
inferredcites →https://doi.org/10.1007/978-3-662-48350-3_72openalex-snapshot
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
inferredcites →https://doi.org/10.1007/bf01185335openalex-snapshot
The slab dividing approach to solve the EuclideanP-Center problem
inferredcites →https://doi.org/10.1007/s00453-001-0110-yopenalex-snapshot
Exact and Approximation Algorithms for Clustering
inferredcites →https://doi.org/10.1007/s00453-009-9296-1openalex-snapshot
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions
inferredcites →https://doi.org/10.1007/s00453-012-9651-5openalex-snapshot
Recognizing d-Interval Graphs and d-Track Interval Graphs
inferredcites →https://doi.org/10.1007/s00453-013-9828-6openalex-snapshot
The Maximum Clique Problem in Multiple Interval Graphs
inferredcites →https://doi.org/10.1007/s00453-019-00670-wopenalex-snapshot
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs
inferredcites →https://doi.org/10.1007/s00493-008-2140-4openalex-snapshot
Linearity of grid minors in treewidth with applications through bidimensionality
inferredcites →https://doi.org/10.1016/j.comgeo.2012.04.001openalex-snapshot
Exact algorithms and APX-hardness results for geometric packing and covering problems
inferredcites →https://doi.org/10.1016/j.cosrev.2008.02.004openalex-snapshot
Subexponential parameterized algorithms
inferredcites →https://doi.org/10.1016/j.ic.2013.11.006openalex-snapshot
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
inferredcites →https://doi.org/10.1016/j.ipl.2011.05.016openalex-snapshot
Subexponential algorithms for partial cover problems
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/j.jcss.2006.04.007openalex-snapshot
Strong computational lower bounds via parameterized complexity
inferredcites →https://doi.org/10.1016/j.tcs.2008.09.065openalex-snapshot
On the parameterized complexity of multiple-interval graph problems
inferredcites →https://doi.org/10.1016/j.tcs.2012.01.025openalex-snapshot
Parameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy
inferredcites →https://doi.org/10.1093/comjnl/bxm033openalex-snapshot
The Bidimensionality Theory and Its Algorithmic Applications
inferredcites →https://doi.org/10.1109/focs.2007.26openalex-snapshot
On the Optimality of Planar and Geometric Approximation Schemes
inferredcites →https://doi.org/10.1109/focs.2007.50openalex-snapshot
Space-Efficient Identity Based EncryptionWithout Pairings
inferredcites →https://doi.org/10.1109/focs.2013.50openalex-snapshot
Approximation Schemes for Maximum Weight Independent Set of Rectangles
inferredcites →https://doi.org/10.1109/focs.2018.00050openalex-snapshot
An ETH-Tight Exact Algorithm for Euclidean TSP
inferredcites →https://doi.org/10.1109/focs.2018.00052openalex-snapshot
On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs
inferredcites →https://doi.org/10.1109/sfcs.1998.743449openalex-snapshot
Geometric separator theorems and applications
inferredcites →https://doi.org/10.1137/1.9781611973099.6openalex-snapshot
Kernelization of Packing Problems
inferredcites →https://doi.org/10.1137/1.9781611973402.129openalex-snapshot
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
inferredcites →https://doi.org/10.1137/1.9781611973402.131openalex-snapshot
A subexponential parameterized algorithm for Subset TSP on planar graphs
inferredcites →https://doi.org/10.1137/1.9781611973402.49openalex-snapshot
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices
inferredcites →https://doi.org/10.1137/14099317xopenalex-snapshot
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
inferredcites →https://doi.org/10.1137/s0097539702419649openalex-snapshot
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
inferredcites →https://doi.org/10.1137/s0097539704446591openalex-snapshot
Computing Maximally Separated Sets in the Plane
inferredcites →https://doi.org/10.1137/s0895480103433410openalex-snapshot
Bidimensional Parameters and Local Treewidth
inferredcites →https://doi.org/10.1145/1077464.1077468openalex-snapshot
Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
inferredcites →https://doi.org/10.1145/1101821.1101823openalex-snapshot
Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
inferredcites →https://doi.org/10.1145/1367064.1367070openalex-snapshot
Optimal branch-decomposition of planar graphs in O ( n 3 ) Time
inferredcites →https://doi.org/10.1145/1721837.1721856openalex-snapshot
Optimization problems in multiple-interval graphs
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/2582112.2582124openalex-snapshot
The limited blessing of low dimensionality
inferredcites →https://doi.org/10.1145/2582112.2582157openalex-snapshot
Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons
inferredcites →https://doi.org/10.1145/3239560openalex-snapshot
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
inferredcites →https://doi.org/10.1145/3326122openalex-snapshot
Approximation Schemes for Independent Set and Sparse Subsets of Polygons
inferredcites →https://doi.org/10.4230/lipics.esa.2019.26openalex-snapshot
On Geometric Set Cover for Orthants
inferredcites →https://doi.org/10.4230/lipics.esa.2019.33openalex-snapshot
Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2022.18openalex-snapshot
Half-Guarding Weakly-Visible Polygons and Terrains
inferredcites →https://doi.org/10.4230/lipics.stacs.2013.353openalex-snapshot
Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs
inferredcites →https://doi.org/10.48550/arxiv.0908.2369openalex-snapshot
Being Fat and Friendly is Not Enough
inferredcites →https://doi.org/10.48550/arxiv.1001.0821openalex-snapshot
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
inferredcites →https://doi.org/10.48550/arxiv.1307.1774openalex-snapshot
Approximation Schemes for Maximum Weight Independent Set of Rectangles
inferredcites →https://doi.org/10.5555/2634074.2634123openalex-snapshot
A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mgea.70041openalex-snapshot
GASCAP: Accelerating Adsorption Evaluation Using Graph Voronoi Diagram and Machine Learning Method
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_12openalex-snapshot
On the Minimum Consistent Subset Problem
inferred← citeshttps://doi.org/10.1007/s00453-018-0479-5openalex-snapshot
Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs
inferred← citeshttps://doi.org/10.1007/s00453-019-00580-xopenalex-snapshot
A Tight Lower Bound for Planar Steiner Orientation
inferred← citeshttps://doi.org/10.1007/s00453-022-01052-5openalex-snapshot
Parameterized Inapproximability of Independent Set in H-Free Graphs
inferred← citeshttps://doi.org/10.1007/s00454-025-00782-xopenalex-snapshot
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
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.2020.03.052openalex-snapshot
Structurally parameterized d -scattered set
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.013openalex-snapshot
Fixing improper colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.10.007openalex-snapshot
The complexity of Dominating Set in geometric intersection graphs
inferred← citeshttps://doi.org/10.1109/focs.2018.00052openalex-snapshot
On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs
inferred← citeshttps://doi.org/10.1145/3326122openalex-snapshot
Approximation Schemes for Independent Set and Sparse Subsets of Polygons
inferred← citeshttps://doi.org/10.1145/3580474openalex-snapshot
Almost Optimal Exact Distance Oracles for Planar Graphs
inferred← citeshttps://doi.org/10.1145/3798129.3800858openalex-snapshot
Pattern-Sparse Tree Decompositions in H-Minor-Free Graphs
inferred← citeshttps://doi.org/10.4230/lipics.esa.2019.33openalex-snapshot
Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1611.06501openalex-snapshot
Approximation and parameterized algorithms for geometric independent set with shrinking
inferred← citeshttps://doi.org/10.48550/arxiv.1705.01465openalex-snapshot
The Homogeneous Broadcast Problem in Narrow and Wide Strips
inferred← citeshttps://doi.org/10.48550/arxiv.1708.07381openalex-snapshot
A Fast Approximation Scheme for Low-Dimensional $k$-Means
inferred← citeshttps://doi.org/10.48550/arxiv.1811.12547openalex-snapshot
The inverse Voronoi problem in graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00621openalex-snapshot
Improved (In-)Approximability Bounds for d-Scattered Set
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.