On the public citation graph
Optimization Problems in Unit-Disk Graphs
0 signed · 63 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/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/11604686_31openalex-snapshot
Approximation Algorithms for Unit Disk 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/11671541_5openalex-snapshot
Independence and Coloring Problems on Intersection Graphs of Disks
inferredcites →https://doi.org/10.1007/11830924_3openalex-snapshot
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
inferredcites →https://doi.org/10.1007/978-0-387-30165-5_30openalex-snapshot
Graph Domination, Coloring and Cliques in Telecommunications
inferredcites →https://doi.org/10.1007/978-1-4757-3758-5_3openalex-snapshot
On the Construction of Virtual Backbone for Ad Hoc Wireless Network
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-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.1007/bf01580444openalex-snapshot
Vertex packings: Structural properties and algorithms
inferredcites →https://doi.org/10.1007/s10898-005-8466-1openalex-snapshot
Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks
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/0166-218x(83)90080-xopenalex-snapshot
Efficient bounds for the stable set, vertex cover and set packing problems
inferredcites →https://doi.org/10.1016/j.endm.2004.06.012openalex-snapshot
On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation
inferredcites →https://doi.org/10.1016/j.endm.2005.06.022openalex-snapshot
Improper Colourings of Unit Disk 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/j.tcs.2004.06.026openalex-snapshot
On distance constrained labeling of disk graphs
inferredcites →https://doi.org/10.1016/j.tcs.2005.08.037openalex-snapshot
Minimum connected dominating sets and maximal independent sets in unit disk graphs
inferredcites →https://doi.org/10.1016/j.tcs.2007.02.013openalex-snapshot
MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
inferredcites →https://doi.org/10.1016/s0012-365x(00)00204-1openalex-snapshot
Representing graphs by disks and balls (a survey of recognition-complexity results)
inferredcites →https://doi.org/10.1016/s0021-9800(68)80081-xopenalex-snapshot
An inequality for the chromatic number of a graph
inferredcites →https://doi.org/10.1016/s0304-0208(08)73101-3openalex-snapshot
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
inferredcites →https://doi.org/10.1016/s0304-3975(96)00008-4openalex-snapshot
Hierarchically specified unit disk graphs
inferredcites →https://doi.org/10.1016/s0925-7721(97)00014-xopenalex-snapshot
Unit disk graph recognition is NP-hard
inferredcites →https://doi.org/10.1023/a:1013941929408openalex-snapshot
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
inferredcites →https://doi.org/10.1023/b:jogo.0000006750.85332.0fopenalex-snapshot
Coloring of Double Disk Graphs
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.1109/icc.1997.605303openalex-snapshot
Routing in ad-hoc networks using minimum connected dominating sets
inferredcites →https://doi.org/10.1109/infcom.1989.101493openalex-snapshot
Distributed scheduling of broadcasts in a radio network
inferredcites →https://doi.org/10.1109/ispan.1999.778957openalex-snapshot
Distributed clustering for ad hoc networks
inferredcites →https://doi.org/10.1109/jcn.2002.6596929openalex-snapshot
Distributed heuristics for connected dominating sets in wireless ad hoc networks
inferredcites →https://doi.org/10.1109/pimrc.2004.1370895openalex-snapshot
Approximating maximal cliques in ad-hoc networks
inferredcites →https://doi.org/10.1109/proc.1980.11899openalex-snapshot
Frequency assignment: Theory and applications
inferredcites →https://doi.org/10.1109/wimob.2005.1512873openalex-snapshot
A simple improved distributed algorithm for minimum CDS in unit disk graphs
inferredcites →https://doi.org/10.1137/s0097539702431840openalex-snapshot
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
inferredcites →https://doi.org/10.1145/1022630.1022634openalex-snapshot
Unit disk graph approximation
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/800070.802205openalex-snapshot
On approximating a vertex cover for planar graphs
inferredcites →https://doi.org/10.1145/941079.941089openalex-snapshot
Ad-hoc networks beyond unit disk graphs
inferredcites →https://doi.org/10.14288/1.0051600openalex-snapshot
Algorithmic aspects of constrained unit disk graphs
inferredcites →https://doi.org/10.5555/1070432.1070558openalex-snapshot
Multicoloring Unit Disk Graphs on Triangular Lattice Points
inferredcites →https://doi.org/10.5555/313651.313705openalex-snapshot
Algorithms for dynamic closest pair and n-body potential fields
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/978-3-030-50026-9_13openalex-snapshot
On Embeddability of Unit Disk Graphs onto Straight Lines
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_19openalex-snapshot
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/s00224-022-10110-yopenalex-snapshot
On Embeddability of Unit Disk Graphs Onto Straight Lines
inferred← citeshttps://doi.org/10.1007/s00373-011-1026-1openalex-snapshot
Minimum Clique Partition in Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/s00453-011-9503-8openalex-snapshot
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/s00454-018-9968-1openalex-snapshot
On Forbidden Induced Subgraphs for Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/s10898-014-0221-zopenalex-snapshot
Note on coloring of double disk graphs
inferred← citeshttps://doi.org/10.1007/s11590-009-0146-5openalex-snapshot
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
inferred← citeshttps://doi.org/10.1016/j.dam.2013.10.017openalex-snapshot
Approximating 2-cliques in unit disk graphs
inferred← citeshttps://doi.org/10.1109/icat.2011.6102096openalex-snapshot
New edge sorting criterion for maximum clique search algorithm in unit disk graphs
inferred← citeshttps://doi.org/10.11575/cdm.v8i2.62050.g46703openalex-snapshot
Colouring stability two unit disk graphs
inferred← citeshttps://doi.org/10.7939/r3w37kx2qopenalex-snapshot
A PTAS for Minimum Clique Partition in Unit Disk Graphs
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.