M
MohammadTaghi Hajiaghayi
Researcher at University of Maryland, College Park
Publications - 404
Citations - 12400
MohammadTaghi Hajiaghayi is an academic researcher from University of Maryland, College Park. The author has contributed to research in topics: Approximation algorithm & 1-planar graph. The author has an hindex of 57, co-authored 377 publications receiving 11276 citations. Previous affiliations of MohammadTaghi Hajiaghayi include Massachusetts Institute of Technology & Indian Institutes of Technology.
Papers
More filters
Proceedings ArticleDOI
Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence
Kuan Cheng,Alireza Farhadi,MohammadTaghi Hajiaghayi,Zhengzhong Jin,Xin Li,Aviad Rubinstein,Saeed Seddighin,Yu Zheng +7 more
TL;DR: In this paper, Andoni, Krauthgamer and Onak gave a constant factor approximation algorithm for the edit distance with memory O(n^δ) for any constant δ > 0.
Posted Content
Random MAX SAT, Random MAX CUT, and Their Phase Transitions
TL;DR: In this article, it was shown that the expected number of clauses satisfiable by a single assignment of variables in a 2-SAT formula is at most (3/4)c + \Theta(n − 1/3)n.
Journal ArticleDOI
Social network ad allocation and optimization: a geometric mapping-based approach
TL;DR: This work studies SNS advertising business models and formulate the SNS ad allocation problem, shows the problem is NP-hard, and proposes two dimension reduction schemes together with novel relaxation techniques, and develops an optimization framework and solves the relaxed problem as a series of linear programs.
Proceedings Article
Scalable Equilibrium Computation in Multi-agent Influence Games on Networks.
Fotini Christia,Michael J. Curry,Constantinos Daskalakis,Erik D. Demaine,John P. Dickerson,MohammadTaghi Hajiaghayi,Adam Hesterberg,Marina Knittel,Aidan Milliff +8 more
TL;DR: In this paper, a polynomial-time, scalable algorithm for equilibrium computation in multi-agent influence games on networks, extending work of Bindel, Kleinberg, and Oren (2015) from the single-agent to the multiagent setting, is provided.
Posted Content
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
TL;DR: The main hardness result is a matching lower bound for the algorithm, and it is shown that planar SCSS does not have an f(k) · no(√k) algorithm for any computable function f, unless the Exponential Time Hypothesis (ETH) fails.