Morteza Zadimoghaddam

	2012
28		Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Zadimoghaddam: Simultaneous approximations for adversarial and stochastic online budgeted allocation. SODA 2012: 1690-1701
	2011
27		Piotr Berman, Erik D. Demaine, Morteza Zadimoghaddam: O(1)-Approximations for Maximum Movement Problems. APPROX-RANDOM 2011: 62-74
26		Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam: Optimal-time adaptive strong renaming, with applications to counting. PODC 2011: 239-248
25		Bernhard Haeupler, Vahab S. Mirrokni, Morteza Zadimoghaddam: Online Stochastic Weighted Matching: Improved Approximation Algorithms. WINE 2011: 170-181
24		Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam: Permutation Betting Markets: Singleton Betting with Extra Information. Algorithmica 60(4): 853-876 (2011)
23		Yoram Bachrach, Pushmeet Kohli, Vladimir Kolmogorov, Morteza Zadimoghaddam: Optimal Coalition Structures in Graph Games CoRR abs/1108.5248: (2011)
22		Ali Kakhbod, Morteza Zadimoghaddam: On the construction of prefix-free and fix-free codes with specified codeword compositions. Discrete Applied Mathematics 159(18): 2269-2275 (2011)
21		Yoram Bachrach, Morteza Zadimoghaddam, Peter Key: A cooperative approach to collusion in auctions. SIGecom Exchanges 10(1): 17-22 (2011)
	2010
20		MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Morteza Zadimoghaddam: Submodular Secretary Problem and Extensions. APPROX-RANDOM 2010: 39-52
19		Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Morteza Zadimoghaddam: How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange). ICALP (2) 2010: 115-126
18		Amin Sayedi, Morteza Zadimoghaddam, Avrim Blum: Trading off Mistakes and Don't-Know Predictions. NIPS 2010: 2092-2100
17		Erik D. Demaine, Morteza Zadimoghaddam: Scheduling to minimize power consumption using submodular functions. SPAA 2010: 21-29
16		Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti Rad, Morteza Zadimoghaddam: Collaborative scoring with dishonest participants. SPAA 2010: 41-49
15		Erik D. Demaine, Morteza Zadimoghaddam: Minimizing the Diameter of a Network Using Shortcut Edges. SWAT 2010: 420-431
14		Erik D. Demaine, Morteza Zadimoghaddam: Constant Price of Anarchy in Network Creation Games via Public Service Advertising. WAW 2010: 122-131
13		Yoram Bachrach, Peter Key, Morteza Zadimoghaddam: Collusion in VCG Path Procurement Auctions. WINE 2010: 38-49
12		Ali Kakhbod, Morteza Zadimoghaddam: On the Carter-Gill Conjecture CoRR abs/1002.0097: (2010)
	2009
11		Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The Price of Anarchy in Cooperative Network Creation Games. STACS 2009: 301-312
10		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam: Minimizing movement. ACM Transactions on Algorithms 5(3): (2009)
9		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The Price of Anarchy in Cooperative Network Creation Games CoRR abs/0902.1400: (2009)
8		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The price of anarchy in cooperative network creation games. SIGecom Exchanges 8(2): 2 (2009)
	2008
7		Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam: Permutation betting markets: singleton betting with extra information. ACM Conference on Electronic Commerce 2008: 180-189
6		Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam: Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. APPROX-RANDOM 2008: 21-34
5		Ali Kakhbod, Ali Nazari, Morteza Zadimoghaddam: Some notes on fix-free codes. CISS 2008: 1015-1018
	2007
4		Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam: The price of anarchy in network creation games. PODC 2007: 292-298
3		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam: Minimizing movement. SODA 2007: 258-267
2		Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam: Scheduling to minimize gaps and power consumption. SPAA 2007: 46-54
1		Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Shayan Oveis Gharan, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam: Spanning trees with minimum weighted degrees. Inf. Process. Lett. 104(3): 113-116 (2007)

Coauthor Index

1	Dan Alistarh	[19] [26]
2	James Aspnes	[26]
3	Yoram Bachrach	[13] [21] [23]
4	Mihai Badoiu	[6]
5	MohammadHossein Bateni	[20]
6	Piotr Berman	[27]
7	Avrim Blum	[18]
8	Keren Censor-Hillel (Keren Censor)	[26]
9	Erik D. Demaine	[2] [3] [4] [6] [8] [9] [10] [11] [14] [15] [17] [27]
10	Shayan Oveis Gharan	[1] [3] [10] [28]
11	Mohammad Ghodsi	[1] [2] [7] [24]
12	Seth Gilbert	[16] [19] [26]
13	Rachid Guerraoui	[16] [19]
14	Bernhard Haeupler	[25]
15	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[2] [3] [4] [6] [8] [9] [10] [11] [20]
16	Ali Kakhbod	[5] [12] [22]
17	Peter Key	[13] [21]
18	Pushmeet Kohli	[23]
19	Vladimir Kolmogorov	[23]
20	Hamid Mahini	[1] [3] [4] [7] [8] [9] [10] [11] [24]
21	Kian Mirjalali	[1]
22	Vahab S. Mirrokni (Seyed Vahab Mirrokni)	[7] [24] [25] [28]
23	Ali Nazari	[5]
24	Faezeh Malakouti Rad	[16]
25	Amin S. Sayedi-Roshkhar (Amin Sayedi)	[1] [2] [3] [10] [18]
26	Anastasios Sidiropoulos	[6]

Colors in the list of coauthors

Last update Sat Feb 11 22:55:45 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page