| 2009 |
|---|
| 10 | EE | Yuval Emek,
Pierre Fraigniaud,
Amos Korman,
Adi Rosén:
On the Additive Constant of the k-server Work Function Algorithm
CoRR abs/0902.1378: (2009) |
| 2008 |
|---|
| 9 | EE | Yuval Emek,
Erez Kantor,
David Peleg:
On the effect of the deployment setting on broadcasting in Euclidean radio networks.
PODC 2008: 223-232 |
| 8 | EE | Yuval Emek,
David Peleg,
Liam Roditty:
A near-linear time algorithm for computing replacement paths in planar directed graphs.
SODA 2008: 428-435 |
| 7 | EE | Chen Avin,
Yuval Emek,
Erez Kantor,
Zvi Lotker,
David Peleg,
Liam Roditty:
SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks
CoRR abs/0811.3284: (2008) |
| 6 | EE | Michael Elkin,
Yuval Emek,
Daniel A. Spielman,
Shang-Hua Teng:
Lower-Stretch Spanning Trees.
SIAM J. Comput. 38(2): 608-628 (2008) |
| 5 | EE | Yuval Emek,
David Peleg:
Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs.
SIAM J. Comput. 38(5): 1761-1781 (2008) |
| 2007 |
|---|
| 4 | EE | Yuval Emek,
Leszek Gasieniec,
Erez Kantor,
Andrzej Pelc,
David Peleg,
Chang Su:
Broadcasting in udg radio networks with unknown topology.
PODC 2007: 195-204 |
| 2006 |
|---|
| 3 | EE | Yuval Emek,
David Peleg:
A tight upper bound on the probabilistic embedding of series-parallel graphs.
SODA 2006: 1045-1053 |
| 2005 |
|---|
| 2 | EE | Michael Elkin,
Yuval Emek,
Daniel A. Spielman,
Shang-Hua Teng:
Lower-stretch spanning trees.
STOC 2005: 494-503 |
| 2004 |
|---|
| 1 | EE | Yuval Emek,
David Peleg:
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs.
SODA 2004: 261-270 |
