On the public citation graph
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
0 signed · 53 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.1002/(sici)1097-0037(199808)32:1<13::aid-net2>3.0.co;2-mopenalex-snapshot
On the chromatic number of disk graphs
inferredcites →https://doi.org/10.1002/jgt.3190110403openalex-snapshot
The number of maximal independent sets in connected graphs
inferredcites →https://doi.org/10.1006/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1006/jctb.1994.1071openalex-snapshot
Intersection Graphs of Segments
inferredcites →https://doi.org/10.1007/11671411_23openalex-snapshot
A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs
inferredcites →https://doi.org/10.1007/11785293_30openalex-snapshot
Better Approximation Schemes for Disk Graphs
inferredcites →https://doi.org/10.1007/3-540-33700-8_30openalex-snapshot
On Six Problems Posed by Jarik Nešetřil
inferredcites →https://doi.org/10.1007/3-540-62495-3_53openalex-snapshot
Intersection graphs of noncrossing arc-connected sets in the plane
inferredcites →https://doi.org/10.1007/978-3-540-24592-6_23openalex-snapshot
Disk Graphs: A Short Survey
inferredcites →https://doi.org/10.1007/978-3-540-30559-0_18openalex-snapshot
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
inferredcites →https://doi.org/10.1007/978-3-642-15775-2_21openalex-snapshot
Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier
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/bf02523189openalex-snapshot
Finding and counting given length cycles
inferredcites →https://doi.org/10.1007/s00224-005-1141-6openalex-snapshot
The Clique Problem in Intersection Graphs of Ellipses and Triangles
inferredcites →https://doi.org/10.1007/s00453-014-9889-1openalex-snapshot
On Subexponential and FPT-Time Inapproximability
inferredcites →https://doi.org/10.1007/s00454-013-9538-5openalex-snapshot
The Clique Problem in Ray Intersection Graphs
inferredcites →https://doi.org/10.1007/s00454-018-9968-1openalex-snapshot
On Forbidden Induced Subgraphs for Unit Disk Graphs
inferredcites →https://doi.org/10.1016/0012-365x(92)90688-copenalex-snapshot
The max clique problem in classes of string-graphs
inferredcites →https://doi.org/10.1016/0012-365x(95)00321-mopenalex-snapshot
Graphs without short odd cycles are nearly bipartite
inferredcites →https://doi.org/10.1016/j.dam.2018.03.046openalex-snapshot
Homothetic polygons and beyond: Maximal cliques in intersection graphs
inferredcites →https://doi.org/10.1016/j.ipl.2007.08.005openalex-snapshot
Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
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.tcs.2005.11.029openalex-snapshot
Complexity of approximating bounded variants of optimization problems
inferredcites →https://doi.org/10.1016/s0196-6774(02)00294-8openalex-snapshot
Polynomial-time approximation schemes for packing and piercing fat objects
inferredcites →https://doi.org/10.1016/s0196-6774(03)00048-8openalex-snapshot
Robust algorithms for restricted domains
inferredcites →https://doi.org/10.1016/s0925-7721(97)00012-6openalex-snapshot
Geometric representations of graphs
inferredcites →https://doi.org/10.1090/conm/453/08794openalex-snapshot
State of the union (of geometric objects)
inferredcites →https://doi.org/10.1109/focs.2008.60openalex-snapshot
Two Query PCP with Sub-Constant Error
inferredcites →https://doi.org/10.1109/focs.2018.00060openalex-snapshot
EPTAS for Max Clique on Disks and Unit Balls
inferredcites →https://doi.org/10.1137/1.9781611974782.148openalex-snapshot
On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
inferredcites →https://doi.org/10.1137/s0097539702402676openalex-snapshot
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
inferredcites →https://doi.org/10.1145/2529989openalex-snapshot
Linear-Time Approximation for Maximum Weight Matching
inferredcites →https://doi.org/10.1145/3055399.3055473openalex-snapshot
A strongly polynomial algorithm for bimodular integer linear programming
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.20382/jocg.v9i2a4openalex-snapshot
Fine-Grained Complexity of Coloring Unit Disks and Balls
inferredcites →https://doi.org/10.4230/lipics.isaac.2018.50openalex-snapshot
Stabbing pairwise intersecting disks by five points
inferredcites →https://doi.org/10.4230/lipics.socg.2018.12openalex-snapshot
QPTAS and Subexponential Algorithm for Maximum Clique on Disk 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.22932openalex-snapshot
Induced odd cycle packing number, independent sets, and chromatic number
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-031-38906-1_3openalex-snapshot
Faster Algorithms for Cycle Hitting Problems on Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_19openalex-snapshot
Recognition of Unit Segment and Polyline Graphs is $$\exists \mathbb {R} $$-Complete
inferred← citeshttps://doi.org/10.1007/s00454-026-00837-7openalex-snapshot
Finding a Maximum Clique in a Disk Graph
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100796openalex-snapshot
Parameterized algorithms on geometric intersection graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2024.03.003openalex-snapshot
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
inferred← citeshttps://doi.org/10.1103/8gjv-ll1fopenalex-snapshot
Identifying hard native instances for the maximum-independent-set problem on neutral-atom quantum processors
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch84openalex-snapshot
A Framework for Approximation Schemes on Disk Graphs
inferred← citeshttps://doi.org/10.1137/21m1447714openalex-snapshot
Faster 3-Coloring of Small-Diameter Graphs
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.1287/moor.2023.0242openalex-snapshot
Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
inferred← citeshttps://doi.org/10.1587/bplus.19.298openalex-snapshot
Intersection Graphs of Disks: Mathematical Properties and Algorithms
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.