MohammadTaghi Hajiaghayi

Massachusetts Institute of Technology, AT&T (United States)

Papers

Total Citations

302

H-Index

About

MohammadTaghi Hajiaghayi is a leading figure in theoretical computer science, renowned for his deep contributions to algorithm design, network optimization, and combinatorial optimization. His research spans sensor networks, movement minimization, and fixed-parameter tractability (FPT), where he has developed foundational approximation algorithms and complexity results. His seminal 2005 paper on sensor networks, with 202 citations, tackled the critical challenge of deploying networks with guaranteed fault tolerance and capacity through multi-path connectivity, offering practical solutions for robust infrastructure. In his influential 2009 work on minimizing movement (75 citations), he introduced approximation algorithms and inapproximability bounds for coordinating large-scale agent motion—applicable to robot swarms, emergency response, and network routing. Hajiaghayi further advanced this area by establishing fixed-parameter tractable algorithms, demonstrating that movement problems can be solved efficiently under certain parameters. His work bridges theory and real-world applications, earning him recognition as a pioneer in algorithmic game theory and network design. With a prolific publication record and high-impact citations, Hajiaghayi continues to shape modern algorithm research, inspiring students and researchers to tackle complex optimization challenges with elegance and rigor.