Iftah Gamzu

	2012
26		Noga Alon, Iftah Gamzu, Moshe Tennenholtz: Optimizing budget allocation among channels and influencers. WWW 2012: 381-388
25		Yuval Emek, Michal Feldman, Iftah Gamzu, Renato Paes Leme, Moshe Tennenholtz: Signaling Schemes for Revenue Maximization CoRR abs/1202.1590: (2012)
24		Iftah Gamzu, Moti Medina: Improved Approximation for Orienting Mixed Graphs CoRR abs/1204.0219: (2012)
	2011
23		Yossi Azar, Iftah Gamzu, Ran Roth: Submodular Max-SAT. ESA 2011: 323-334
22		Yossi Azar, Iftah Gamzu: Ranking with Submodular Valuations. SODA 2011: 1070-1079
21		Michael Elberfeld, Vineet Bafna, Iftah Gamzu, Alexander Medvedovsky, Danny Segev, Dana Silverbush, Uri Zwick, Roded Sharan: On the Approximability of Reachability-Preserving Network Orientations. Internet Mathematics 7(4): 209-232 (2011)
20		Iftah Gamzu: Improved lower bounds for non-utilitarian truthfulness. Theor. Comput. Sci. 412(7): 626-632 (2011)
19		Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra: Buffer Management for Colored Packets with Deadlines. Theory Comput. Syst. 49(4): 738-756 (2011)
	2010
18		Iftah Gamzu, Danny Segev: A Sublogarithmic Approximation for Highway and Tollbooth Pricing. ICALP (1) 2010: 582-593
17		Iftah Gamzu, Danny Segev, Roded Sharan: Improved Orientations of Physical Networks. WABI 2010: 215-225
16		Yossi Azar, Iftah Gamzu, Shai Gutner: Truthful unsplittable flow for large capacity networks. ACM Transactions on Algorithms 6(2): (2010)
15		Iftah Gamzu, Danny Segev: A Sublogarithmic Approximation for Highway and Tollbooth Pricing CoRR abs/1002.2084: (2010)
14		Yossi Azar, Iftah Gamzu: Ranking with Submodular Valuations CoRR abs/1007.2503: (2010)
13		Yossi Azar, Iftah Gamzu: Efficient Submodular Function Maximization under Linear Packing Constraints CoRR abs/1007.3604: (2010)
12		Iftah Gamzu, Danny Segev: A polylogarithmic approximation for computing non-metric terminal Steiner trees. Inf. Process. Lett. 110(18-19): 826-829 (2010)
	2009
11		Chandra Chekuri, Iftah Gamzu: Truthful Mechanisms via Greedy Iterative Packing. APPROX-RANDOM 2009: 56-69
10		Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra: Buffer management for colored packets with deadlines. SPAA 2009: 319-327
9		Yossi Azar, Iftah Gamzu, Xiaoxin Yin: Multiple intents re-ranking. STOC 2009: 669-678
8		Iftah Gamzu, Danny Segev: Improved online algorithms for the sorting buffer problem on line metrics. ACM Transactions on Algorithms 6(1): (2009)
7		Chandra Chekuri, Iftah Gamzu: Truthful Mechanisms via Greedy Iterative Packing CoRR abs/0906.2466: (2009)
	2008
6		Yossi Azar, Iftah Gamzu: Truthful Unification Framework for Packing Integer Programs with Choices. ICALP (1) 2008: 833-844
5		Yehuda Afek, Iftah Gamzu, Irit Levy, Michael Merritt, Gadi Taubenfeld: Group Renaming. OPODIS 2008: 58-72
4		Yossi Azar, Iftah Gamzu, Shai Gutner: Truthful Unsplittable Flow for Large Capacity Networks CoRR abs/0804.2112: (2008)
	2007
3		Yossi Azar, Iftah Gamzu, Shai Gutner: Truthful unsplittable flow for large capacity networks. SPAA 2007: 320-329
2		Iftah Gamzu, Danny Segev: Improved Online Algorithms for the Sorting Buffer Problem. STACS 2007: 658-669
1		Iftah Gamzu: Improved Lower Bounds for Non-utilitarian Truthfulness. WAOA 2007: 15-26

Coauthor Index

1	Yehuda Afek	[5]
2	Noga Alon	[26]
3	Yossi Azar	[3] [4] [6] [9] [10] [13] [14] [16] [19] [22] [23]
4	Vineet Bafna	[21]
5	Chandra Chekuri	[7] [11]
6	Michael Elberfeld	[21]
7	Yuval Emek	[25]
8	Uriel Feige	[10] [19]
9	Michal Feldman	[25]
10	Shai Gutner	[3] [4] [16]
11	Renato Paes Leme	[25]
12	Irit Levy	[5]
13	Moti Medina	[24]
14	Alexander Medvedovsky	[21]
15	Michael Merritt	[5]
16	Thomas Moscibroda	[10] [19]
17	Prasad Raghavendra	[10] [19]
18	Ran Roth	[23]
19	Danny Segev	[2] [8] [12] [15] [17] [18] [21]
20	Roded Sharan	[17] [21]
21	Dana Silverbush	[21]
22	Gadi Taubenfeld	[5]
23	Moshe Tennenholtz	[25] [26]
24	Xiaoxin Yin	[9]
25	Uri Zwick	[21]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page