On the public citation graph

Better Approximation Schemes for Disk Graphs

0 signed · 37 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230250205openalex-snapshot
Simple heuristics for unit disk graphs
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/11561071_41openalex-snapshot
Efficient Approximation Schemes for Geometric Problems?
inferredcites →https://doi.org/10.1007/11604686_31openalex-snapshot
Approximation Algorithms for Unit Disk Graphs
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-540-46515-7_16openalex-snapshot
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs
inferredcites →https://doi.org/10.1016/0012-365x(90)90358-oopenalex-snapshot
Unit disk graphs
inferredcites →https://doi.org/10.1016/0095-8956(83)90079-5openalex-snapshot
Graph minors. I. Excluding a forest
inferredcites →https://doi.org/10.1016/j.ipl.2003.09.019openalex-snapshot
A note on maximum independent sets in rectangle intersection graphs
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/s0196-6774(02)00294-8openalex-snapshot
Polynomial-time approximation schemes for packing and piercing fat objects
inferredcites →https://doi.org/10.1137/s0097539702402676openalex-snapshot
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
inferredcites →https://doi.org/10.1137/s0895480194275825openalex-snapshot
Algorithms for Vertex Partitioning Problems on Partial k-Trees
inferredcites →https://doi.org/10.1145/174644.174650openalex-snapshot
Approximation algorithms for NP-complete problems on planar 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/256292.256294openalex-snapshot
Separators for sphere-packings and nearest neighbor graphs
inferredcites →https://doi.org/10.3233/fi-1995-2241openalex-snapshot
A DETERMINISTIC LINEAR TIME ALGORITHM FOR GEOMETRIC SEPARATORS AND ITS APPLICATIONS
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/978-1-4419-7997-1_48openalex-snapshot
Greedy Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_64openalex-snapshot
Domination in Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-03417-6_15openalex-snapshot
Minimum Interference Planar Geometric Topology in Wireless Sensor Networks
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-22300-6_31openalex-snapshot
Tracking Moving Objects with Few Handovers
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_8openalex-snapshot
Optimization Problems in Dotted Interval Graphs
inferred← citeshttps://doi.org/10.1007/s00224-011-9366-zopenalex-snapshot
Structure of Polynomial-Time Approximation
inferred← citeshttps://doi.org/10.1007/s10878-024-01253-4openalex-snapshot
An improved PTAS for covering targets with mobile sensors
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.dam.2014.04.014openalex-snapshot
Optimization problems in dotted interval graphs
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.1109/focs.2018.00060openalex-snapshot
EPTAS for Max Clique on Disks and Unit Balls
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch84openalex-snapshot
A Framework for Approximation Schemes on Disk Graphs
inferred← citeshttps://doi.org/10.1145/1530748.1530761openalex-snapshot
Multiflows in multihop wireless networks
inferred← citeshttps://doi.org/10.1145/2632951.2632989openalex-snapshot
Capacity maximization in wireless MIMO networks with receiver-side interference suppression
inferred← citeshttps://doi.org/10.1145/3433160openalex-snapshot
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
inferred← citeshttps://doi.org/10.1145/3774904.3792370openalex-snapshot
Online Advertising with Spatial Interactions
inferred← citeshttps://doi.org/10.70675/d8d31cecza123z48adz86b7ze8a30aaa7c58openalex-snapshot
Quantum many-body dynamics for combinatorial optimisation and machine learning
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.