Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarMohammad Taghi Hajiaghayi
MohammadTaghi Hajiaghayi
Person information
- affiliation: University of Maryland at College Park, Computer Science Department
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 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 - [i76]Alireza Farhadi, MohammadTaghi Hajiaghayi, Aviad Rubinstein, Saeed Seddighin:
Streaming with Oracle: New Streaming Algorithms for Edit Distance and LCS. CoRR abs/2002.11342 (2020) - [i75]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi:
Stochastic Matching with Few Queries: (1-ε) Approximation. CoRR abs/2002.11880 (2020) - [i74]Behzad Ghazanfari, Fatemeh Afghah, MohammadTaghi Hajiaghayi:
Inverse Feature Learning: Feature learning based on Representation Learning of Error. CoRR abs/2003.03689 (2020) - [i73]MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun:
Approximating LCS in Linear Time: Beating the √n Barrier. CoRR abs/2003.07285 (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. Social Netw. Analys. Mining 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. Electronic Colloquium on Computational Complexity (ECCC) 23: 112 (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]