2009 |
18 | EE | Pierre Fraigniaud,
Cyril Gavoille,
Adrian Kosowski,
Emmanuelle Lebhar,
Zvi Lotker:
Universal augmentation schemes for network navigability.
Theor. Comput. Sci. 410(21-23): 1970-1981 (2009) |
2008 |
17 | EE | Augustin Chaintreau,
Pierre Fraigniaud,
Emmanuelle Lebhar:
Networks Become Navigable as Nodes Move and Forget.
ICALP (1) 2008: 133-144 |
16 | EE | Pierre Fraigniaud,
Emmanuelle Lebhar,
Laurent Viennot:
The Inframetric Model for the Internet.
INFOCOM 2008: 1085-1093 |
15 | EE | Emmanuelle Lebhar,
Nicolas Schabanel:
Graph Augmentation via Metric Embedding.
OPODIS 2008: 217-225 |
14 | EE | Augustin Chaintreau,
Pierre Fraigniaud,
Emmanuelle Lebhar:
Forget him and keep on moving.
PODC 2008: 415 |
13 | EE | Pierre Fraigniaud,
Emmanuelle Lebhar,
Zvi Lotker:
Recovering the Long-Range Links in Augmented Graphs.
SIROCCO 2008: 104-118 |
12 | EE | Augustin Chaintreau,
Pierre Fraigniaud,
Emmanuelle Lebhar:
Networks become navigable as nodes move and forget
CoRR abs/0803.0248: (2008) |
2007 |
11 | EE | Pierre Fraigniaud,
Cyril Gavoille,
Adrian Kosowski,
Emmanuelle Lebhar,
Zvi Lotker:
Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier.
SPAA 2007: 1-7 |
10 | EE | Pierre Fraigniaud,
Amos Korman,
Emmanuelle Lebhar:
Local MST computation with short advice.
SPAA 2007: 154-160 |
9 | EE | Michel Habib,
David Kelly,
Emmanuelle Lebhar,
Christophe Paul:
Can transitive orientation make sandwich problems easier?
Discrete Mathematics 307(16): 2030-2041 (2007) |
2006 |
8 | EE | Pierre Fraigniaud,
Emmanuelle Lebhar,
Zvi Lotker:
Brief Announcement: On Augmented Graph Navigability.
DISC 2006: 551-553 |
7 | EE | Pierre Fraigniaud,
Emmanuelle Lebhar,
Zvi Lotker:
A Doubling Dimension Threshold Theta(loglogn) for Augmented Graph Navigability.
ESA 2006: 376-386 |
6 | EE | Philippe Duchon,
Nicolas Hanusse,
Emmanuelle Lebhar,
Nicolas Schabanel:
Towards small world emergence.
SPAA 2006: 225-232 |
5 | EE | Philippe Duchon,
Nicolas Hanusse,
Emmanuelle Lebhar,
Nicolas Schabanel:
Could any graph be turned into a small-world?
Theor. Comput. Sci. 355(1): 96-103 (2006) |
2005 |
4 | EE | Philippe Duchon,
Nicolas Hanusse,
Emmanuelle Lebhar,
Nicolas Schabanel:
Could any Graph be Turned into a Small-World?.
DISC 2005: 511-513 |
3 | EE | Emmanuelle Lebhar,
Nicolas Schabanel:
Close to optimal decentralized routing in long-range contact networks.
Theor. Comput. Sci. 348(2-3): 294-310 (2005) |
2004 |
2 | EE | Emmanuelle Lebhar,
Nicolas Schabanel:
Almost Optimal Decentralized Routing in Long-Range Contact Networks.
ICALP 2004: 894-905 |
2003 |
1 | EE | Michel Habib,
Emmanuelle Lebhar,
Christophe Paul:
A note on finding all homogeneous set sandwiches.
Inf. Process. Lett. 87(3): 147-151 (2003) |