The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Emmanuelle Lebhar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
    A Doubling Dimension Threshold Theta(loglogn) for Augmented Graph Navigability. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:376-386 [Conf]
  2. Emmanuelle Lebhar, Nicolas Schabanel
    Almost Optimal Decentralized Routing in Long-Range Contact Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:894-905 [Conf]
  3. Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel
    Towards small world emergence. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:225-232 [Conf]
  4. Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel
    Could any Graph be Turned into a Small-World?. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:511-513 [Conf]
  5. Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
    Brief Announcement: On Augmented Graph Navigability. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:551-553 [Conf]
  6. Michel Habib, Emmanuelle Lebhar, Christophe Paul
    A note on finding all homogeneous set sandwiches. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:3, pp:147-151 [Journal]
  7. Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel
    Could any graph be turned into a small-world? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:355, n:1, pp:96-103 [Journal]
  8. Emmanuelle Lebhar, Nicolas Schabanel
    Close to optimal decentralized routing in long-range contact networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:294-310 [Journal]
  9. Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker
    Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:1-7 [Conf]
  10. Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar
    Local MST computation with short advice. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:154-160 [Conf]
  11. Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul
    Can transitive orientation make sandwich problems easier? [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:16, pp:2030-2041 [Journal]

  12. Introduction. [Citation Graph (, )][DBLP]


  13. Networks Become Navigable as Nodes Move and Forget. [Citation Graph (, )][DBLP]


  14. The Inframetric Model for the Internet. [Citation Graph (, )][DBLP]


  15. Unit disk graph and physical interference model: Putting pieces together. [Citation Graph (, )][DBLP]


  16. Graph Augmentation via Metric Embedding. [Citation Graph (, )][DBLP]


  17. Forget him and keep on moving. [Citation Graph (, )][DBLP]


  18. Recovering the Long-Range Links in Augmented Graphs. [Citation Graph (, )][DBLP]


  19. Networks become navigable as nodes move and forget [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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