Yuval Emek

	2009
17		Yuval Emek, Amos Korman: New Bounds for the Controller Problem. DISC 2009: 22-34
16		Yuval Emek: k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees. ESA 2009: 203-214
15		Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén: Online Computation with Advice. ICALP (1) 2009: 427-438
14		Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty: SINR diagrams: towards algorithmically usable SINR models of wireless networks. PODC 2009: 200-209
13		Yuval Emek, Amos Korman: Brief announcement: new bounds for the controller problem. PODC 2009: 340-341
12		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)
11		Yuval Emek, Amos Korman, Yuval Shavitt: Computing the Expected Values of some Properties of Randomly Weighted Graphs CoRR abs/0908.0968: (2009)
10		Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su: Broadcasting in UDG radio networks with unknown topology. Distributed Computing 21(5): 331-351 (2009)
	2008
9		Yuval Emek, Erez Kantor, David Peleg: On the effect of the deployment setting on broadcasting in Euclidean radio networks. PODC 2008: 223-232
8		Yuval Emek, David Peleg, Liam Roditty: A near-linear time algorithm for computing replacement paths in planar directed graphs. SODA 2008: 428-435
7		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		Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng: Lower-Stretch Spanning Trees. SIAM J. Comput. 38(2): 608-628 (2008)
5		Yuval Emek, David Peleg: Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs. SIAM J. Comput. 38(5): 1761-1781 (2008)
	2007
4		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		Yuval Emek, David Peleg: A tight upper bound on the probabilistic embedding of series-parallel graphs. SODA 2006: 1045-1053
	2005
2		Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng: Lower-stretch spanning trees. STOC 2005: 494-503
	2004
1		Yuval Emek, David Peleg: Approximating Minimum Max-Stretch spanning Trees on unweighted graphs. SODA 2004: 261-270

Coauthor Index

1	Chen Avin	[7] [14]
2	Michael Elkin	[2] [6]
3	Pierre Fraigniaud	[12] [15]
4	Leszek Gasieniec	[4] [10]
5	Erez Kantor	[4] [7] [9] [10] [14]
6	Amos Korman	[11] [12] [13] [15] [17]
7	Zvi Lotker	[7] [14]
8	Andrzej Pelc	[4] [10]
9	David Peleg	[1] [3] [4] [5] [7] [8] [9] [10] [14]
10	Liam Roditty	[7] [8] [14]
11	Adi Rosén	[12] [15]
12	Yuval Shavitt	[11]
13	Daniel A. Spielman	[2] [6]
14	Chang Su	[4] [10]
15	Shang-Hua Teng	[2] [6]