Disk Graphs
Disk Graphs is a geometric graph model in which vertices correspond to disks in the Euclidean plane and an edge exists between two vertices if and only if their corresponding disks intersect.
133
Publications
8.2K
Citations
284
Authors
173
Institutions
Publications per year
2017–2026
12
Variants
Disk Intersection Graphs
Parents
133
Frequency assignment: Theory and applications
William K. Hale · Proceedings of the IEEE · 1980 · 1.3K citations
Simple heuristics for unit disk graphs
Madhav Marathe, Heinz Breu, Harry B. Hunt et al. · Networks · 1995 · 494 citations
Unit disk graph recognition is NP-hard
Heinz Breu, David Kirkpatrick · Computational Geometry · 1998 · 313 citations
Ad-hoc networks beyond unit disk graphs
Fabian Kühn, Rogert Wattenhofer, Aaron Zollinger · 2003 · 246 citations
1–5 of 133
284
10
h-index
6
h-index
4
h-index
3
h-index
3
h-index
1–5 of 284
173
The University of Texas at Dallas
Richardson, United States
12 h-index
28 publications
1.5K citations

Centre National de la Recherche Scientifique
Paris, France
8 h-index
14 publications
553 citations
ETH Zurich
Zurich, Switzerland
8 h-index
15 publications
1.8K citations

Illinois Institute of Technology
Chicago, United States
6 h-index
9 publications
581 citations

City University of Hong Kong
Hong Kong, Hong Kong
5 h-index
14 publications
1.4K citations
University of Florida
Gainesville, United States
5 h-index
12 publications
1.3K citations
Xinjiang University
Ürümqi, China
5 h-index
5 publications
253 citations

University of Minnesota
Minneapolis, United States
4 h-index
8 publications
651 citations
1–8 of 173
11 publications · 564 citations
10
h-index
5 publications · 252 citations
5
h-index
TMCCI · 5 publications · 315 citations
5
h-index
4 publications · 161 citations
4
h-index
4 publications · 45 citations
4
h-index
1–5