( en | de | ru )

 

Disambiguation of "Hajiaghayi, MohammadTaghi"

Author of the publication

copydeleteadd this publication to your clipboard
Regret minimization and the price of total anarchy.

, , , and . STOC, page 373-382. ACM, (2008)

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.

No persons found for author name Hajiaghayi, MohammadTaghi
add a person with the name Hajiaghayi, MohammadTaghi
 

Other publications of authors with the same name

Minimizing Movement: Fixed-Parameter Tractability., , and . ESA, volume 5757 of Lecture Notes in Computer Science, page 718-729. Springer, (2009)A Theory of Loss-Leaders: Making Money by Pricing Below Cost., , , and . WINE, volume 4858 of Lecture Notes in Computer Science, page 293-299. Springer, (2007)Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)., , , and . CoRR, (2019)Bidimensionality, Map Graphs, and Grid Minors, and . CoRR, (2005)Fast algorithms for knapsack via convolution and prediction., , , and . STOC, page 1269-1282. ACM, (2018)Approximation algorithms for connected maximum cut and related problems., , , , and . Theor. Comput. Sci., (2020)Contraction decomposition in h-minor-free graphs and algorithmic applications., , and . STOC, page 441-450. ACM, (2011)Euclidean Prize-Collecting Steiner Forest., and . LATIN, volume 6034 of Lecture Notes in Computer Science, page 503-514. Springer, (2010)On the Efficiency and Equilibria of Rich Ads., , , and . IJCAI, page 301-307. ijcai.org, (2019)Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs., , and . CoRR, (2018)