On the public citation graph
Approximation Algorithms for Unit Disk Graphs
0 signed · 71 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/net.10097openalex-snapshot
A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks
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/11671411_23openalex-snapshot
A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs
inferredcites →https://doi.org/10.1007/3-540-36151-0_15openalex-snapshot
Separating Thickness from Geometric Thickness
inferredcites →https://doi.org/10.1007/3-540-45995-2openalex-snapshot
LATIN 2002: Theoretical Informatics
inferredcites →https://doi.org/10.1007/3-540-45995-2_52openalex-snapshot
Improved Tree Decomposition Based Algorithms for Domination-like Problems
inferredcites →https://doi.org/10.1007/978-1-4613-0219-3_4openalex-snapshot
A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks
inferredcites →https://doi.org/10.1007/978-3-540-27810-8_12openalex-snapshot
Independent Set of Intersection Graphs of Convex Objects in 2D
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/0095-8956(83)90079-5openalex-snapshot
Graph minors. I. Excluding a forest
inferredcites →https://doi.org/10.1016/j.dam.2004.07.005openalex-snapshot
The complexity of base station positioning in cellular networks
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.1016/s0898-1221(00)90183-4openalex-snapshot
Complexity and approximation: Combinatorial optimization problems and their approximability properties
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/s0925-7721(99)00005-xopenalex-snapshot
Point labeling with sliding labels
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1023/b:mone.0000013625.87793.13openalex-snapshot
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
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/290179.290180openalex-snapshot
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
inferredcites →https://doi.org/10.1145/513800.513820openalex-snapshot
Message-optimal connected dominating sets in mobile ad hoc networks
inferredcites →https://doi.org/10.1145/570810.570819openalex-snapshot
Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks
inferredcites →https://doi.org/10.5555/1070432.1070514openalex-snapshot
Bidimensionality: new connections between FPT algorithms and PTASs
inferredcites →https://doi.org/10.5555/365411.365562openalex-snapshot
Polynomial-time approximation schemes for geometric graphs
inferredcites →https://doi.org/10.5555/982792.982919openalex-snapshot
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
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.21898openalex-snapshot
Deploying Robots With Two Sensors in K1, 6‐Free Graphs
inferred← citeshttps://doi.org/10.1007/11537311_33openalex-snapshot
Algorithms for Graphs Embeddable with Few Crossings Per Edge
inferred← citeshttps://doi.org/10.1007/11785293_30openalex-snapshot
Better Approximation Schemes for Disk Graphs
inferred← citeshttps://doi.org/10.1007/11809678_42openalex-snapshot
Geometric Representation of Graphs in Low Dimension
inferred← citeshttps://doi.org/10.1007/11830924_3openalex-snapshot
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_8openalex-snapshot
Two Generalizations of Proper Coloring: Hardness and Approximability
inferred← citeshttps://doi.org/10.1007/978-3-319-29221-2_18openalex-snapshot
Improved Algorithm for Maximum Independent Set on Unit Disk Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-02029-2_15openalex-snapshot
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-12450-1_13openalex-snapshot
A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_59openalex-snapshot
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light
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/s00453-007-0010-xopenalex-snapshot
Algorithms for Graphs Embeddable with Few Crossings per Edge
inferred← citeshttps://doi.org/10.1007/s10878-010-9372-0openalex-snapshot
Algorithms for the minimum weight k-fold (connected) dominating set problem
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.1007/springerreference_72564openalex-snapshot
Optimization Problems in Unit-Disk Graphs
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.2012.01.004openalex-snapshot
Connected dominating sets on dynamic geometric graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.04.014openalex-snapshot
Optimization problems in dotted interval graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.08.014openalex-snapshot
On the recognition of unit disk graphs and the Distance Geometry Problem with Ranges
inferred← citeshttps://doi.org/10.1016/j.dam.2018.05.049openalex-snapshot
Efficient independent set approximation in unit disk graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.11.002openalex-snapshot
Approximation algorithms for maximum independent set of a unit disk graph
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.07.007openalex-snapshot
Faster approximation for maximum independent set on unit disk graph
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.023openalex-snapshot
Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
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.1109/cdc.2012.6426116openalex-snapshot
Distribution of agents with multiple capabilities in heterogeneous multiagent networks - A graph theoretic view
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195789openalex-snapshot
Location Aware Peak Value Queries in sensor networks
inferred← citeshttps://doi.org/10.1126/science.abo6587openalex-snapshot
Quantum optimization of maximum independent set using Rydberg atom arrays
inferred← citeshttps://doi.org/10.1137/110832689openalex-snapshot
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light
inferred← citeshttps://doi.org/10.1137/s0097539704446591openalex-snapshot
Computing Maximally Separated Sets in the Plane
inferred← citeshttps://doi.org/10.4310/cis.2014.v14.n1.a1openalex-snapshot
Characterizing heterogeneity in cooperative networks from a resource distribution view-point
inferred← citeshttps://doi.org/10.48550/arxiv.1102.4866openalex-snapshot
The MST of Symmetric Disk Graphs (in Arbitrary Metrics) is Light
inferred← citeshttps://doi.org/10.48550/arxiv.2109.01283openalex-snapshot
Retraction: Improved Approximation Schemes for Dominating Set Problems in Unit Disk Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0607092openalex-snapshot
Representing graphs as the intersection of axis-parallel cubes
inferred← citeshttps://doi.org/10.54607/hcmue.js.17.3.2634(2020)openalex-snapshot
MỘT SỐ THUẬT TOÁN THAM LAM CHO CÁC BÀI TOÁN TỐI ƯU TRÊN ĐỒ THỊ KHOẢNG ĐỀU
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.