On the public citation graph
On Coloring Unit Disk Graphs
0 signed · 119 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.3230250205openalex-snapshot
Simple heuristics for unit disk graphs
inferredcites →https://doi.org/10.1007/978-94-009-5315-4_2openalex-snapshot
Algorithmic Aspects of Comparability Graphs and Interval Graphs
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50015-5openalex-snapshot
GRAPH COLORING ALGORITHMS††This research was supported in part by the Advanced Research Projects Agency of the Department of Defense under contract SD-302 and by the National Science Foundation under contract GJ-446.
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect 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.1109/proc.1980.11899openalex-snapshot
Frequency assignment: Theory and applications
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1145/167088.167172openalex-snapshot
On the hardness of approximating minimization problems
inferredcites →https://doi.org/10.1145/2402.322385openalex-snapshot
Smallest-last ordering and clustering and graph coloring algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0471224561.ch4openalex-snapshot
Channel Assignment and Graph Multicoloring
inferred← citeshttps://doi.org/10.1002/net.20318openalex-snapshot
Improper coloring of unit disk graphs
inferred← citeshttps://doi.org/10.1006/jagm.1997.0903openalex-snapshot
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_2openalex-snapshot
Discrete Mathematics and Radio Channel Assignment
inferred← citeshttps://doi.org/10.1007/11429647_8openalex-snapshot
A Tight Bound for Online Coloring of Disk Graphs
inferred← citeshttps://doi.org/10.1007/11533719_15openalex-snapshot
Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/11562436_33openalex-snapshot
Computing Subgraph Probability of Random Geometric Graphs: Quantitative Analyses of Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/11671541_5openalex-snapshot
Independence and Coloring Problems on Intersection Graphs of Disks
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_30openalex-snapshot
Graph Domination, Coloring and Cliques in Telecommunications
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_486openalex-snapshot
Optimization Problems in Unit-Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-1-84882-218-4_15openalex-snapshot
Scheduling Activities in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-39479-0_11openalex-snapshot
Approximate Strong Edge-Colouring of Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_61openalex-snapshot
Unit Disk Visibility Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-89240-1_5openalex-snapshot
Distributed Coloring and the Local Structure of Unit-Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-49611-0_5openalex-snapshot
Online Dominating Set and Coloring
inferred← citeshttps://doi.org/10.1007/978-3-031-82697-9_8openalex-snapshot
Colorful 3-Rainbow Domination
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_31openalex-snapshot
On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24592-6_23openalex-snapshot
Disk Graphs: A Short Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_14openalex-snapshot
Online Algorithms for Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-31833-0_19openalex-snapshot
Joint Base Station Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_18openalex-snapshot
Location Oblivious Distributed Unit Disk Graph Coloring
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_15openalex-snapshot
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_33openalex-snapshot
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13651-1_11openalex-snapshot
Building (1 − ε) Dominating Sets Partition as Backbones in Wireless Sensor Networks Using Distributed Graph Coloring
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/s00453-009-9334-zopenalex-snapshot
Location-Oblivious Distributed Unit Disk Graph Coloring
inferred← citeshttps://doi.org/10.1007/s00454-021-00327-yopenalex-snapshot
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/s00493-011-2403-3openalex-snapshot
On the chromatic number of random geometric 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/s12351-019-00535-8openalex-snapshot
A value for games on colored communication structures
inferred← citeshttps://doi.org/10.1007/springerreference_72564openalex-snapshot
Optimization Problems in Unit-Disk Graphs
inferred← citeshttps://doi.org/10.1016/j.adhoc.2006.01.003openalex-snapshot
Sufficient rate constraints for QoS flows in ad-hoc networks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101712openalex-snapshot
Minimum ply covering of points with disks and squares
inferred← citeshttps://doi.org/10.1016/j.comgeo.2026.102256openalex-snapshot
Online dominating set and coloring for geometric intersection graphs
inferred← citeshttps://doi.org/10.1016/j.comnet.2013.10.001openalex-snapshot
How many wireless resources are needed to resolve the hidden terminal problem?
inferred← citeshttps://doi.org/10.1016/j.comnet.2016.06.016openalex-snapshot
Wireless scheduling with multiple data rates: From physical interference to disk graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.005openalex-snapshot
On the minimum and maximum selective graph coloring problems in some graph classes
inferred← citeshttps://doi.org/10.1016/j.dam.2019.08.020openalex-snapshot
L(2,1) -labeling of disk intersection graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.072openalex-snapshot
Coloring the complements of intersection graphs of geometric figures
inferred← citeshttps://doi.org/10.1016/j.disc.2008.06.029openalex-snapshot
Perfectness and imperfectness of unit disk graphs on triangular lattice points
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.05.011openalex-snapshot
On some applications of the selective graph coloring problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.12.028openalex-snapshot
Inverse chromatic number problems in interval and permutation graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.022openalex-snapshot
Improper Colourings of Unit Disk Graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.05.002openalex-snapshot
3-coloring arrangements of line segments with 4 slopes is hard
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.09.004openalex-snapshot
Integer realizations of disk and segment graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.025openalex-snapshot
A tight bound for online colouring of disk graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.02.027openalex-snapshot
Maximum scan statistics and channel assignment problems in homogeneous wireless networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.044openalex-snapshot
Local 7-coloring for planar subgraphs of unit disk graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.024openalex-snapshot
Distributed coloring and the local structure of unit-disk graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00204-1openalex-snapshot
Representing graphs by disks and balls (a survey of recognition-complexity results)
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00283-1openalex-snapshot
The on-line first-fit algorithm for radio frequency assignment problems
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00156-xopenalex-snapshot
On the hardness of allocating frequencies for hybrid networks
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80069-1openalex-snapshot
Clique number and ball containment number of unit ball graphs
inferred← citeshttps://doi.org/10.1017/s0963548304006121openalex-snapshot
Threshold Functions for Random Graphs on a Line Segment
inferred← citeshttps://doi.org/10.1023/a:1012311216333openalex-snapshot
Models and Approximation Algorithms for Channel Assignment in Radio Networks
inferred← citeshttps://doi.org/10.1023/b:jogo.0000006750.85332.0fopenalex-snapshot
Coloring of Double Disk Graphs
inferred← citeshttps://doi.org/10.1049/ip-com:20059053openalex-snapshot
New graph model for channel assignment in ad hoc wireless networks
inferred← citeshttps://doi.org/10.1088/2058-9565/ae3b6dopenalex-snapshot
Graph coloring via quantum optimization on a Rydberg-qudit atom array
inferred← citeshttps://doi.org/10.1090/conm/342/06137openalex-snapshot
Coloring intersection graphs of geometric figures with a given clique number
inferred← citeshttps://doi.org/10.1093/oso/9780198503149.003.0005openalex-snapshot
Channel Assignment on Infinite Sets Under Frequency—Distance Constraints
inferred← citeshttps://doi.org/10.1109/hpcsim.2011.5999818openalex-snapshot
Determining the maximum clique size in large random geometric graphs
inferred← citeshttps://doi.org/10.1109/icc.2007.539openalex-snapshot
VoIP Capacity over Multiple IEEE 802.11 WLANs
inferred← citeshttps://doi.org/10.1109/icmcis.2016.7496580openalex-snapshot
Delay analysis of STDMA in grid wireless sensor networks
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9196672openalex-snapshot
Efficient Communication in Large Multi-robot Networks
inferred← citeshttps://doi.org/10.1109/imcsit.2010.5679951openalex-snapshot
Efficient coloring of Wireless Ad Hoc Networks with diminished transmitter power
inferred← citeshttps://doi.org/10.1109/infcom.2004.1357009openalex-snapshot
MiFi: A framework for fairness and QoS assurance in current IEEE 802.11 networks with multiple access points
inferred← citeshttps://doi.org/10.1109/lcn.2012.6423687openalex-snapshot
Wireless multi-rate scheduling: From physical interference to disk graphs
inferred← citeshttps://doi.org/10.1109/lcomm.2007.070257openalex-snapshot
Clique Number vs. Chromatic Number in Wireless Interference Graphs: Simulation Results
inferred← citeshttps://doi.org/10.1109/mass.2014.83openalex-snapshot
Delay and Energy-Efficient STDMA for Grid Wireless Sensor Networks: ORCHID
inferred← citeshttps://doi.org/10.1109/nca.2019.8935005openalex-snapshot
A Randomized Algorithm for Joint Power and Channel Allocation in 5G D2D Communication
inferred← citeshttps://doi.org/10.1109/percomw.2006.129openalex-snapshot
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks
inferred← citeshttps://doi.org/10.1109/pimrc.2004.1370895openalex-snapshot
Approximating maximal cliques in ad-hoc networks
inferred← citeshttps://doi.org/10.1109/tnet.2006.880161openalex-snapshot
MiFi: a framework for fairness and QoS assurance for current IEEE 802.11 networks with multiple access points
inferred← citeshttps://doi.org/10.1109/wasa.2007.36openalex-snapshot
Maximizing throughput multicast routing forwireless networks
inferred← citeshttps://doi.org/10.1109/wasa.2007.75openalex-snapshot
Maximizing Throughput Multicast Routing forWireless Networks
inferred← citeshttps://doi.org/10.1109/wcncw.2019.8902517openalex-snapshot
An Optimal Spectrum Allocation Strategy for Dynamic Spectrum Markets
inferred← citeshttps://doi.org/10.1109/wimob.2019.8923225openalex-snapshot
An Optimal Spectrum Allocation Strategy for Dynamic Spectrum Markets
inferred← citeshttps://doi.org/10.1109/wirelessvitae.2009.5172480openalex-snapshot
Evaluation of broadcast scheduling algorithms for ad-hoc TDMA networks
inferred← citeshttps://doi.org/10.1137/1.9781611972900.10openalex-snapshot
Employing (1 − ∊) Dominating Set Partitions as Backbones in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1137/16m1097821openalex-snapshot
Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs
inferred← citeshttps://doi.org/10.1137/s0895480102402514openalex-snapshot
Graph Imperfection with a Co-Site Constraint
inferred← citeshttps://doi.org/10.1142/s1793830909000415openalex-snapshot
LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS
inferred← citeshttps://doi.org/10.1145/1288107.1288125openalex-snapshot
Allocating dynamic time-spectrum blocks in cognitive radio networks
inferred← citeshttps://doi.org/10.1145/1298126.1298171openalex-snapshot
An efficient bandwidth guaranteed routing for ad hoc networks using ieee 802.11 with interference consideration
inferred← citeshttps://doi.org/10.1145/1497290.1497291openalex-snapshot
Testing bipartiteness of geometric intersection graphs
inferred← citeshttps://doi.org/10.1145/1989493.1989520openalex-snapshot
Approximation algorithms for secondary spectrum auctions
inferred← citeshttps://doi.org/10.1145/2335470.2335472openalex-snapshot
Towards tight bounds for local broadcasting
inferred← citeshttps://doi.org/10.1145/2663496openalex-snapshot
Approximation Algorithms for Secondary Spectrum Auctions
inferred← citeshttps://doi.org/10.1145/570810.570819openalex-snapshot
Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1145/570811.570819openalex-snapshot
Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1155/2011/350476openalex-snapshot
A Truthful Bilateral Multiunit Auction for Heterogeneous Cognitive Radio Networks
inferred← citeshttps://doi.org/10.11575/cdm.v8i2.62050.g46703openalex-snapshot
Colouring stability two unit disk graphs
inferred← citeshttps://doi.org/10.22215/etd/2008-06271openalex-snapshot
Approximation algorithms for geometric networks
inferred← citeshttps://doi.org/10.37236/1805openalex-snapshot
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane
inferred← citeshttps://doi.org/10.4108/icst.crowncom.2011.245836openalex-snapshot
Dynamic Spectrum Allocation for Heterogeneous Cognitive Radio Networks from Auction Perspective
inferred← citeshttps://doi.org/10.47749/t/unicamp.2022.1254700openalex-snapshot
Geometric decomposition problems
inferred← citeshttps://doi.org/10.48550/arxiv.1007.5032openalex-snapshot
Approximation Algorithms for Secondary Spectrum Auctions
inferred← citeshttps://doi.org/10.48550/arxiv.1007.5255openalex-snapshot
Analysis of Frequency-Agile CSMA Wireless Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1110.1560openalex-snapshot
On the Coloring of Grid Wireless Sensor Networks: the Vector-Based Coloring Method
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1836openalex-snapshot
Towards Tight Bounds for Local Broadcasting
inferred← citeshttps://doi.org/10.48550/arxiv.1402.7017openalex-snapshot
Joint Routing and STDMA-based Scheduling to Minimize Delays in Grid Wireless Sensor Networks
inferred← citeshttps://doi.org/10.5555/2163970.2163981openalex-snapshot
Building (1-ε) dominating sets partition as backbones in wireless sensor networks using distributed graph coloring
inferred← citeshttps://doi.org/10.70675/e563d46fz062fz4f56zafc0zbb889c73a40aopenalex-snapshot
Design of exact solutions for the manufacturing of "vias" using DSA technology
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.