( en | de | ru )

 

Disambiguation of "Hajiaghayi, Mohammad Taghi"

Author of the publication

copydeleteadd this publication to your clipboard
To Cache or Not to Cache: The 3G Case.

, , , , , and . IEEE Internet Comput., 15 (2): 27-34 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mohammad Taghi Rahnemaee

Mohammad Taghi Ameli

Mohammad Taghi Massoudieh

Mohammad Taghi Monzavi

Mohammad Taghi Karimian

 

Other publications of authors with the same name

Basic Network Creation Games., , , and . SIAM J. Discret. Math., 27 (2): 656-668 (2013)Hat Guessing Games., , , and . SIAM J. Discret. Math., 22 (2): 592-605 (2008)Frugal Auction Design for Set Systems: Vertex Cover and Knapsack., , and . EC, page 645-662. ACM, (2018)Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs., , and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 262-273. Springer, (2002)Erratum to: Editorial., , and . Algorithmica, 73 (4): 750 (2015)Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design., , , and . SIAM J. Comput., 39 (5): 1772-1798 (2010)Online client-server load balancing without global information., , , and . SODA, page 197-206. SIAM, (2005)Random MAX SAT, random MAX CUT, and their phase transitions., , , and . SODA, page 364-373. ACM/SIAM, (2003)The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema., and . SODA, page 631-640. ACM Press, (2006)Combination can be hard: approximability of the unique coverage problem., , , and . SODA, page 162-171. ACM Press, (2006)