Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Unit disk graph
OpenAlex ID:
C130184317
Unit disk graphs
1990
·
Brent N. Clark
, Charles J. Colbourn
, et al.
·
Discrete Mathematics
·
1,625
Simple heuristics for unit disk graphs
1995
·
M. V. Marathe
, H. Breu
, et al.
·
Networks
·
537
PDF
Message-optimal connected dominating sets in mobile ad hoc networks
2002
·
Khaled M. Alzoubi
, Peng-Jun Wan
, et al.
·
ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
·
444
Boundary recognition in sensor networks by topological methods
2006
·
Yue Wang
, Jie Gao
, et al.
·
ACM Annual International Conference on Mobile Computing and Networking (MobiCom)
·
388
Unit disk graph recognition is NP-hard
1998
·
Heinz Breu
, David G. Kirkpatrick
·
Computational Geometry
·
367
A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks
2003
·
Xiuzhen Cheng
, Xiao Huang
, et al.
·
Networks
·
340
Distributed construction of a planar spanner and routing for ad hoc wireless networks
2003
·
Xiang-Yang Li
, G. Calinescu
, et al.
·
IEEE Conference on Computer Communications (INFOCOM)
·
294
XTC: a practical topology control algorithm for ad-hoc networks
2004
·
R. Wattenhofer
, A. Zollinger
·
IEEE International Parallel and Distributed Processing Symposium (IPDPS)
·
284
Ad-hoc networks beyond unit disk graphs
2003
·
Fabian Kuhn
, Rogert Wattenhofer
, et al.
·
Foundations of Mobile Computing
·
279
Distributed heuristics for connected dominating sets in wireless ad hoc networks
2002
·
Khaled M. Alzoubi
, Peng-Jun Wan
, et al.
·
Journal of Communications and Networks
·
276
Localized Delaunay triangulation with application in ad hoc wireless networks
2003
·
Xiang-Yang Li
, G. Calinescu
, et al.
·
IEEE Transactions on Parallel and Distributed Systems
·
243
Minimum connected dominating sets and maximal independent sets in unit disk graphs
2005
·
Weili Wu
, Hongwei Du
, et al.
·
Theoretical Computer Science
·
241
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
2005
·
Thomas Erlebach
, Klaus Jansen
, et al.
·
SIAM Journal on Computing
·
228
Initializing newly deployed ad hoc and sensor networks
2004
·
Fabian Kuhn
, Thomas Moscibroda
, et al.
·
ACM Annual International Conference on Mobile Computing and Networking (MobiCom)
·
182
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
2007
·
My T. Thai
, Feng Wang
, et al.
·
IEEE Transactions on Mobile Computing
·
178
Ad hoc networks beyond unit disk graphs
2007
·
Fabian Kuhn
, Roger Wattenhofer
, et al.
·
Wireless Networks
·
174
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
2006
·
Christoph Ambühl
, Thomas Erlebach
, et al.
·
Lecture notes in computer science
·
173
Unit disk graph approximation
2004
·
Fabian Kuhn
, Thomas Moscibroda
, et al.
·
Foundations of Mobile Computing
·
155
Sparse power efficient topology for wireless networks
2003
·
Xiang-Yang Li
, Peng-Jun Wan
, et al.
·
Hawaii International Conference on System Sciences (HICSS)
·
146
On Coloring Unit Disk Graphs
1998
·
A. Gräf
, M. Stumpf
, et al.
·
Algorithmica
·
134
Hole detection or: "how much geometry hides in connectivity?"
2006
·
Stefan Funke
, Christian Klein
·
Annual Symposium on Computational Geometry (SoCG)
·
133
On the pitfalls of geographic face routing
2005
·
Young-Jin Kim
, Ramesh Govindan
, et al.
·
Foundations of Mobile Computing
·
132
Polynomial-time approximation schemes for geometric graphs
2001
·
Thomas Erlebach
, Klaus Jansen
, et al.
·
Symposium on Discrete Algorithms
·
131
New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
2009
·
Feng Zou
, Yuexuan Wang
, et al.
·
Theoretical Computer Science
·
129
Connected Domination in Multihop Ad Hoc Wireless Networks
·
Mihaela Cardei
, Xiaoyan Cheng
, et al.
·
125
Show more works
View as search
Works count:
690
Citation count:
15,740
Year
Topic
Type