MohammadTaghi Hajiaghayi

MohammadTaghi Hajiaghayi

University of Maryland

H-index: 73

North America-United States

About MohammadTaghi Hajiaghayi

MohammadTaghi Hajiaghayi, With an exceptional h-index of 73 and a recent h-index of 44 (since 2020), a distinguished researcher at University of Maryland, specializes in the field of Algorithms, Game Theory, Network Design, Social Networks, BIG Networks.

His recent articles reflect a diverse array of research interests and contributions to the field:

Power of Posted-price Mechanisms for Prophet Inequalities

Regret analysis of repeated delegated choice

2-Approximation for Prize-Collecting Steiner Forest

Dueling Over Dessert, Mastering the Art of Repeated Cake Cutting

Bandit Social Learning under Myopic Behavior

Dynamic algorithms for matroid submodular maximization

Fair, Polylog-Approximate Low-Cost Hierarchical Clustering

An improved relaxation for oracle-efficient adversarial contextual bandits

MohammadTaghi Hajiaghayi Information

University

Position

ACM Fellow Jack and Rita Minker Professor of Computer Science

Citations(all)

16861

Citations(since 2020)

6455

Cited By

13518

hIndex(all)

73

hIndex(since 2020)

44

i10Index(all)

242

i10Index(since 2020)

163

Email

University Profile Page

University of Maryland

Google Scholar

View Google Scholar Profile

MohammadTaghi Hajiaghayi Skills & Research Interests

Algorithms

Game Theory

Network Design

Social Networks

BIG Networks

Top articles of MohammadTaghi Hajiaghayi

Title

Journal

Author(s)

Publication Date

Power of Posted-price Mechanisms for Prophet Inequalities

Kiarash Banihashem

MohammadTaghi Hajiaghayi

Dariusz R Kowalski

Piotr Krysta

Jan Olkowski

2024

Regret analysis of repeated delegated choice

Proceedings of the AAAI Conference on Artificial Intelligence

Mohammad Hajiaghayi

Mohammad Mahdavi

Keivan Rezaei

Suho Shin

2024/3/24

2-Approximation for Prize-Collecting Steiner Forest

Ali Ahamdi

Iman Gholami

MohammadTaghi Hajiaghayi

Peyman Jabbarzade

Mohammad Mahdavi

2024

Dueling Over Dessert, Mastering the Art of Repeated Cake Cutting

arXiv preprint arXiv:2402.08547

Simina Brânzei

MohammadTaghi Hajiaghayi

Reed Phillips

Suho Shin

Kun Wang

2024/2/13

Bandit Social Learning under Myopic Behavior

Advances in Neural Information Processing Systems

Kiarash Banihashem

MohammadTaghi Hajiaghayi

Suho Shin

Aleksandrs Slivkins

2024/2/13

Dynamic algorithms for matroid submodular maximization

Kiarash Banihashem

Leyla Biabani

Samira Goudarzi

MohammadTaghi Hajiaghayi

Peyman Jabbarzade

...

2024

Fair, Polylog-Approximate Low-Cost Hierarchical Clustering

Advances in Neural Information Processing Systems

Marina Knittel

Max Springer

John Dickerson

MohammadTaghi Hajiaghayi

2024/2/13

An improved relaxation for oracle-efficient adversarial contextual bandits

Advances in Neural Information Processing Systems

Kiarash Banihashem

MohammadTaghi Hajiaghayi

Suho Shin

Max Springer

2024/2/13

Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements

arXiv preprint arXiv:2305.16081

MohammadTaghi Hajiaghayi

Max Springer

Hadi Yami

2023/5/25

Online Advertisements with LLMs: Opportunities and Challenges

Soheil Feizi

MohammadTaghi Hajiaghayi

Keivan Rezaei

Suho Shin

2023/11/11

Brief Announcement: Regular and Dyck Languages in MPC

Jacob Gilbert

MohammadTaghi Hajiaghayi

2023/6/17

Generalized reductions: making any hierarchical clustering fair and balanced with low cost

Marina Knittel

Max Springer

John P Dickerson

MohammadTaghi Hajiaghayi

2023/7/3

Bandit social learning: Exploration under myopic behavior

arXiv preprint arXiv:2302.07425

Kiarash Banihashem

MohammadTaghi Hajiaghayi

Suho Shin

Aleksandrs Slivkins

2023/2/15

A Tri‐Droplet Liquid Structure for Highly Efficient Intracellular Delivery in Primary Mammalian Cells Using Digital Microfluidics (Adv. Mater. Technol. 21/2023)

Advanced Materials Technologies

Samuel R Little

Ziuwin Leung

Angela BV Quach

Alison Hirukawa

Fatemeh Gholizadeh

...

2023/11

Weighted edit distance computation: Strings, trees, and Dyck

Debarati Das

Jacob Gilbert

MohammadTaghi Hajiaghayi

Tomasz Kociumaka

Barna Saha

2023/6/2

Optimal sparse recovery with decision stumps

Proceedings of the AAAI Conference on Artificial Intelligence

Kiarash Banihashem

Mohammad Hajiaghayi

Max Springer

2023/6/26

Parallel Algorithms for Processing Massive Texts and Graphs

Hamed Saleh

2023

Exponentially faster massively parallel maximal matching

Journal of the ACM

Soheil Behnezhad

MohammadTaghi Hajiaghayi

David G Harris

2023

Brief Announcement: Improved Consensus in Quantum Networks

Mohammadtaghi Hajiaghayi

Dariusz Rafal Kowalski

Jan Olkowski

2023/6/19

Fault-Tolerant Consensus in Quantum Networks

arXiv preprint arXiv:2305.10618

MohammadTaghi Hajiaghayi

Dariusz R Kowalski

Jan Olkowski

2023/5/18

See List of Professors in MohammadTaghi Hajiaghayi University(University of Maryland)

Co-Authors

H-index: 78
Erik Demaine

Erik Demaine

Massachusetts Institute of Technology

H-index: 64
Robert Kleinberg

Robert Kleinberg

Cornell University

H-index: 61
Fedor V. Fomin

Fedor V. Fomin

Universitetet i Bergen

H-index: 49
Dan Pei

Dan Pei

Tsinghua University

H-index: 18
Soheil Behnezhad

Soheil Behnezhad

University of Maryland, Baltimore

academic-engine