The SCEAS System
Navigation Menu

Journals in DBLP

Int. J. Found. Comput. Sci.
2003, volume: 14, number: 2

  1. Guangbin Fan, Jingyuan Zhang
    Optimal Cellular Network Deployment Reusing Existing Base Stations. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:2, pp:169-181 [Journal]
  2. Yu Wang, Xiang-Yang Li, Ophir Frieder
    Distributed Spanners with Bounded Degree for Wireless Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:2, pp:183-200 [Journal]
  3. Jie Wu, Fei Dai
    Broadcasting in Ad Hoc Networks Based on Self-Pruning. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:2, pp:201-221 [Journal]
  4. Alfredo Ferro, Giuseppe Pigola, Alfredo Pulvirenti, Dennis Shasha
    Fast Clustering and Minimum Weight Matching Algorithms for Very Large Mobile Backbone Wireless Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:2, pp:223-236 [Journal]
  5. Justin Lipman, Paul Boustead, John Judge
    Neighbor Aware Adaptive Power Flooding (NAAP) in Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:2, pp:237-252 [Journal]
  6. Julien Cartigny, François Ingelrest, David Simplot
    RNG Relay Subset Flooding Protocols in Mobile Ad-Hoc Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:2, pp:253-265 [Journal]
  7. Binh-Minh Bui-Xuan, Afonso Ferreira, Aubin Jarry
    Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:2, pp:267-285 [Journal]
  8. Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
    Maximal Independent Set, Weakly-Connected Dominating Set, and Induced Spanners in Wireless Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:2, pp:287-303 [Journal]
  9. Yuanzhu Peter Chen, Arthur L. Liestman
    A Zonal Algorithm for Clustering An Hoc Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:2, pp:305-322 [Journal]
  10. Peng-Jun Wan, Khaled M. Alzoubi, Ophir Frieder
    A Simple Heuristic for Minimum Connected Dominating Set in Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:2, pp:323-333 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002