The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Morteza Zadimoghaddam: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]

  5. Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. [Citation Graph (, )][DBLP]


  6. Submodular Secretary Problem and Extensions. [Citation Graph (, )][DBLP]


  7. How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange). [Citation Graph (, )][DBLP]


  8. Permutation betting markets: singleton betting with extra information. [Citation Graph (, )][DBLP]


  9. Collaborative scoring with dishonest participants. [Citation Graph (, )][DBLP]


  10. Scheduling to minimize power consumption using submodular functions. [Citation Graph (, )][DBLP]


  11. The Price of Anarchy in Cooperative Network Creation Games. [Citation Graph (, )][DBLP]


  12. Minimizing the Diameter of a Network Using Shortcut Edges. [Citation Graph (, )][DBLP]


  13. Some notes on fix-free codes. [Citation Graph (, )][DBLP]


  14. The Price of Anarchy in Cooperative Network Creation Games [Citation Graph (, )][DBLP]


  15. On the Carter-Gill Conjecture [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002