Conferences in DBLP

Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M) (dialm)
2002 (conf/dialm/2002)

1. Joan Feigenbaum, Scott Shenker
   Distributed algorithmic mechanism design: recent results and future directions. [Citation Graph (0, 0)][DBLP]
   DIAL-M, 2002, pp:1-13 [Conf]
   
2. Saurabh Srivastava, R. K. Ghosh
   Cluster based routing using a k-tree core backbone for mobile ad hoc networks. [Citation Graph (0, 0)][DBLP]
   DIAL-M, 2002, pp:14-23 [Conf]
   
3. Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
   Asymptotically optimal geometric mobile ad-hoc routing. [Citation Graph (0, 0)][DBLP]
   DIAL-M, 2002, pp:24-33 [Conf]
   
4. Yu Chen, Jennifer L. Welch
   Self-stabilizing mutual exclusion using tokens in mobile ad hoc networks. [Citation Graph (0, 0)][DBLP]
   DIAL-M, 2002, pp:34-42 [Conf]
   
5. András Faragó
   Scalable analysis and design of ad hoc networks via random graph theory. [Citation Graph (0, 0)][DBLP]
   DIAL-M, 2002, pp:43-50 [Conf]
   
6. Hari Balakrishnan
   Energy v. performance in wireless networks. [Citation Graph (0, 0)][DBLP]
   DIAL-M, 2002, pp:51- [Conf]
   
7. Hai Huang, Andréa W. Richa, Michael Segal
   Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks. [Citation Graph (0, 0)][DBLP]
   DIAL-M, 2002, pp:52-61 [Conf]
   
8. Xiang-Yang Li, Yu Wang
   Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks. [Citation Graph (0, 0)][DBLP]
   DIAL-M, 2002, pp:62-71 [Conf]
   
9. Sandeep K. S. Gupta, Goran Konjevod, Georgios Varsamopoulos
   A theoretical study of optimization techniques used in registration area based location management: models and online algorithms. [Citation Graph (0, 0)][DBLP]
   DIAL-M, 2002, pp:72-79 [Conf]