2026 MohammadTaghi Hajiaghayi: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	67	2241	2174	1118	1077	353	13567

Research.com Recognitions

2019 - Fellow of John Simon Guggenheim Memorial Foundation
2018 - ACM Fellow For contributions to the fields of algorithmic graph theory and algorithmic game theory

Overview

MohammadTaghi Hajiaghayi is affiliated with the University of Maryland, College Park in the United States. Their academic work is situated primarily within the field of Computer Science, with a strong focus on subfields including Artificial Intelligence, Computational Theory and Mathematics, Management Science and Operations Research, Computer Networks and Communications, and Economics and Econometrics.

The scientist's research topics cover a broad range including Complexity and Algorithms in Graphs, Auction Theory and Applications, Algorithms and Data Compression, Cryptography and Data Security, Advanced Bandit Algorithms Research, Optimization and Search Problems, and Privacy-Preserving Technologies in Data.

Key recent papers authored or co-authored by MohammadTaghi Hajiaghayi include:

Approximation algorithms for connected maximum cut and related problems, 2020, Theoretical Computer Science
Fair allocation of indivisible goods: Beyond additive valuations, 2021, Artificial Intelligence
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs, 2020, Operations Research
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings, 2021, Proceedings of the AAAI Conference on Artificial Intelligence
Exponentially Faster Massively Parallel Maximal Matching, 2023, Journal of the ACM

Frequent co-authors who have collaborated with MohammadTaghi Hajiaghayi include:

Kiarash Banihashem
Max Springer
Suho Shin
Peyman Jabbarzade
Alireza Farhadi

The scientist has published extensively in various venues, with multiple publications appearing in the following outlets:

arXiv (Cornell University)
Proceedings of the AAAI Conference on Artificial Intelligence
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
SIAM Journal on Computing
Artificial Intelligence

Recognition for contributions to computer science includes being named an ACM Fellow in 2018 for work in algorithmic graph theory and algorithmic game theory, as well as receiving a fellowship from the John Simon Guggenheim Memorial Foundation in 2019.

Best Publications

Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs

Erik D. Demaine;Fedor V. Fomin;Mohammadtaghi Hajiaghayi;Dimitrios M. Thilikos

413
Citations
Improved Approximation Algorithms for Minimum Weight Vertex Separators

Uriel Feige;MohammadTaghi Hajiaghayi;James R. Lee

412
Citations
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks

Mohammad Taghi Hajiaghayi;Nicole Immorlica;Vahab S. Mirrokni

384
Citations
Deploying sensor networks with guaranteed fault tolerance

Jonathan L. Bredin;Erik D. Demaine;Mohammad Taghi Hajiaghayi;Daniela Rus

305
Citations
Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks

Mohsen Bahramgiri;Mohammadtaghi Hajiaghayi;Vahab S. Mirrokni

300
Citations
The price of anarchy in network creation games

Erik D. Demaine;Mohammadtaghi Hajiaghayi;Hamid Mahini;Morteza Zadimoghaddam

275
Citations
Deploying sensor networks with guaranteed capacity and fault tolerance

Jonathan L. Bredin;Erik D. Demaine;MohammadTaghi Hajiaghayi;Daniela Rus

272
Citations
Adaptive limited-supply online auctions

Mohammad Taghi Hajiaghayi;Robert Kleinberg;David C. Parkes

253
Citations
Algorithmic graph minor theory: Decomposition, approximation, and coloring

E.D. Demaine;M.T. Hajiaghayi;K. Kawarabayashi

236
Citations
The Bidimensionality Theory and Its Algorithmic Applications 1

Erik D. Demaine;Mohammadtaghi Hajiaghayi

226
Citations
Submodular secretary problem and extensions

Mohammadhossein Bateni;Mohammadtaghi Hajiaghayi;Morteza Zadimoghaddam

200
Citations
Automated online mechanism design and prophet inequalities

Mohammad Taghi Hajiaghayi;Robert Kleinberg;Tuomas Sandholm

195
Citations
Online auctions with re-usable goods

Mohammad T. Hajiaghayi

194
Citations
To Cache or Not to Cache: The 3G Case

J Erman;A Gerber;M Hajiaghayi;Dan Pei

194
Citations
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs

Erik D. Demaine;Fedor V. Fomin;Mohammadtaghi Hajiaghayi;Dimitrios M. Thilikos

191
Citations
Bidimensionality: new connections between FPT algorithms and PTASs

Erik D. Demaine;MohammadTaghi Hajiaghayi

190
Citations
Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks

M. Bahramgiri;M. Hajlaghayi;V.S. Mirrokni

189
Citations
Regret minimization and the price of total anarchy

Avrim Blum;MohammadTaghi Hajiaghayi;Katrina Ligett;Aaron Roth

185
Citations
Combination Can Be Hard: Approximability of the Unique Coverage Problem

Erik D. Demaine;Uriel Feige;MohammadTaghi Hajiaghayi;Mohammad R. Salavatipour

180
Citations
Cell Breathing in Wireless LANs: Algorithms and Evaluation

P. Bahl;M.T. Hajiaghayi;K. Jain;S.V. Mirrokni

168
Citations
Fair Allocation of Indivisible Goods: Improvements and Generalizations

Mohammad Ghodsi;Mohammadtaghi Hajiaghayi;Masoud Seddighin;Saeed Seddighin

146
Citations

Frequent Co-Authors

Erik D. Demaine MIT

Guy Kortsarz Rutgers, The State University of New Jersey

Dániel Marx Saarland University

Frank Tom Leighton MIT

Robert Kleinberg Cornell University

Dimitrios M. Thilikos National and Kapodistrian University of Athens

Vahab Mirrokni Google (United States)

Howard Karloff Amazon (United States)

Fedor V. Fomin University of Bergen

Ken-ichi Kawarabayashi National Institute of Informatics

External Links

Wikipedia of MohammadTaghi Hajiaghayi Personal website of MohammadTaghi Hajiaghayi Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Studying Computer Science online opens doors to a variety of flexible learning options and future job opportunities. Many students start with an online associate degree in computer science or IT. This pathway provides a strong technical foundation and can lead to entry-level positions or further studies.

If affordability is a key concern, exploring the most affordable online colleges can help you keep costs down without sacrificing quality. These programs are tailored for working adults and those needing a cost-effective route to a degree.

Not everyone has a perfect academic record. Fortunately, there are college with low gpa requirements that offer a second chance for motivated learners to start or advance their studies in computer science.

Graduates in computer science can pursue diverse careers, from software development and data analysis to interdisciplinary fields. For example, combining tech skills with environmental data science can unlock roles similar to jobs for environmental science majors, such as climate data analyst or GIS specialist.