|
Search the dblp DataBase
Morteza Zadimoghaddam:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
The price of anarchy in network creation games. [Citation Graph (0, 0)][DBLP] PODC, 2007, pp:292-298 [Conf]
- Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam
Minimizing movement. [Citation Graph (0, 0)][DBLP] SODA, 2007, pp:258-267 [Conf]
- Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
Scheduling to minimize gaps and power consumption. [Citation Graph (0, 0)][DBLP] SPAA, 2007, pp:46-54 [Conf]
- Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Shayan Oveis Gharan, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
Spanning trees with minimum weighted degrees. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:104, n:3, pp:113-116 [Journal]
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. [Citation Graph (, )][DBLP]
Submodular Secretary Problem and Extensions. [Citation Graph (, )][DBLP]
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange). [Citation Graph (, )][DBLP]
Permutation betting markets: singleton betting with extra information. [Citation Graph (, )][DBLP]
Collaborative scoring with dishonest participants. [Citation Graph (, )][DBLP]
Scheduling to minimize power consumption using submodular functions. [Citation Graph (, )][DBLP]
The Price of Anarchy in Cooperative Network Creation Games. [Citation Graph (, )][DBLP]
Minimizing the Diameter of a Network Using Shortcut Edges. [Citation Graph (, )][DBLP]
Some notes on fix-free codes. [Citation Graph (, )][DBLP]
The Price of Anarchy in Cooperative Network Creation Games [Citation Graph (, )][DBLP]
On the Carter-Gill Conjecture [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|