Author:
Fekete S. P.,Kröller A.,Pfisterer D.,Fischer S.,Buschmann C.
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Aspnes, J., Goldenberg, D., Yang, Y.R.: On the computational complexity of sensor network localization. In: Proc. ALGOSENSORS (2004)
2. Appel, M.J.B., Russo, R.P.: The maximum vertex degree of a graph on uniform points in [0; 1]
d
. Adv. Applied Probability 29, 567–581 (1997)
3. Beal, J.: Near-optimal distributed failure circumscription. Technical Report AIM-2003-17, MIT Artificial Intelligence Laboratory (2003)
4. Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Comp. Geom. Theory Appl. 9(1-2), 3–24 (1998)
5. Brunekreef, J., Katoen, J.-P., Koymans, R., Mauw, S.: Design and analysis of dynamic leader election protocols in broadcast networks. Distributed Computing 9(4), 157–171 (1996)
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献