MohammadTaghi Hajiaghayi
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
107
Venues
20
Active years
2007–2026
Best venue rank
A*
Where they publish
Papers
107 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | WWW | Single-Sample Bilateral Trade with a Broker. | MohammadTaghi Hajiaghayi, Gary Peng, Suho Shin |
| 2026 | SODA | Sample-efficient Replicable Median in Polynomial Time. | Kiarash Banihashem, MohammadHossein Bateni, Hossein Esfandiari, Samira Goudarzi, MohammadTaghi Hajiaghayi |
| 2026 | STOC | Optimal Contest beyond Convexity. | Negin Golrezaei, MohammadTaghi Hajiaghayi, Suho Shin |
| 2025 | AAAI | Replication-proof Bandit Mechanism Design with Bayesian Agents. | Suho Shin, Seyed A. Esmaeili, MohammadTaghi Hajiaghayi |
| 2025 | ESA | Beating Competitive Ratio 4 for Graphic Matroid Secretary. | Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Danny Mittal, Jan Olkowski |
| 2025 | FOCS | Breaking a Long-Standing Barrier: 2-ε Approximation for Steiner Forest. | Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi |
| 2025 | FOCS | Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance. | Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha |
| 2025 | ICALP | Dynamic Algorithms for Submodular Matching. | Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh |
| 2025 | ICML | Tokenized Bandit for LLM Decoding and Alignment. | Suho Shin, Chenghao Yang, Haifeng Xu, MohammadTaghi Hajiaghayi |
| 2025 | ICML | Fully Dynamic Embedding into ℓp Spaces. | Kiarash Banihashem, Xiang Chen, MohammadTaghi Hajiaghayi, Sungchul Kim, Kanak Mahadik, Ryan A. Rossi, Tong Yu |
| 2025 | IPCO | Prize-Collecting Forest with Submodular Penalties: Improved Approximation. | Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi |
| 2025 | SODA | Gains-from-Trade in Bilateral Trade with a Broker. | Ilya Hajiaghayi, MohammadTaghi Hajiaghayi, Gary Peng, Suho Shin |
| 2024 | AAAI | Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements. | Max Springer, MohammadTaghi Hajiaghayi, Hadi Yami |
| 2024 | ICML | A Dynamic Algorithm for Weighted Submodular Cover Problem. | Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh |
| 2024 | ICML | Dynamic Metric Embedding into lp Space. | Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz Rafal Kowalski, Jan Olkowski, Max Springer |
| 2024 | SODA | 2-Approximation for Prize-Collecting Steiner Forest. | Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi |
| 2024 | SODA | Dynamic Algorithms for Matroid Submodular Maximization. | Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh |
| 2024 | SODA | Power of Posted-price Mechanisms for Prophet Inequalities. | Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski |
| 2024 | STOC | Prize-Collecting Steiner Tree: A 1.79 Approximation. | Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi |
| 2024 | SPAA | Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC. | Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha |
| 2023 | ICML | Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time. | Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh |
| 2023 | ICML | Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost. | Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi Hajiaghayi |
| 2023 | PODC | Brief Announcement: Improved Consensus in Quantum Networks. | MohammadTaghi Hajiaghayi, Dariusz Rafal Kowalski, Jan Olkowski |
| 2023 | STOC | Weighted Edit Distance Computation: Strings, Trees, and Dyck. | Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha |
| 2023 | SPAA | Massively Parallel Tree Embeddings for High Dimensional Spaces. | AmirMohsen Ahanchi, Alexandr Andoni, MohammadTaghi Hajiaghayi, Marina Knittel, Peilin Zhong |
| 2023 | SPAA | Brief Announcement: Regular and Dyck Languages in MPC. | Jacob Gilbert, MohammadTaghi Hajiaghayi |
| 2023 | SPAA | Location-Sensitive String Problems in MPC. | Jacob Gilbert, MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin |
| 2022 | AAAI | Generalized Stochastic Matching. | Alireza Farhadi, Jacob Gilbert, MohammadTaghi Hajiaghayi |
| 2022 | AISTATS | Differentially Private Densest Subgraph. | Alireza Farhadi, MohammadTaghi Hajiaghayi, Elaine Shi |
| 2022 | FOCS | (n+poly(k))-time Algorithm for Bounded Tree Edit Distance. | Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh |
| 2022 | SPAA | Adaptive Massively Parallel Algorithms for Cut Problems. | MohammadTaghi Hajiaghayi, Marina Knittel, Jan Olkowski, Hamed Saleh |
| 2021 | AAAI | 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 |
| 2021 | ICALP | 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 |
| 2021 | SPAA | String Matching with Wildcards in the Massively Parallel Computation Model. | MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin, Xiaorui Sun |
| 2020 | AISTATS | Prophets, Secretaries, and Maximizing the Probability of Choosing the Best. | Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher |
| 2020 | STOC | Stochastic matching with few queries: (1-ε) approximation. | Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi |
| 2019 | ESA | Streaming and Massively Parallel Algorithms for Edge Coloring. | Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh |
| 2019 | FOCS | Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. | Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan |
| 2019 | FOCS | Exponentially Faster Massively Parallel Maximal Matching. | Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris |
| 2019 | IJCAI | On the Efficiency and Equilibria of Rich Ads. | MohammadAmin Ghiasi, MohammadTaghi Hajiaghayi, Sbastien Lahaie, Hadi Yami |
| 2019 | PODC | Massively Parallel Computation of Matching and MIS in Sparse Graphs. | Soheil Behnezhad, Sebastian Brandt, Mahsa Derakhshan, Manuela Fischer, MohammadTaghi Hajiaghayi, Richard M. Karp, Jara Uitto |
| 2019 | SODA | Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs. | MohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi |
| 2019 | SODA | Stochastic Matching with Few Queries: New Algorithms and Tools. | Soheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani |
| 2019 | SODA | Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence. | MohammadTaghi Hajiaghayi, Saeed Seddighin, Xiaorui Sun |
| 2019 | SODA | Approximating LCS in Linear Time: Beating the √n Barrier. | MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun |
| 2019 | STOC | Lower bounds for external memory integer sorting via network coding. | Alireza Farhadi, MohammadTaghi Hajiaghayi, Kasper Green Larsen, Elaine Shi |
| 2019 | STOC | 1+ | Mahdi Boroujeni, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin |
| 2019 | SAGT | Stochastic Matching on Uniformly Sparse Graphs. | Soheil Behnezhad, Mahsa Derakhshan, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani |
| 2019 | SAGT | Computing Stackelberg Equilibria of Large General-Sum Games. | Avrim Blum, Nika Haghtalab, MohammadTaghi Hajiaghayi, Saeed Seddighin |
| 2018 | ICALP | Brief Announcement: MapReduce Algorithms for Massive Trees. | MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni |
| 2018 | ICALP | Greedy Algorithms for Online Survivable Network Design. | Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin |
| 2018 | IJCAI | On the Complexity of Chore Division. | Alireza Farhadi, MohammadTaghi Hajiaghayi |
| 2018 | SODA | Prophet Secretary for Combinatorial Auctions and Matroids. | Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, Sahil Singla |
| 2018 | STOC | Fast algorithms for knapsack via convolution and prediction. | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein |
| 2017 | AAAI | Market Pricing for Data Streams. | Melika Abolhassani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Hadi Yami |
| 2017 | AAAI | Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. | Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin |
| 2017 | ICALP | Stochastic k-Server: How Should Uber Work?. | Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin |
| 2017 | STOC | Beating 1-1/e for ordered prophets. | Melika Abolhassani, Soheil Ehsani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Robert D. Kleinberg, Brendan Lucier |
| 2016 | AAAI | From Duels to Battlefields: Computing Equilibria of Blotto and Other Games. | AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Brendan Lucier, Hamid Mahini, Saeed Seddighin |
| 2016 | ESA | Beating Ratio 0.5 for Weighted Oblivious Matching Problems. | Melika Abolhassani, T.-H. Hubert Chan, Fei Chen, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Hamid Mahini, Xiaowei Wu |
| 2016 | ICDM | Finding Large Matchings in Semi-Streaming. | Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh |
| 2016 | SODA | Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams. | Rajesh Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova |
| 2016 | SODA | Online Degree-Bounded Steiner Network Design. | Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat |
| 2016 | STOC | A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting. | MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Dniel Marx |
| 2016 | SPAA | Brief Announcement: Applications of Uniform Sampling: Densest Subgraph and Beyond. | Hossein Esfandiari, MohammadTaghi Hajiaghayi, David P. Woodruff |
| 2015 | ESA | Revenue Maximization for Selling Multiple Correlated Items. | MohammadHossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, Saeed Seddighin |
| 2015 | ESA | Prophet Secretary. | Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh |
| 2015 | INFOCOM | Forming external behaviors by leveraging internal opinions. | AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Hamid Mahini, Saeed Seddighin, Sadra Yazdanbod |
| 2015 | SPAA | Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond. | Rajesh Hemant Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh |
| 2014 | ICALP | Online Stochastic Reordering Buffer Scheduling. | Hossein Esfandiari, MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Vahid Liaghat, Hamid Mahini, Harald Rcke |
| 2014 | ICALP | Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems. | MohammadTaghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi |
| 2014 | WWW | How effectively can we form opinions? | AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Hamid Mahini, Saeed Seddighin, Sadra Yazdanbod |
| 2014 | WWW | How to influence people with partial incentives. | Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, S. Raghavan, Anshul Sawant, Morteza Zadimoghaddam |
| 2014 | SODA | Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). | Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dniel Marx |
| 2014 | SODA | A Constant Factor Approximation Algorithm for Fault-Tolerant | MohammadTaghi Hajiaghayi, Wei Hu, Jian Li, Shi Li, Barna Saha |
| 2013 | ICALP | Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems. | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Vahid Liaghat |
| 2013 | INFOCOM | PACE: Policy-Aware Application Cloud Embedding. | Li Erran Li, Vahid Liaghat, Hongze Zhao, MohammadTaghi Hajiaghayi, Dan Li, Gordon T. Wilfong, Yang Richard Yang, Chuanxiong Guo |
| 2013 | SPAA | Brief announcement: a game-theoretic model motivated by the darpa network challenge. | Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Jonathan Katz, Koyel Mukherjee |
| 2013 | SAGT | Scheduling a Cascade with Opposing Influences. | MohammadTaghi Hajiaghayi, Hamid Mahini, Anshul Sawant |
| 2013 | WAOA | On Fixed Cost k-Flow Problems. | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
| 2012 | FOCS | Designing FPT Algorithms for Cut Problems Using Randomized Contractions. | Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk |
| 2012 | FOCS | LP Rounding for k-Centers with Non-uniform Hard Capacities. | Marek Cygan, MohammadTaghi Hajiaghayi, Samir Khuller |
| 2012 | INFOCOM | Threshold compression for 3G scalable monitoring. | Suk-Bok Lee, Dan Pei, MohammadTaghi Hajiaghayi, Ioannis Pefkianakis, Songwu Lu, He Yan, Zihui Ge, Jennifer Yates, Mario Kosseifi |
| 2012 | SODA | A polynomial-time approximation scheme for planar multiway cut. | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Philip N. Klein, Claire Mathieu |
| 2012 | SODA | Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. | Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dniel Marx |
| 2011 | AAAI | Parameterized Complexity of Problems in Coalitional Resource Games. | Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Vahid Liaghat |
| 2011 | STOC | Contraction decomposition in h-minor-free graphs and algorithmic applications. | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi |
| 2011 | SIGMETRICS | Scalable monitoring via threshold compression in a large operational 3G network. | Suk-Bok Lee, Dan Pei, MohammadTaghi Hajiaghayi, Ioannis Pefkianakis, Songwu Lu, He Yan, Zihui Ge, Jennifer Yates, Mario Kosseifi |
| 2011 | SPAA | On a local protocol for concurrent file transfers. | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat |
| 2010 | ESA | Budgeted Red-Blue Median and Its Generalizations. | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz |
| 2010 | ICALP | The Cooperative Game Theory Foundations of Network Bargaining Games. | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Nicole Immorlica, Hamid Mahini |
| 2010 | IPCO | Prize-Collecting Steiner Network Problems. | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
| 2010 | LATIN | Euclidean Prize-Collecting Steiner Forest. | MohammadHossein Bateni, MohammadTaghi Hajiaghayi |
| 2010 | LATIN | Prize-Collecting Steiner Networks via Iterative Rounding. | MohammadTaghi Hajiaghayi, Arefeh A. Nasri |
| 2010 | SODA | Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi |
| 2010 | STOC | Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dniel Marx |
| 2010 | SPAA | Basic network creation games. | Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton |
| 2009 | ESA | Improved Approximation Algorithms for Label Cover Problems. | Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff |
| 2009 | ESA | Minimizing Movement: Fixed-Parameter Tractability. | Erik D. Demaine, MohammadTaghi Hajiaghayi, Dniel Marx |
| 2009 | ICALP | Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi |
| 2009 | ICALP | Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. | Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein |
| 2009 | SODA | Assignment problem in content distribution networks: unsplittable hard-capacitated facility location. | MohammadHossein Bateni, MohammadTaghi Hajiaghayi |
| 2009 | SODA | Additive approximation algorithms for list-coloring minor-closed class of graphs. | Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi |
| 2009 | STACS | The Price of Anarchy in Cooperative Network Creation Games. | Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam |
| 2008 | STOC | Regret minimization and the price of total anarchy. | Avrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, Aaron Roth |
| 2007 | ESA | Dial a Ride from | Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi |
| 2007 | PODC | The price of anarchy in network creation games. | Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam |