Unit Disk Graphs
Unit Disk Graph is a type of geometric graph in which vertices represent points in the Euclidean plane and edges connect pairs of points whose Euclidean distance is at most one, modeling proximity-based connectivity in wireless networks.
236
Publications
14.6K
Citations
474
Authors
240
Institutions
Publications per year
2017–2026
20
Parents
236
Simple heuristics for unit disk graphs
Madhav Marathe, Heinz Breu, Harry B. Hunt et al. · Networks · 1995 · 494 citations
On the complexity of scheduling in wireless networks
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff · 2006 · 379 citations
Boundary recognition in sensor networks by topological methods
Yue Wang, Jie Gao, Joseph S. B. Mitchell · 2006 · 375 citations
1–5 of 236
474
15
h-index
13
h-index
8
h-index
8
h-index
7
h-index
1–5 of 474
240
The University of Texas at Dallas
Richardson, United States
19 h-index
49 publications
2.9K citations

Illinois Institute of Technology
Chicago, United States
18 h-index
47 publications
7.6K citations
ETH Zurich
Zurich, Switzerland
17 h-index
34 publications
4K citations

Xi'an Jiaotong University
Xi'an, China
10 h-index
25 publications
691 citations

City University of Hong Kong
Hong Kong, Hong Kong
9 h-index
21 publications
2.3K citations

Centre National de la Recherche Scientifique
Paris, France
8 h-index
14 publications
263 citations
Xinjiang University
Ürümqi, China
7 h-index
7 publications
323 citations
Tsinghua University
Beijing, China
7 h-index
9 publications
512 citations
1–8 of 240
TMCCI · 11 publications · 560 citations
11
h-index
10 publications · 560 citations
10
h-index
TON · 7 publications · 330 citations
7
h-index
TPDS · 6 publications · 696 citations
6
h-index
5 publications · 252 citations
5
h-index
1–5