default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad Hajiaghayi
MohammadTaghi Hajiaghayi – Mohammad Taghi Hajiaghayi – محمد تقی حاجی آقائی
Person information
- unicode name: محمد تقی حاجی آقائی
- affiliation: University of Maryland at College Park, Computer Science Department, College Park, MD, USA
- affiliation (PhD 2005): Massachusetts Institute of Technology (MIT), Computer Science and Artificial Intelligence Laboratory, Cambridge, MA, USA
- affiliation (former): AT&T Labs, Florham Park, NJ, USA
- affiliation (former): Carnegie Mellon University, Department of Computer Science, Pittsburgh, PA, USA
- affiliation (former): University of Waterloo, Department of Computer Science, ON, Canada
- affiliation (former): Sharif University of Technology, Department of Computer Engineering, Tehran, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c211]Mohammad Hajiaghayi, Mohammad Mahdavi, Keivan Rezaei, Suho Shin:
Regret Analysis of Repeated Delegated Choice. AAAI 2024: 9757-9764- [c210]Max Springer, MohammadTaghi Hajiaghayi, Hadi Yami:
Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements. AAAI 2024: 9901-9908 - [c209]Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski:
Distributed Fast Crash-Tolerant Consensus with Nearly-Linear Quantum Communication. ICALP 2024: 80:1-80:19 - [c208]Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
A Dynamic Algorithm for Weighted Submodular Cover Problem. ICML 2024 - [c207]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz Rafal Kowalski, Jan Olkowski, Max Springer:
Dynamic Metric Embedding into lp Space. ICML 2024 - [c206]Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski:
Online Sampling and Decision Making with Low Entropy. IJCAI 2024: 4080-4088 - [c205]Mohammad Hajiaghayi
, Dariusz R. Kowalski, Jan Olkowski:
Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed? PODC 2024: 321-331 - [c204]Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi:
2-Approximation for Prize-Collecting Steiner Forest. SODA 2024: 669-693 - [c203]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Algorithms for Matroid Submodular Maximization. SODA 2024: 3485-3533 - [c202]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski:
Power of Posted-price Mechanisms for Prophet Inequalities. SODA 2024: 4580-4604 - [c201]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC. SPAA 2024: 293-295 - [c200]Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi:
Prize-Collecting Steiner Tree: A 1.79 Approximation. STOC 2024: 1641-1652 - [i111]Simina Brânzei, MohammadTaghi Hajiaghayi, Reed Phillips, Suho Shin, Kun Wang:
Dueling Over Dessert, Mastering the Art of Repeated Cake Cutting. CoRR abs/2402.08547 (2024) - [i110]Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi:
Prize-Collecting Steiner Tree: A 1.79 Approximation. CoRR abs/2405.03792 (2024) - [i109]Mohammad Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski:
Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why is a Lot of Randomness Needed? CoRR abs/2405.04762 (2024) - [i108]MohammadTaghi Hajiaghayi, Sébastien Lahaie, Keivan Rezaei, Suho Shin:
Ad Auctions for LLMs via Retrieval Augmented Generation. CoRR abs/2406.09459 (2024) - [i107]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski, Max Springer:
Dynamic Metric Embedding into ℓp Space. CoRR abs/2406.17210 (2024) - [i106]Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
A Dynamic Algorithm for Weighted Submodular Cover Problem. CoRR abs/2407.10003 (2024) - 2023
- [j101]Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Fast and Simple Solutions of Blotto Games. Oper. Res. 71(2): 506-516 (2023) - [j100]Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris:
Exponentially Faster Massively Parallel Maximal Matching. J. ACM 70(5): 34:1-34:18 (2023) - [c199]Kiarash Banihashem, Mohammad Hajiaghayi, Max Springer:
Optimal Sparse Recovery with Decision Stumps. AAAI 2023: 6745-6752 - [c198]MohammadTaghi Hajiaghayi, Max Springer:
Analysis of a Learning Based Algorithm for Budget Pacing. AAMAS 2023: 2709-2711 - [c197]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time. ICML 2023: 1660-1691 - [c196]Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi Hajiaghayi:
Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost. ICML 2023: 17218-17242 - [c195]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Non-monotone Submodular Maximization. NeurIPS 2023 - [c194]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Suho Shin, Aleksandrs Slivkins:
Bandit Social Learning under Myopic Behavior. NeurIPS 2023 - [c193]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Suho Shin, Max Springer:
An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits. NeurIPS 2023 - [c192]Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi Hajiaghayi:
Fair, Polylog-Approximate Low-Cost Hierarchical Clustering. NeurIPS 2023 - [c191]MohammadTaghi Hajiaghayi, Dariusz Rafal Kowalski, Jan Olkowski:
Brief Announcement: Improved Consensus in Quantum Networks. PODC 2023: 286-289 - [c190]José Correa, Andrés Cristi, Paul Duetting, MohammadTaghi Hajiaghayi, Jan Olkowski, Kevin Schewior:
Trading Prophets. EC 2023: 490-510 - [c189]Suho Shin, Keivan Rezaei, MohammadTaghi Hajiaghayi:
Delegating to Multiple Agents. EC 2023: 1081-1126 - [c188]AmirMohsen Ahanchi, Alexandr Andoni, MohammadTaghi Hajiaghayi, Marina Knittel, Peilin Zhong:
Massively Parallel Tree Embeddings for High Dimensional Spaces. SPAA 2023: 77-88 - [c187]Jacob Gilbert, MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin:
Location-Sensitive String Problems in MPC. SPAA 2023: 101-111 - [c186]Jacob Gilbert, MohammadTaghi Hajiaghayi:
Brief Announcement: Regular and Dyck Languages in MPC. SPAA 2023: 113-116 - [c185]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Weighted Edit Distance Computation: Strings, Trees, and Dyck. STOC 2023: 377-390 - [i105]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Weighted Edit Distance Computation: Strings, Trees and Dyck. CoRR abs/2302.04229 (2023) - [i104]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Suho Shin, Aleksandrs Slivkins:
Bandit Social Learning: Exploration under Myopic Behavior. CoRR abs/2302.07425 (2023) - [i103]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Max Springer:
Optimal Sparse Recovery with Decision Stumps. CoRR abs/2303.04301 (2023) - [i102]MohammadTaghi Hajiaghayi, Keivan Rezaei, Suho Shin:
Delegating to Multiple Agents. CoRR abs/2305.03203 (2023) - [i101]MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski:
Fault-Tolerant Consensus in Quantum Networks. CoRR abs/2305.10618 (2023) - [i100]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time. CoRR abs/2305.15192 (2023) - [i99]José Correa, Andrés Cristi, Paul Dütting, Mohammad Hajiaghayi, Jan Olkowski, Kevin Schewior:
Trading Prophets. CoRR abs/2305.15566 (2023) - [i98]MohammadTaghi Hajiaghayi, Max Springer, Hadi Yami:
Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements. CoRR abs/2305.16081 (2023) - [i97]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Algorithms for Matroid Submodular Maximization. CoRR abs/2306.00959 (2023) - [i96]Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi:
2-Approximation for Prize-Collecting Steiner Forest. CoRR abs/2309.05172 (2023) - [i95]MohammadTaghi Hajiaghayi, Mohammad Mahdavi, Keivan Rezaei, Suho Shin:
Regret Analysis of Repeated Delegated Choice. CoRR abs/2310.04884 (2023) - [i94]Kiarash Banihashem, Mohammad Taghi Hajiaghayi, Suho Shin, Max Springer:
An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits. CoRR abs/2310.19025 (2023) - [i93]Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh:
Dynamic Non-monotone Submodular Maximization. CoRR abs/2311.03685 (2023) - [i92]Soheil Feizi, MohammadTaghi Hajiaghayi, Keivan Rezaei, Suho Shin:
Online Advertisements with LLMs: Opportunities and Challenges. CoRR abs/2311.07601 (2023) - [i91]Marina Knittel, Max Springer, John P. Dickerson, MohammadTaghi Hajiaghayi:
Fair Polylog-Approximate Low-Cost Hierarchical Clustering. CoRR abs/2311.12501 (2023) - [i90]Seyed A. Esmaeili, MohammadTaghi Hajiaghayi, Suho Shin:
Replication-proof Bandit Mechanism Design. CoRR abs/2312.16896 (2023) - 2022
- [j99]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair allocation of indivisible goods: Beyond additive valuations. Artif. Intell. 303: 103633 (2022) - [j98]MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeedreza Seddighin, Xiaorui Sun:
Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier. SIAM J. Comput. 51(4): 1341-1367 (2022) - [c184]Alireza Farhadi, Jacob Gilbert, MohammadTaghi Hajiaghayi:
Generalized Stochastic Matching. AAAI 2022: 10008-10015 - [c183]Alireza Farhadi, MohammadTaghi Hajiaghayi, Elaine Shi:
Differentially Private Densest Subgraph. AISTATS 2022: 11581-11597 - [c182]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh:
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. FOCS 2022: 686-697 - [c181]Giorgi Kvernadze, Putu Ayu G. Sudyanti, Nishan Subedi, Mohammad Hajiaghayi:
Two is Better Than One: Dual Embeddings for Complementary Product Recommendations. ICKG 2022: 131-140 - [c180]MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su:
Adaptive Massively Parallel Constant-Round Tree Contraction. ITCS 2022: 83:1-83:23 - [c179]Max Springer, MohammadTaghi Hajiaghayi, Debmalya Panigrahi, Mohammad Reza Khani:
Online Algorithms for the Santa Claus Problem. NeurIPS 2022 - [c178]MohammadTaghi Hajiaghayi, Marina Knittel, Jan Olkowski, Hamed Saleh:
Adaptive Massively Parallel Algorithms for Cut Problems. SPAA 2022: 23-33 - [c177]Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski:
Improved communication complexity of fault-tolerant consensus. STOC 2022: 488-501 - [i89]MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski:
Improved Communication Complexity of Fault-Tolerant Consensus. CoRR abs/2203.12912 (2022) - [i88]MohammadTaghi Hajiaghayi, Max Springer:
Analysis of a Learning Based Algorithm for Budget Pacing. CoRR abs/2205.13330 (2022) - [i87]MohammadTaghi Hajiaghayi, Marina Knittel, Jan Olkowski, Hamed Saleh:
Adaptive Massively Parallel Algorithms for Cut Problems. CoRR abs/2205.14101 (2022) - [i86]Marina Knittel, John P. Dickerson, MohammadTaghi Hajiaghayi:
Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost. CoRR abs/2205.14198 (2022) - [i85]Alireza Farhadi, Jacob Gilbert, MohammadTaghi Hajiaghayi:
Generalized Stochastic Matching. CoRR abs/2205.14717 (2022) - [i84]Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski:
Optimal Algorithms for Free Order Multiple-Choice Secretary. CoRR abs/2207.10703 (2022) - [i83]Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh:
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. CoRR abs/2209.07524 (2022) - [i82]MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Debmalya Panigrahi, Max Springer:
Online Algorithms for the Santa Claus Problem. CoRR abs/2210.07333 (2022) - [i81]Giorgi Kvernadze, Putu Ayu G. Sudyanti, Nishan Subedi, Mohammad Hajiaghayi:
Two Is Better Than One: Dual Embeddings for Complementary Product Recommendations. CoRR abs/2211.14982 (2022) - 2021
- [j97]Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce. J. ACM 68(3): 19:1-19:41 (2021) - [j96]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods: Improvement. Math. Oper. Res. 46(3): 1038-1053 (2021) - [c176]Fotini Christia, Michael J. Curry, Constantinos Daskalakis, Erik D. Demaine, John P. Dickerson, MohammadTaghi Hajiaghayi, Adam Hesterberg, Marina Knittel, Aidan Milliff:
Scalable Equilibrium Computation in Multi-agent Influence Games on Networks. AAAI 2021: 5277-5285 - [c175]Alireza Farhadi, Mohammad Taghi Hajiaghayi, Mohamad Latifian, Masoud Seddighin, Hadi Yami:
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings. AAAI 2021: 5355-5362 - [c174]Kuan Cheng, Alireza Farhadi, MohammadTaghi Hajiaghayi, Zhengzhong Jin, Xin Li, Aviad Rubinstein, Saeed Seddighin, Yu Zheng:
Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence. ICALP 2021: 54:1-54:20 - [c173]MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin, Xiaorui Sun:
String Matching with Wildcards in the Massively Parallel Computation Model. SPAA 2021: 275-284 - [i80]MohammadTaghi Hajiaghayi, Marina Knittel:
Improved Hierarchical Clustering on Massive Datasets with Broad Guarantees. CoRR abs/2101.04818 (2021) - [i79]Alireza Farhadi, MohammadTaghi Hajiaghayi, Elaine Shi:
Differentially Private Densest Subgraph. CoRR abs/2106.00508 (2021) - [i78]MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su:
Adaptive Massively Parallel Constant-round Tree Contraction. CoRR abs/2111.01904 (2021) - 2020
- [j95]Behzad Ghazanfari, Fatemeh Afghah, Mohammad Taghi Hajiaghayi:
Inverse Feature Learning: Feature Learning Based on Representation Learning of Error. IEEE Access 8: 132937-132949 (2020) - [j94]Alireza Farhadi, Mohammad Taghi Hajiaghayi, Kasper Green Larsen, Elaine Shi:
Lower bounds for external memory integer sorting via network coding. Commun. ACM 63(10): 97-105 (2020) - [j93]David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick Duffield, Yu Gu, MohammadTaghi Hajiaghayi, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen:
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs. Oper. Res. 68(3): 896-926 (2020) - [j92]Rajesh Hemant Chitnis, Andreas Emil Feldmann, Mohammad Taghi Hajiaghayi, Dániel Marx:
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). SIAM J. Comput. 49(2): 318-364 (2020) - [j91]MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar:
Approximation algorithms for connected maximum cut and related problems. Theor. Comput. Sci. 814: 74-85 (2020) - [j90]Haipeng Chen, Mohammad Taghi Hajiaghayi, Sarit Kraus, Anshul Sawant, Edoardo Serra, V. S. Subrahmanian, Yanhai Xiong:
PIE: A Data-Driven Payoff Inference Engine for Strategic Security Applications. IEEE Trans. Comput. Soc. Syst. 7(1): 42-57 (2020) - [c172]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher:
Prophets, Secretaries, and Maximizing the Probability of Choosing the Best. AISTATS 2020: 3717-3727 - [c171]MohammadTaghi Hajiaghayi, Marina Knittel:
Matching Affinity Clustering: Improved Hierarchical Clustering at Scale with Guarantees. AAMAS 2020: 1864-1866 - [c170]Alireza Farhadi, Mohammad Taghi Hajiaghayi, Tung Mai, Anup Rao, Ryan A. Rossi:
Approximate Maximum Matching in Random Streams. SODA 2020: 1773-1785 - [c169]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi:
Stochastic matching with few queries: (1-ε) approximation. STOC 2020: 1111-1124 - [i77]Alireza Farhadi, MohammadTaghi Hajiaghayi, Aviad Rubinstein, Saeed Seddighin:
Streaming with Oracle: New Streaming Algorithms for Edit Distance and LCS. CoRR abs/2002.11342 (2020) - [i76]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi:
Stochastic Matching with Few Queries: (1-ε) Approximation. CoRR abs/2002.11880 (2020) - [i75]Behzad Ghazanfari, Fatemeh Afghah, MohammadTaghi Hajiaghayi:
Inverse Feature Learning: Feature learning based on Representation Learning of Error. CoRR abs/2003.03689 (2020) - [i74]MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun:
Approximating LCS in Linear Time: Beating the √n Barrier. CoRR abs/2003.07285 (2020) - [i73]Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohamad Latifian, Masoud Seddighin, Hadi Yami:
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings. CoRR abs/2007.07027 (2020)
2010 – 2019
- 2019
- [j89]Alireza Farhadi, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods to Asymmetric Agents. J. Artif. Intell. Res. 64: 1-20 (2019) - [j88]AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Brendan Lucier, Hamid Mahini, Saeed Seddighin:
From Duels to Battlefields: Computing Equilibria of Blotto and Other Games. Math. Oper. Res. 44(4): 1304-1325 (2019) - [j87]Mohammad Hossein Bateni, Mohammad Taghi Hajiaghayi, Silvio Lattanzi:
Introduction to the Special Issue for SPAA'17. ACM Trans. Parallel Comput. 6(3): 10:1 (2019) - [c168]Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher:
Online Pandora's Boxes and Bandits. AAAI 2019: 1885-1892 - [c167]Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Christos H. Papadimitriou, Saeed Seddighin:
Optimal Strategies of Blotto Games: Beyond Convexity. EC 2019: 597-616 - [c166]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh:
Streaming and Massively Parallel Algorithms for Edge Coloring. ESA 2019: 15:1-15:14 - [c165]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan:
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. FOCS 2019: 382-405 - [c164]Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris:
Exponentially Faster Massively Parallel Maximal Matching. FOCS 2019: 1637-1649 - [c163]MohammadAmin Ghiasi, MohammadTaghi Hajiaghayi, Sébastien Lahaie, Hadi Yami:
On the Efficiency and Equilibria of Rich Ads. IJCAI 2019: 301-307 - [c162]Soheil Behnezhad, Sebastian Brandt, Mahsa Derakhshan, Manuela Fischer, MohammadTaghi Hajiaghayi, Richard M. Karp, Jara Uitto:
Massively Parallel Computation of Matching and MIS in Sparse Graphs. PODC 2019: 481-490 - [c161]Avrim Blum, Nika Haghtalab, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Computing Stackelberg Equilibria of Large General-Sum Games. SAGT 2019: 168-182 - [c160]Soheil Behnezhad, Mahsa Derakhshan, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani:
Stochastic Matching on Uniformly Sparse Graphs. SAGT 2019: 357-373 - [c159]MohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi:
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs. SODA 2019: 1055-1068 - [c158]MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun:
Approximating LCS in Linear Time: Beating the √n Barrier. SODA 2019: 1181-1200 - [c157]MohammadTaghi Hajiaghayi, Saeed Seddighin, Xiaorui Sun:
Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence. SODA 2019: 1654-1672 - [c156]Soheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani:
Stochastic Matching with Few Queries: New Algorithms and Tools. SODA 2019: 2855-2874 - [c155]Mahdi Boroujeni, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin:
1+ε approximation of tree edit distance in quadratic time. STOC 2019: 709-720 - [c154]Alireza Farhadi, MohammadTaghi Hajiaghayi, Kasper Green Larsen, Elaine Shi:
Lower bounds for external memory integer sorting via network coding. STOC 2019: 997-1008 - [c153]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh:
Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring. DISC 2019: 36:1-36:3 - [i72]Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris:
Exponentially Faster Massively Parallel Maximal Matching. CoRR abs/1901.03744 (2019) - [i71]Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Christos H. Papadimitriou, Saeed Seddighin:
Optimal Strategies of Blotto Games: Beyond Convexity. CoRR abs/1901.04153 (2019) - [i70]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher:
Online Pandora's Boxes and Bandits. CoRR abs/1901.10698 (2019) - [i69]MohammadTaghi Hajiaghayi, Silvio Lattanzi, Saeed Seddighin, Cliff Stein:
MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond. CoRR abs/1905.01748 (2019) - [i68]Mahdi Boroujeni, Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Saeed Seddighin:
Subcubic Equivalences Between Graph Centrality Measures and Complementary Problems. CoRR abs/1905.08127 (2019) - [i67]Avrim Blum, Nika Haghtalab, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Computing Stackelberg Equilibria of Large General-Sum Games. CoRR abs/1909.03319 (2019) - [i66]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan:
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. CoRR abs/1909.03478 (2019) - [i65]Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Brendan Lucier, Michael Mitzenmacher:
Prophets, Secretaries, and Maximizing the Probability of Choosing the Best. CoRR abs/1910.03798 (2019) - [i64]MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin, Xiaorui Sun:
Massively Parallel Algorithms for String Matching with Wildcards. CoRR abs/1910.11829 (2019) - [i63]Rajesh Chitnis, Andreas Emil Feldmann, MohammadTaghi Hajiaghayi, Dániel Marx:
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). CoRR abs/1911.13161 (2019) - [i62]Alireza Farhadi, MohammadTaghi Hajiaghayi, Tung Mai, Anup Rao, Ryan A. Rossi:
Approximate Maximum Matching in Random Streams. CoRR abs/1912.10497 (2019) - 2018
- [j86]Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Manish Purohit, Kanthi K. Sarpatwar:
On maximum leaf trees and connections to connected maximum cut problems. Inf. Process. Lett. 129: 31-34 (2018) - [j85]Mohammad Hossein Bateni, Mohammad Taghi Hajiaghayi, Vahid Liaghat:
Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems. SIAM J. Comput. 47(4): 1275-1293 (2018) - [j84]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak:
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond. ACM Trans. Algorithms 14(4): 48:1-48:23 (2018) - [c152]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin:
Greedy Algorithms for Online Survivable Network Design. ICALP 2018: 152:1-152:14 - [c151]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni:
Brief Announcement: MapReduce Algorithms for Massive Trees. ICALP 2018: 162:1-162:4 - [c150]Alireza Farhadi, MohammadTaghi Hajiaghayi:
On the Complexity of Chore Division. IJCAI 2018: 226-232 - [c149]Soheil Behnezhad, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Saeed Seddighin:
Spatio-Temporal Games Beyond One Dimension. EC 2018: 411-428 - [c148]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods: Improvements and Generalizations. EC 2018: 539-556 - [c147]Mohammad Taghi Hajiaghayi, Mohammad Reza Khani, Saeed Seddighin:
Frugal Auction Design for Set Systems: Vertex Cover and Knapsack. EC 2018: 645-662 - [c146]Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, Sahil Singla:
Prophet Secretary for Combinatorial Auctions and Matroids. SODA 2018: 700-714 - [c145]Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Saeed Seddighin:
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce. SODA 2018: 1170-1189 - [c144]Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Christos H. Papadimitriou, Ronald L. Rivest, Saeed Seddighin, Philip B. Stark:
From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games. SODA 2018: 2291-2310 - [c143]Sina Dehghani, Alireza Farhadi, Mohammad Taghi Hajiaghayi, Hadi Yami:
Envy-free Chore Division for An Arbitrary Number of Agents. SODA 2018: 2564-2583 - [c142]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein:
Fast algorithms for knapsack via convolution and prediction. STOC 2018: 1269-1282 - [i61]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi:
Brief Announcement: Semi-MapReduce Meets Congested Clique. CoRR abs/1802.10297 (2018) - [i60]Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Saeed Seddighin:
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce. CoRR abs/1804.04178 (2018) - [i59]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Richard M. Karp:
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching. CoRR abs/1807.06701 (2018) - [i58]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni:
Massively Parallel Dynamic Programming on Trees. CoRR abs/1809.03685 (2018) - [i57]Alireza Farhadi, MohammadTaghi Hajiaghayi, Kasper Green Larsen, Elaine Shi:
Lower Bounds for External Memory Integer Sorting via Network Coding. CoRR abs/1811.01313 (2018) - [i56]Soheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani:
Stochastic Matching with Few Queries: New Algorithms and Tools. CoRR abs/1811.03224 (2018) - [i55]MohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi:
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs. CoRR abs/1811.04052 (2018) - [i54]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein:
Fast Algorithms for Knapsack via Convolution and Prediction. CoRR abs/1811.12554 (2018) - 2017
- [j83]Rajesh Chitnis, Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin:
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands. Algorithmica 77(4): 1216-1239 (2017) - [j82]Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor:
A greedy approximation algorithm for minimum-gap scheduling. J. Sched. 20(3): 279-292 (2017) - [j81]MohammadTaghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi:
Online Node-weighted Steiner Forest and Extensions via Disk Paintings. SIAM J. Comput. 46(3): 911-935 (2017) - [j80]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh:
Prophet Secretary. SIAM J. Discret. Math. 31(3): 1685-1701 (2017) - [j79]Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Bi-Covering: Covering Edges with Two Small Subsets of Vertices. SIAM J. Discret. Math. 31(4): 2626-2646 (2017) - [c141]Melika Abolhassani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Brendan Lucier, Hadi Yami:
Market Pricing for Data Streams. AAAI 2017: 291-297 - [c140]Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. AAAI 2017: 369-375 - [c139]Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohammad Ghodsi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods to Asymmetric Agents. AAMAS 2017: 1535-1537 - [c138]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin:
Stochastic k-Server: How Should Uber Work?. ICALP 2017: 126:1-126:14 - [c137]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, Vahab S. Mirrokni:
Affinity Clustering: Hierarchical Clustering at Scale. NIPS 2017: 6864-6874 - [c136]Soheil Behnezhad, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Aleksandrs Slivkins:
A Polynomial Time Algorithm for Spatio-Temporal Security Games. EC 2017: 697-714 - [c135]Melika Abolhassani, Soheil Ehsani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Robert D. Kleinberg, Brendan Lucier:
Beating 1-1/e for ordered prophets. STOC 2017: 61-71 - [e3]Christian Scheideler, Mohammad Taghi Hajiaghayi:
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. ACM 2017, ISBN 978-1-4503-4593-4 [contents] - [i53]Alireza Farhadi, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods to Asymmetric Agents. CoRR abs/1703.01649 (2017) - [i52]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods: Improvement and Generalization. CoRR abs/1704.00222 (2017) - [i51]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Harald Räcke:
Online Degree-Bounded Steiner Network Design. CoRR abs/1704.05430 (2017) - [i50]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Harald Räcke, Saeed Seddighin:
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. CoRR abs/1704.05811 (2017) - [i49]Melika Abolhassani, Soheil Ehsani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Robert Kleinberg, Brendan Lucier:
Beating 1-1/e for Ordered Prophets. CoRR abs/1704.05836 (2017) - [i48]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin:
Stochastic k-Server: How Should Uber Work? CoRR abs/1705.05755 (2017) - [i47]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Aleksandrs Slivkins:
A Polynomial Time Algorithm for Spatio-Temporal Security Games. CoRR abs/1706.05711 (2017) - [i46]Alireza Farhadi, MohammadTaghi Hajiaghayi:
On the Complexity of Chore Division. CoRR abs/1710.00271 (2017) - [i45]Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, Sahil Singla:
Prophet Secretary for Combinatorial Auctions and Matroids. CoRR abs/1710.11213 (2017) - 2016
- [j78]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
On Fixed Cost k-Flow Problems. Theory Comput. Syst. 58(1): 4-18 (2016) - [j77]Rajesh Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk:
Designing FPT Algorithms for Cut Problems Using Randomized Contractions. SIAM J. Comput. 45(4): 1171-1229 (2016) - [j76]Peixin Gao, Hui Miao, John S. Baras, MohammadTaghi Hajiaghayi:
Social network ad allocation and optimization: a geometric mapping-based approach. Soc. Netw. Anal. Min. 6(1): 110:1-110:23 (2016) - [j75]Mohammad Taghi Hajiaghayi, Wei Hu, Jian Li, Shi Li, Barna Saha:
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median. ACM Trans. Algorithms 12(3): 36:1-36:19 (2016) - [j74]Mohammad Taghi Hajiaghayi, Rohit Khandekar, Mohammad Reza Khani, Guy Kortsarz:
Approximation Algorithms for Movement Repairmen. ACM Trans. Algorithms 12(4): 54:1-54:38 (2016) - [c134]AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Brendan Lucier, Hamid Mahini, Saeed Seddighin:
From Duels to Battlefields: Computing Equilibria of Blotto and Other Games. AAAI 2016: 376-382 - [c133]Melika Abolhassani, T.-H. Hubert Chan, Fei Chen, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Hamid Mahini, Xiaowei Wu:
Beating Ratio 0.5 for Weighted Oblivious Matching Problems. ESA 2016: 3:1-3:18 - [c132]Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Bicovering: Covering Edges With Two Small Subsets of Vertices. ICALP 2016: 6:1-6:12 - [c131]Sina Dehghani, Mohammad Taghi Hajiaghayi, Hamid Mahini, Saeed Seddighin:
Price of Competition and Dueling Games. ICALP 2016: 21:1-21:14 - [c130]Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Harald Räcke, Saeed Seddighin:
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. ICALP 2016: 42:1-42:14 - [c129]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh:
Finding Large Matchings in Semi-Streaming. ICDM Workshops 2016: 608-614 - [c128]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Online Degree-Bounded Steiner Network Design. SODA 2016: 164-175 - [c127]Rajesh Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova:
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams. SODA 2016: 1326-1344 - [c126]Hossein Esfandiari, MohammadTaghi Hajiaghayi, David P. Woodruff:
Brief Announcement: Applications of Uniform Sampling: Densest Subgraph and Beyond. SPAA 2016: 397-399 - [c125]MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx:
A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting. STOC 2016: 570-583 - [e2]Mohammad Taghi Hajiaghayi, Mohammad Reza Mousavi:
Topics in Theoretical Computer Science - The First IFIP WG 1.8 International Conference, TTCS 2015, Tehran, Iran, August 26-28, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9541, Springer 2016, ISBN 978-3-319-28677-8 [contents] - [r8]Mohammad Taghi Hajiaghayi, Erik D. Demaine:
Approximation Schemes for Planar Graph Problems. Encyclopedia of Algorithms 2016: 133-137 - [r7]Mohammad Taghi Hajiaghayi, Hamid Mahini:
Bargaining Networks. Encyclopedia of Algorithms 2016: 174-177 - [r6]Fedor V. Fomin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Bidimensionality. Encyclopedia of Algorithms 2016: 203-207 - [r5]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam:
Network Creation Games. Encyclopedia of Algorithms 2016: 1408-1412 - [r4]Mohammad Taghi Hajiaghayi, Vahid Liaghat:
Prophet Inequality and Online Auctions. Encyclopedia of Algorithms 2016: 1634-1636 - [r3]Rajesh Chitnis, Mohammad Taghi Hajiaghayi:
Shadowless Solutions for Fixed-Parameter Tractability of Directed Graphs. Encyclopedia of Algorithms 2016: 1963-1966 - [i44]Mahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Brendan Lucier, Hamid Mahini, Saeed Seddighin:
From Duels to Battefields: Computing Equilibria of Blotto and Other Games. CoRR abs/1603.00119 (2016) - [i43]Sina Dehghani, MohammadTaghi Hajiaghayi, Hamid Mahini, Saeed Seddighin:
Price of Competition and Dueling Games. CoRR abs/1605.04004 (2016) - [i42]David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, MohammadTaghi Hajiaghayi, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen:
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs. CoRR abs/1611.01210 (2016) - [i41]Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Saeed Seddighin:
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. CoRR abs/1612.04029 (2016) - [i40]Mohammad Taghi Hajiaghayi, Amey Bhangale, Rajiv Gandhi, Rohit Khandekar, Guy Kortsarz:
Bicovering: Covering edges with two small subsets of vertices. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j73]Hans L. Bodlaender, MohammadTaghi Hajiaghayi, Giuseppe F. Italiano:
Editorial. Algorithmica 73(4): 748-749 (2015) - [j72]Hans L. Bodlaender, Mohammad Taghi Hajiaghayi, Giuseppe F. Italiano:
Erratum to: Editorial. Algorithmica 73(4): 750 (2015) - [j71]Rajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi, Dániel Marx:
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable. ACM Trans. Algorithms 11(4): 28:1-28:28 (2015) - [j70]Anshul Sawant, John P. Dickerson, Mohammad Taghi Hajiaghayi, V. S. Subrahmanian:
Automated Generation of Counterterrorism Policies Using Multiexpert Input. ACM Trans. Intell. Syst. Technol. 6(4): 44:1-44:27 (2015) - [c124]Hui Miao, Peixin Gao, MohammadTaghi Hajiaghayi, John S. Baras:
HyperCubeMap: Optimal Social Network Ad Allocation Using Hyperbolic Embedding. ASONAM 2015: 357-362 - [c123]Melika Abolhassani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, Aravind Srinivasan:
Selling Tomorrow's Bargains Today. AAMAS 2015: 337-345 - [c122]MohammadHossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Revenue Maximization for Selling Multiple Correlated Items. ESA 2015: 95-105 - [c121]Hossein Efsandiari, Mohammad Taghi Hajiaghayi, Jochen Könemann, Hamid Mahini, David L. Malec, Laura Sanità:
Approximate Deadline-Scheduling with Precedence Constraints. ESA 2015: 483-495 - [c120]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh:
Prophet Secretary. ESA 2015: 496-508 - [c119]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar:
Approximation Algorithms for Connected Maximum Cut and Related Problems. ESA 2015: 693-704 - [c118]AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Hamid Mahini, Saeed Seddighin, Sadra Yazdanbod:
Forming external behaviors by leveraging internal opinions. INFOCOM 2015: 1849-1857 - [c117]Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak:
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond. SODA 2015: 1217-1233 - [c116]Rajesh Hemant Chitnis, Graham Cormode, Mohammad Taghi Hajiaghayi, Morteza Monemizadeh:
Parameterized Streaming: Maximal Matching and Vertex Cover. SODA 2015: 1234-1251 - [c115]Rajesh Hemant Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh:
Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond. SPAA 2015: 56-58 - [c114]Kotaro Hara, Mohammad Taghi Hajiaghayi, Benjamin B. Bederson:
FluTCHA: Using Fluency to Distinguish Humans from Computers. WWW (Companion Volume) 2015: 43-44 - [i39]Rajesh Hemant Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova:
Kernelization via Sampling with Applications to Dynamic Graph Streams. CoRR abs/1505.01731 (2015) - [i38]Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin:
A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands. CoRR abs/1506.03760 (2015) - [i37]Hossein Esfandiari, MohammadTaghi Hajiaghayi, David P. Woodruff:
Applications of Uniform Sampling: Densest Subgraph and Beyond. CoRR abs/1506.04505 (2015) - [i36]Gagan Goel, MohammadTaghi Hajiaghayi, Mohammad Reza Khani:
Randomized Revenue Monotone Mechanisms for Online Advertising. CoRR abs/1507.00130 (2015) - [i35]MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar:
Approximation Algorithms for Connected Maximum Cut and Related Problems. CoRR abs/1507.00648 (2015) - [i34]Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Jochen Könemann, Hamid Mahini, David L. Malec, Laura Sanità:
Approximate Deadline-Scheduling with Precedence Constraints. CoRR abs/1507.00748 (2015) - [i33]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh:
Prophet Secretary. CoRR abs/1507.01155 (2015) - 2014
- [j69]Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat:
On a Local Protocol for Concurrent File Transfers. Theory Comput. Syst. 55(3): 613-636 (2014) - [j68]Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Panagiotis Kanellopoulos, Tom Leighton:
Correction: Basic Network Creation Games. SIAM J. Discret. Math. 28(3): 1638-1640 (2014) - [j67]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Philip N. Klein:
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. ACM Trans. Algorithms 10(3): 13:1-13:20 (2014) - [j66]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dániel Marx:
Minimizing Movement: Fixed-Parameter Tractability. ACM Trans. Algorithms 11(2): 14:1-14:29 (2014) - [j65]Mahdi Hajiaghayi, Carl Wijting, Cássio B. Ribeiro, Mohammad Taghi Hajiaghayi:
Efficient and practical resource block allocation for LTE-based D2D network via graph coloring. Wirel. Networks 20(4): 611-624 (2014) - [c113]Hossein Esfandiari, MohammadTaghi Hajiaghayi, Mohammad Reza Khani, Vahid Liaghat, Hamid Mahini, Harald Räcke:
Online Stochastic Reordering Buffer Scheduling. ICALP (1) 2014: 465-476 - [c112]MohammadTaghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi:
Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems. ICALP (1) 2014: 576-587 - [c111]Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin:
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract). IPEC 2014: 159-171 - [c110]MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec:
The polarizing effect of network influences. EC 2014: 131-148 - [c109]MohammadTaghi Hajiaghayi, Wei Hu, Jian Li, Shi Li, Barna Saha:
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median. SODA 2014: 1-12 - [c108]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx:
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). SODA 2014: 1782-1801 - [c107]Mohammad Taghi Hajiaghayi, Theodore Johnson, Mohammad Reza Khani, Barna Saha:
Hierarchical graph partitioning. SPAA 2014: 51-60 - [c106]Melika Abolhassani, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Hamid Mahini, Anshul Sawant:
Network Cournot Competition. WINE 2014: 15-29 - [c105]Gagan Goel, MohammadTaghi Hajiaghayi, Mohammad Reza Khani:
Randomized Revenue Monotone Mechanisms for Online Advertising. WINE 2014: 324-337 - [c104]AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Hamid Mahini, Saeed Seddighin, Sadra Yazdanbod:
How effectively can we form opinions? WWW (Companion Volume) 2014: 213-214 - [c103]Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, S. Raghavan, Anshul Sawant, Morteza Zadimoghaddam:
How to influence people with partial incentives. WWW 2014: 937-948 - [i32]Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, S. Raghavan, Anshul Sawant, Morteza Zadimoghaddam:
How to Influence People with Partial Incentives. CoRR abs/1401.7970 (2014) - [i31]Rajesh Hemant Chitnis, Graham Cormode, Mohammad Taghi Hajiaghayi, Morteza Monemizadeh:
Parameterized Streaming Algorithms for Vertex Cover. CoRR abs/1405.0093 (2014) - [i30]Melika Abolhassani, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Hamid Mahini, Anshul Sawant:
Network Cournot Competition. CoRR abs/1405.1794 (2014) - [i29]MohammadHossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Revenue Maximization for Selling Multiple Correlated Items. CoRR abs/1412.3187 (2014) - 2013
- [j64]Erik D. Demaine, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam:
Scheduling to minimize gaps and power consumption. J. Sched. 16(2): 151-160 (2013) - [j63]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx:
Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset. SIAM J. Comput. 42(4): 1674-1696 (2013) - [j62]Noga Alon, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Tom Leighton:
Basic Network Creation Games. SIAM J. Discret. Math. 27(2): 656-668 (2013) - [j61]MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Morteza Zadimoghaddam:
Submodular secretary problem and extensions. ACM Trans. Algorithms 9(4): 32:1-32:23 (2013) - [c102]Saeed Alaei, MohammadTaghi Hajiaghayi, Vahid Liaghat:
The Online Stochastic Generalized Assignment Problem. APPROX-RANDOM 2013: 11-25 - [c101]MohammadTaghi Hajiaghayi, Rohit Khandekar, M. Reza Khani, Guy Kortsarz:
Approximation Algorithms for Movement Repairmen. APPROX-RANDOM 2013: 218-232 - [c100]John P. Dickerson, Anshul Sawant, Mohammad Taghi Hajiaghayi, V. S. Subrahmanian:
PREVE: a policy recommendation engine based on vector equilibria applied to reducing LeT's attacks. ASONAM 2013: 1084-1091 - [c99]Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor:
A Greedy Approximation Algorithm for Minimum-Gap Scheduling. CIAC 2013: 97-109 - [c98]Mohammad Taghi Hajiaghayi, Vahid Liaghat, Debmalya Panigrahi:
Online Node-Weighted Steiner Forest and Extensions via Disk Paintings. FOCS 2013: 558-567 - [c97]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems. ICALP (1) 2013: 81-92 - [c96]Li Erran Li, Vahid Liaghat, Hongze Zhao, MohammadTaghi Hajiaghayi, Dan Li, Gordon T. Wilfong, Yang Richard Yang, Chuanxiong Guo:
PACE: Policy-Aware Application Cloud Embedding. INFOCOM 2013: 638-646 - [c95]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz:
Fixed-Parameter and Approximation Algorithms: A New Look. IPEC 2013: 110-122 - [c94]MohammadTaghi Hajiaghayi, Hamid Mahini, Anshul Sawant:
Scheduling a Cascade with Opposing Influences. SAGT 2013: 195-206 - [c93]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Jonathan Katz, Koyel Mukherjee:
Brief announcement: a game-theoretic model motivated by the darpa network challenge. SPAA 2013: 115-118 - [c92]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
On Fixed Cost k-Flow Problems. WAOA 2013: 49-60 - [i28]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems. CoRR abs/1304.7530 (2013) - [i27]MohammadTaghi Hajiaghayi, Rohit Khandekar, M. Reza Khani, Guy Kortsarz:
Approximation Algorithms for Movement Repairmen. CoRR abs/1306.3739 (2013) - [i26]Mohammad Taghi Hajiaghayi, Wei Hu, Jian Li, Shi Li, Barna Saha:
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median. CoRR abs/1307.2808 (2013) - [i25]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz:
Fixed-Parameter and Approximation Algorithms: A New Look. CoRR abs/1308.3520 (2013) - [i24]Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
The Foundations of Fixed Parameter Inapproximability. CoRR abs/1310.2711 (2013) - [i23]MohammadTaghi Hajiaghayi, Hamid Mahini, Anshul Sawant:
Scheduling a Cascade with Opposing Influences. CoRR abs/1311.5925 (2013) - [i22]Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos:
Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121). Dagstuhl Reports 3(3): 51-74 (2013) - 2012
- [j60]MohammadHossein Bateni, MohammadTaghi Hajiaghayi:
Euclidean Prize-Collecting Steiner Forest. Algorithmica 62(3-4): 906-929 (2012) - [j59]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Local Search Algorithms for the Red-Blue Median Problem. Algorithmica 63(4): 795-814 (2012) - [j58]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam:
The price of anarchy in network creation games. ACM Trans. Algorithms 8(2): 13:1-13:13 (2012) - [j57]MohammadHossein Bateni, MohammadTaghi Hajiaghayi:
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location. ACM Trans. Algorithms 8(3): 20:1-20:19 (2012) - [j56]Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Prize-collecting steiner network problems. ACM Trans. Algorithms 9(1): 2:1-2:13 (2012) - [j55]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre:
The checkpoint problem. Theor. Comput. Sci. 452: 88-99 (2012) - [c91]Marek Cygan, MohammadTaghi Hajiaghayi, Samir Khuller:
LP Rounding for k-Centers with Non-uniform Hard Capacities. FOCS 2012: 273-282 - [c90]Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk:
Designing FPT Algorithms for Cut Problems Using Randomized Contractions. FOCS 2012: 460-469 - [c89]Rajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi, Dániel Marx:
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable. ICALP (1) 2012: 230-241 - [c88]Suk-Bok Lee, Dan Pei, MohammadTaghi Hajiaghayi, Ioannis Pefkianakis, Songwu Lu, He Yan, Zihui Ge, Jennifer Yates, Mario Kosseifi:
Threshold compression for 3G scalable monitoring. INFOCOM 2012: 1350-1358 - [c87]Saeed Alaei, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Online prophet-inequality matching with applications to ad allocation. EC 2012: 18-35 - [c86]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Philip N. Klein, Claire Mathieu:
A polynomial-time approximation scheme for planar multiway cut. SODA 2012: 639-655 - [c85]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx:
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. SODA 2012: 1713-1725 - [i21]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Jonathan Katz, Koyel Mukherjee:
A Game-Theoretic Model Motivated by the DARPA Network Challenge. CoRR abs/1204.6552 (2012) - [i20]Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Dániel Marx:
Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable. CoRR abs/1205.1271 (2012) - [i19]Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx:
Minimizing Movement: Fixed-Parameter Tractability. CoRR abs/1205.6960 (2012) - [i18]Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk:
Designing FPT algorithms for cut problems using randomized contractions. CoRR abs/1207.4079 (2012) - [i17]Marek Cygan, MohammadTaghi Hajiaghayi, Samir Khuller:
LP Rounding for k-Centers with Non-uniform Hard Capacities. CoRR abs/1208.3054 (2012) - 2011
- [j54]Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff:
Improved Approximation Algorithms for Label Cover Problems. Algorithmica 61(1): 190-206 (2011) - [j53]Jeffrey Erman, Alexandre Gerber, Mohammad Taghi Hajiaghayi, Dan Pei, Subhabrata Sen, Oliver Spatscheck:
To Cache or Not to Cache: The 3G Case. IEEE Internet Comput. 15(2): 27-34 (2011) - [j52]MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Dániel Marx:
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth. J. ACM 58(5): 21:1-21:37 (2011) - [j51]MohammadHossein Bateni, Lukasz Golab, MohammadTaghi Hajiaghayi, Howard J. Karloff:
Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses. Theory Comput. Syst. 49(4): 757-780 (2011) - [j50]Aaron Archer, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Howard J. Karloff:
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP. SIAM J. Comput. 40(2): 309-332 (2011) - [c84]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Parameterized Complexity of Problems in Coalitional Resource Games. AAAI 2011: 620-625 - [c83]Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, Mohammad Taghi Hajiaghayi, David S. Johnson, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen:
Disjoint-Path Facility Location: Theory and Practice. ALENEX 2011: 60-74 - [c82]Saeed Alaei, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Dan Pei, Barna Saha:
AdCell: Ad Allocation in Cellular Networks. ESA 2011: 311-322 - [c81]MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Sina Jafarpour, Dan Pei:
Towards an efficient algorithmic framework for pricing cellular data service. INFOCOM 2011: 581-585 - [c80]Suk-Bok Lee, Dan Pei, MohammadTaghi Hajiaghayi, Ioannis Pefkianakis, Songwu Lu, He Yan, Zihui Ge, Jennifer Yates, Mario Kosseifi:
Scalable monitoring via threshold compression in a large operational 3G network. SIGMETRICS 2011: 135-136 - [c79]Matthew Andrews, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Ankur Moitra:
Capacitated Metric Labeling. SODA 2011: 976-995 - [c78]MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dániel Marx:
Prize-collecting Steiner Problems on Planar Graphs. SODA 2011: 1028-1049 - [c77]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat:
On a local protocol for concurrent file transfers. SPAA 2011: 269-278 - [c76]Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi:
Contraction decomposition in h-minor-free graphs and algorithmic applications. STOC 2011: 441-450 - [i16]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Parameterized Complexity of Problems in Coalitional Resource Games. CoRR abs/1105.0707 (2011) - [i15]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Combinatorial Algorithms for Capacitated Network Design. CoRR abs/1108.1176 (2011) - [i14]Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx:
Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset. CoRR abs/1110.0259 (2011) - [i13]Saeed Alaei, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Dan Pei, Barna Saha:
AdCell: Ad Allocation in Cellular Networks. CoRR abs/1112.5396 (2011) - 2010
- [j49]Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao:
l22 Spreading Metrics for Vertex Ordering Problems. Algorithmica 56(4): 577-604 (2010) - [j48]Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar:
Approximation algorithms via contraction decomposition. Comb. 30(5): 533-552 (2010) - [j47]Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design. SIAM J. Comput. 39(5): 1772-1798 (2010) - [j46]Anupam Gupta, Mohammad Taghi Hajiaghayi, Viswanath Nagarajan, R. Ravi:
Dial a Ride from k-forest. ACM Trans. Algorithms 6(2): 41:1-41:21 (2010) - [j45]Mohammad Taghi Hajiaghayi, Shang-Hua Teng:
Foreword to special issue on SODA 2008. ACM Trans. Algorithms 6(4): 58:1 (2010) - [j44]Jonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus:
Deploying sensor networks with guaranteed fault tolerance. IEEE/ACM Trans. Netw. 18(1): 216-228 (2010) - [j43]MohammadHossein Bateni, Alexandre Gerber, Mohammad Taghi Hajiaghayi, Subhabrata Sen:
Multi-VPN Optimization for Scalable Routing via Relaying. IEEE/ACM Trans. Netw. 18(5): 1544-1556 (2010) - [c75]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Morteza Zadimoghaddam:
Submodular Secretary Problem and Extensions. APPROX-RANDOM 2010: 39-52 - [c74]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre:
The Checkpoint Problem. APPROX-RANDOM 2010: 219-231 - [c73]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz:
Budgeted Red-Blue Median and Its Generalizations. ESA (1) 2010: 314-325 - [c72]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Nicole Immorlica, Hamid Mahini:
The Cooperative Game Theory Foundations of Network Bargaining Games. ICALP (1) 2010: 67-78 - [c71]MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Prize-Collecting Steiner Network Problems. IPCO 2010: 71-84 - [c70]MohammadHossein Bateni, MohammadTaghi Hajiaghayi:
Euclidean Prize-Collecting Steiner Forest. LATIN 2010: 503-514 - [c69]MohammadTaghi Hajiaghayi, Arefeh A. Nasri:
Prize-Collecting Steiner Networks via Iterative Rounding. LATIN 2010: 515-526 - [c68]Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi:
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. SODA 2010: 329-344 - [c67]Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton:
Basic network creation games. SPAA 2010: 106-113 - [c66]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx:
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. STOC 2010: 211-220 - [i12]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Nicole Immorlica, Hamid Mahini:
The cooperative game theory foundations of network bargaining games. CoRR abs/1004.4317 (2010) - [i11]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx:
Prize-collecting Network Design on Planar Graphs. CoRR abs/1006.4339 (2010)
2000 – 2009
- 2009
- [j42]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. Algorithmica 53(1): 89-103 (2009) - [j41]Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi:
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. Algorithmica 54(2): 142-180 (2009) - [j40]MohammadHossein Bateni, Mohammad Taghi Hajiaghayi:
A note on the subadditive network design problem. Oper. Res. Lett. 37(5): 339-344 (2009) - [j39]Steve Butler, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton:
Hat Guessing Games. SIAM Rev. 51(2): 399-413 (2009) - [j38]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam:
The price of anarchy in cooperative network creation games. SIGecom Exch. 8(2): 2 (2009) - [j37]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam:
Minimizing movement. ACM Trans. Algorithms 5(3): 30:1-30:30 (2009) - [c65]Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff:
Improved Approximation Algorithms for Label Cover Problems. ESA 2009: 23-34 - [c64]Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx:
Minimizing Movement: Fixed-Parameter Tractability. ESA 2009: 718-729 - [c63]Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff:
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP. FOCS 2009: 427-436 - [c62]Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi:
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. ICALP (1) 2009: 316-327 - [c61]Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein:
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. ICALP (1) 2009: 328-340 - [c60]MohammadHossein Bateni, Alexandre Gerber, Mohammad Taghi Hajiaghayi, Subhabrata Sen:
Multi-VPN Optimization for Scalable Routing via Relaying. INFOCOM 2009: 2756-2760 - [c59]MohammadHossein Bateni, MohammadTaghi Hajiaghayi:
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location. SODA 2009: 805-814 - [c58]Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi:
Additive approximation algorithms for list-coloring minor-closed class of graphs. SODA 2009: 1166-1175 - [c57]MohammadHossein Bateni, Lukasz Golab, Mohammad Taghi Hajiaghayi, Howard J. Karloff:
Scheduling to minimize staleness and stretch in real-time data warehouses. SPAA 2009: 29-38 - [c56]Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam:
The Price of Anarchy in Cooperative Network Creation Games. STACS 2009: 301-312 - [c55]Mangesh Gupte, MohammadTaghi Hajiaghayi, Lu Han, Liviu Iftode, Pravin Shankar, Raluca M. Ursu:
News Posting by Strategic Users in a Social Network. WINE 2009: 632-639 - [c54]Jeffrey Erman, Alexandre Gerber, Mohammad Taghi Hajiaghayi, Dan Pei, Oliver Spatscheck:
Network-aware forward caching. WWW 2009: 291-300 - [e1]Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx:
Parameterized complexity and approximation algorithms, 13.12. - 17.12.2009. Dagstuhl Seminar Proceedings 09511, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i10]Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx:
09511 Abstracts Collection - Parameterized complexity and approximation algorithms. Parameterized complexity and approximation algorithms 2009 - [i9]Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx:
09511 Executive Summary - Parameterized complexity and approximation algorithms. Parameterized complexity and approximation algorithms 2009 - [i8]Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx:
09511 Open Problems - Parameterized complexity and approximation algorithms. Parameterized complexity and approximation algorithms 2009 - [i7]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam:
The Price of Anarchy in Cooperative Network Creation Games. CoRR abs/0902.1400 (2009) - [i6]MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx:
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth. CoRR abs/0911.5143 (2009) - [i5]MohammadHossein Bateni, Mohammad Taghi Hajiaghayi:
Euclidean Prize-collecting Steiner Forest. CoRR abs/0912.1137 (2009) - 2008
- [j36]Erik D. Demaine, MohammadTaghi Hajiaghayi:
The Bidimensionality Theory and Its Algorithmic Applications. Comput. J. 51(3): 292-302 (2008) - [j35]Erik D. Demaine, MohammadTaghi Hajiaghayi:
Linearity of grid minors in treewidth with applications through bidimensionality. Comb. 28(1): 19-36 (2008) - [j34]Uriel Feige, MohammadTaghi Hajiaghayi, James R. Lee:
Improved Approximation Algorithms for Minimum Weight Vertex Separators. SIAM J. Comput. 38(2): 629-657 (2008) - [j33]Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour:
Combination Can Be Hard: Approximability of the Unique Coverage Problem. SIAM J. Comput. 38(4): 1464-1483 (2008) - [j32]Steve Butler, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton:
Hat Guessing Games. SIAM J. Discret. Math. 22(2): 592-605 (2008) - [j31]Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos:
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. ACM Trans. Algorithms 4(4): 46:1-46:21 (2008) - [c53]Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam:
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. APPROX-RANDOM 2008: 21-34 - [c52]Avrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, Aaron Roth:
Regret minimization and the price of total anarchy. STOC 2008: 373-382 - [r2]Erik D. Demaine, MohammadTaghi Hajiaghayi:
Approximation Schemes for Planar Graph Problems. Encyclopedia of Algorithms 2008 - [r1]Erik D. Demaine, MohammadTaghi Hajiaghayi:
Bidimensionality. Encyclopedia of Algorithms 2008 - 2007
- [j30]MohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Mohammad Moharrami:
Plane Embeddings of Planar Graph Metrics. Discret. Comput. Geom. 38(3): 615-637 (2007) - [j29]Erik D. Demaine, Mohammad Taghi Hajiaghayi:
Quickly deciding minor-closed parameters in general graphs. Eur. J. Comb. 28(1): 311-314 (2007) - [j28]MohammadTaghi Hajiaghayi, Naomi Nishimura:
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth. J. Comput. Syst. Sci. 73(5): 755-768 (2007) - [j27]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov:
Power optimization for connectivity problems. Math. Program. 110(1): 195-208 (2007) - [j26]Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton:
Localized Client-Server Load Balancing without Global Information. SIAM J. Comput. 37(4): 1259-1279 (2007) - [j25]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton:
Oblivious routing on node-capacitated and directed graphs. ACM Trans. Algorithms 3(4): 51 (2007) - [j24]Paramvir Bahl, Mohammad Taghi Hajiaghayi, Kamal Jain, Vahab S. Mirrokni, Lili Qiu, Amin Saberi:
Cell Breathing in Wireless LANs: Algorithms and Evaluation. IEEE Trans. Mob. Comput. 6(2): 164-178 (2007) - [j23]Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni:
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. IEEE/ACM Trans. Netw. 15(6): 1345-1358 (2007) - [c51]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tuomas Sandholm:
Automated Online Mechanism Design and Prophet Inequalities. AAAI 2007: 58-65 - [c50]Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar:
Stochastic Steiner Tree with Non-uniform Inflation. APPROX-RANDOM 2007: 134-148 - [c49]Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi:
Dial a Ride from k -Forest. ESA 2007: 241-252 - [c48]Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam:
The price of anarchy in network creation games. PODC 2007: 292-298 - [c47]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam:
Minimizing movement. SODA 2007: 258-267 - [c46]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar:
Approximation algorithms via contraction decomposition. SODA 2007: 278-287 - [c45]Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton:
Semi-oblivious routing: lower bounds. SODA 2007: 929-938 - [c44]Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximation algorithms for node-weighted buy-at-bulk network design. SODA 2007: 1265-1274 - [c43]Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam:
Scheduling to minimize gaps and power consumption. SPAA 2007: 46-54 - [c42]Maria-Florina Balcan, Avrim Blum, T.-H. Hubert Chan, MohammadTaghi Hajiaghayi:
A Theory of Loss-Leaders: Making Money by Pricing Below Cost. WINE 2007: 293-299 - [i4]Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi:
Dial a Ride from k-forest. CoRR abs/0707.0648 (2007) - 2006
- [j22]Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk:
Low-Dimensional Embedding with Extra Information. Discret. Comput. Geom. 36(4): 609-632 (2006) - [j21]Mohammad Taghi Hajiaghayi, Harald Räcke:
An O(sqrt(n))-approximation algorithm for directed sparsest cut. Inf. Process. Lett. 97(4): 156-160 (2006) - [j20]Erik D. Demaine, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos:
The Bidimensional Theory of Bounded-Genus Graphs. SIAM J. Discret. Math. 20(2): 357-371 (2006) - [j19]Mohammad Taghi Hajiaghayi, Tom Leighton:
On the max-flow min-cut ratio for directed multicommodity flows. Theor. Comput. Sci. 352(1-3): 318-321 (2006) - [j18]Mohsen Bahramgiri, Mohammad Taghi Hajiaghayi, Vahab S. Mirrokni:
Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks. Wirel. Networks 12(2): 179-188 (2006) - [c41]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. APPROX-RANDOM 2006: 152-163 - [c40]MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Erik D. Demaine, Mohammad Moharrami:
Plane embeddings of planar graph metrics. SCG 2006: 197-206 - [c39]Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. FOCS 2006: 677-686 - [c38]Mohammad Taghi Hajiaghayi, Kamal Jain, Lap Chi Lau, Ion I. Mandoiu, Alexander Russell, Vijay V. Vazirani:
Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping. International Conference on Computational Science (2) 2006: 758-766 - [c37]Mohammad Taghi Hajiaghayi, Li (Erran) Li, Vahab S. Mirrokni, Marina Thottan:
Bandwidth Sharing Network Design for Multi-Class Traffic. INFOCOM 2006 - [c36]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi:
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. ISAAC 2006: 3-15 - [c35]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour:
Combination can be hard: approximability of the unique coverage problem. SODA 2006: 162-171 - [c34]Mohammad Taghi Hajiaghayi, Kamal Jain:
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema. SODA 2006: 631-640 - [c33]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton:
Improved lower and upper bounds for universal TSP in planar metrics. SODA 2006: 649-658 - [c32]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke:
New lower bounds for oblivious routing in undirected graphs. SODA 2006: 918-927 - [c31]Anupam Gupta, Mohammad Taghi Hajiaghayi, Harald Räcke:
Oblivious network design. SODA 2006: 970-979 - [c30]Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao:
l22 spreading metrics for vertex ordering problems. SODA 2006: 1018-1027 - [c29]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton:
Semi-oblivious routing. SPAA 2006: 234 - [i3]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximating Buy-at-Bulk k-Steiner trees. Electron. Colloquium Comput. Complex. TR06 (2006) - [i2]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j17]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors. Algorithmica 41(4): 245-267 (2005) - [j16]Therese Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood:
Balanced vertex-orderings of graphs. Discret. Appl. Math. 148(1): 27-48 (2005) - [j15]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J. ACM 52(6): 866-893 (2005) - [j14]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. ACM Trans. Algorithms 1(1): 33-47 (2005) - [c28]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi:
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. FOCS 2005: 637-646 - [c27]Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwar:
The Generalized Deadlock Resolution Problem. ICALP 2005: 853-865 - [c26]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov:
Power Optimization for Connectivity Problems. IPCO 2005: 349-361 - [c25]Jonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus:
Deploying sensor networks with guaranteed capacity and fault tolerance. MobiHoc 2005: 309-319 - [c24]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mohammad Mahdian, David C. Parkes:
Online auctions with re-usable goods. EC 2005: 165-174 - [c23]Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton:
Online client-server load balancing without global information. SODA 2005: 197-206 - [c22]Erik D. Demaine, Mohammad Taghi Hajiaghayi:
Bidimensionality: new connections between FPT algorithms and PTASs. SODA 2005: 590-601 - [c21]Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos:
Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. SODA 2005: 650-659 - [c20]Erik D. Demaine, Mohammad Taghi Hajiaghayi:
Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. SODA 2005: 682-689 - [c19]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke:
Oblivious routing on node-capacitated and directed graphs. SODA 2005: 782-790 - [c18]Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke:
Oblivious routing in directed graphs with random demands. STOC 2005: 193-201 - [c17]Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee:
Improved approximation algorithms for minimum-weight vertex separators. STOC 2005: 563-572 - [i1]Erik D. Demaine, MohammadTaghi Hajiaghayi:
Bidimensionality, Map Graphs, and Grid Minors. CoRR abs/cs/0502070 (2005) - 2004
- [j13]Erik D. Demaine, Mohammad Taghi Hajiaghayi:
Diameter and Treewidth in Minor-Closed Graph Families, Revisited. Algorithmica 40(3): 211-215 (2004) - [j12]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. Syst. Sci. 69(2): 166-195 (2004) - [j11]Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin:
Random MAX SAT, random MAX CUT, and their phase transitions. Random Struct. Algorithms 24(4): 502-545 (2004) - [j10]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Bidimensional Parameters and Local Treewidth. SIAM J. Discret. Math. 18(3): 501-511 (2004) - [j9]Yashar Ganjali, Mohammad Taghi Hajiaghayi:
Characterization of networks supporting multi-dimensional linear interval routing schemes. Theor. Comput. Sci. 326(1-3): 103-116 (2004) - [c16]Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk:
Low-dimensional embedding with extra information. SCG 2004: 320-329 - [c15]Erik D. Demaine, Mohammad Taghi Hajiaghayi:
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. GD 2004: 517-533 - [c14]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Bidimensional Parameters and Local Treewidth. LATIN 2004: 109-118 - [c13]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
The Bidimensional Theory of Bounded-Genus Graphs. MFCS 2004: 191-203 - [c12]Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, David C. Parkes:
Adaptive limited-supply online auctions. EC 2004: 71-80 - [c11]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. SODA 2004: 830-839 - [c10]Erik D. Demaine, Mohammad Taghi Hajiaghayi:
Equivalence of local treewidth and linear local treewidth and its algorithmic applications. SODA 2004: 840-849 - 2003
- [j8]Mohammad Taghi Hajiaghayi, Mahdi Hajiaghayi:
A note on the bounded fragmentation property and its applications in network reliability. Eur. J. Comb. 24(7): 891-896 (2003) - [j7]Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni:
The facility location problem with general cost functions. Networks 42(1): 42-47 (2003) - [j6]Therese Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar:
Palindrome recognition using a multidimensional tape. Theor. Comput. Sci. 302(1-3): 475-480 (2003) - [c9]Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. ICALP 2003: 829-844 - [c8]Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni:
Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. MobiCom 2003: 300-312 - [c7]Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin:
Random MAX SAT, random MAX CUT, and their phase transitions. SODA 2003: 364-373 - 2002
- [j5]Manuela M. Veloso, Tucker R. Balch, Peter Stone, Hiroaki Kitano, Fuminori Yamasaki, Ken Endo, Minoru Asada, Mansour Jamzad, Sayyed Bashir Sadjad, Vahab S. Mirrokni, Moslem Kazemi, Hamid Reza Chitsaz, Abbas Heydarnoori, Mohammad Taghi Hajiaghayi, Ehsan Chiniforooshan:
RoboCup-2001: The Fifth Robotic Soccer World Championships. AI Mag. 23(1): 55-68 (2002) - [j4]Mohammad Taghi Hajiaghayi, Yashar Ganjali:
A note on the Consecutive Ones Submatrix problem. Inf. Process. Lett. 83(3): 163-166 (2002) - [j3]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni:
Length-constrained path-matchings in graphs. Networks 39(4): 210-215 (2002) - [c6]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. APPROX 2002: 67-80 - [c5]Mohsen Bahramgiri, Mohammad Taghi Hajiaghayi, Vahab S. Mirrokni:
Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks. ICCCN 2002: 392-397 - [c4]Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs. ISAAC 2002: 262-273 - [c3]Mohammad Taghi Hajiaghayi, Naomi Nishimura:
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. MFCS 2002: 305-318 - 2001
- [j2]Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs. Electron. Notes Discret. Math. 10: 137-142 (2001) - [c2]Mansour Jamzad, Sayyed Bashir Sadjad, Vahab S. Mirrokni, Moslem Kazemi, Hamid Reza Chitsaz, Abbas Heydarnoori, Mohammad Taghi Hajiaghayi, Ehsan Chiniforooshan:
A Fast Vision System for Middle Size Robots in RoboCup. RoboCup 2001: 71-80 - 2000
- [j1]Mohammad Taghi Hajiaghayi, Ebadollah S. Mahmoodian, Seyed Vahab Mirrokni, Amin Saberi, Ruzbeh Tusserkani:
On the simultaneous edge-coloring conjecture. Discret. Math. 216(1-3): 267-272 (2000) - [c1]Mansour Jamzad, Amirali Foroughnassiraei, Mohammad Taghi Hajiaghayi, Vahab S. Mirrokni, Reza Ghorbani, Abbas Heydarnoori, Moslem Kazemi, Hamid Reza Chitsaz, Farid Mobasser, Mohsen Ebrahimi Moghaddam, M. Gudarzi, N. Ghaffarzadegan:
A Goal Keeper for Middle Size RoboCup. RoboCup 2000: 583-586
Coauthor Index
Mohammad Hossein Bateni 0001
aka: MohammadHossein Bateni
aka: MohammadHossein Bateni
Rajesh Hemant Chitnis
aka: Rajesh Chitnis
aka: Rajesh Chitnis
[c176] [c125] [r8] [r6] [r5] [j68] [j67] [j66] [c103] [i32] [j64] [j62] [i22] [j58] [i19] [c76] [j48] [j44] [c68] [c67] [j41] [j38] [j37] [c64] [c62] [c61] [c58] [c56] [e1] [i10] [i9] [i8] [i7] [j36] [j35] [j33] [j31] [c53] [r2] [r1] [j30] [j29] [c48] [c47] [c46] [c43] [j22] [j20] [c40] [c36] [c35] [j17] [j15] [j14] [c28] [c25] [c22] [c21] [c20] [i1] [j13] [j12] [j10] [c16] [c15] [c14] [c13] [c11] [c10] [j6] [c9] [c6] [c4]
Hossein Esfandiari
aka: Hossein Efsandiari
aka: Hossein Efsandiari
M. Reza Khani
aka: Mohammad Reza Khani
aka: Mohammad Reza Khani
Robert D. Kleinberg
aka: Robert Kleinberg
aka: Robert Kleinberg
Dariusz R. Kowalski
aka: Dariusz Rafal Kowalski
aka: Dariusz Rafal Kowalski
Frank Thomson Leighton
aka: Tom Leighton
aka: Tom Leighton
Vahab S. Mirrokni
aka: Seyed Vahab Mirrokni
aka: Seyed Vahab Mirrokni
[j101] [c187] [j99] [j97] [j96] [c174] [c173] [i77] [i74] [j89] [j88] [c167] [c161] [c158] [c157] [c155] [i71] [i69] [i68] [i67] [i64] [c152] [c149] [c148] [c147] [c145] [c144] [c142] [i60] [i54] [j83] [c140] [c139] [c138] [i53] [i52] [i50] [i48] [c134] [c131] [c130] [i44] [i43] [i41] [c122] [c118] [i38] [c111] [c104] [i29]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
