Mohammad Hajiaghayi - Publications

Affiliations: 
Computer Science University of Maryland, College Park, College Park, MD 
Area:
Theoretical Computer Science

48 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Johnson DS, Breslau L, Diakonikolas I, Duffield NG, Gu Y, Hajiaghayi M, Karloff HJ, Resende MGC, Sen S. Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs Operations Research. 68: 896-926. DOI: 10.1287/Opre.2019.1956  0.323
2020 Hajiaghayi M, Kortsarz G, MacDavid R, Purohit M, Sarpatwar KK. Approximation Algorithms for Connected Maximum Cut and Related Problems Theoretical Computer Science. 814: 693-704. DOI: 10.1007/978-3-662-48350-3_58  0.639
2018 Esfandiari H, Hajiaghayi M, Liaghat V, Monemizadeh M, Onak K. Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond Acm Transactions On Algorithms. 14: 48. DOI: 10.1145/3230819  0.764
2017 Hajiaghayi M, Liaghat V, Panigrahi D. Online Node-weighted Steiner Forest and Extensions via Disk Paintings Siam Journal On Computing. 46: 911-935. DOI: 10.1137/14098692X  0.763
2017 Chitnis R, Esfandiari H, Hajiaghayi M, Khandekar R, Kortsarz G, Seddighin S. A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands Algorithmica. 77: 1216-1239. DOI: 10.1007/S00453-016-0145-8  0.749
2016 Hajiaghayi M, Hu W, Li J, Li S, Saha B. A Constant Factor Approximation Algorithm for Fault-Tolerant k -Median Acm Transactions On Algorithms. 12: 36. DOI: 10.1145/2854153  0.454
2016 Chitnis R, Cygan M, Hajiaghayi M, Pilipczuk M, Pilipczuk M. Designing FPT Algorithms for Cut Problems Using Randomized Contractions Siam Journal On Computing. 45: 1171-1229. DOI: 10.1137/15M1032077  0.79
2016 Gao P, Miao H, Baras JS, Hajiaghayi M. Social network ad allocation and optimization: a geometric mapping-based approach Social Network Analysis and Mining. 6. DOI: 10.1007/S13278-016-0418-X  0.405
2016 Hajiaghayi M, Khandekar R, Kortsarz G, Nutov Z. On Fixed Cost k-Flow Problems Theory of Computing Systems \/ Mathematical Systems Theory. 58: 4-18. DOI: 10.1007/S00224-014-9572-6  0.55
2015 Chitnis R, Cygan M, Hajiaghayi M, Marx D. Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable Acm Transactions On Algorithms. 11: 28. DOI: 10.1145/2700209  0.799
2014 Demaine ED, Hajiaghayi M, Marx D. Minimizing movement: Fixed-parameter tractability Acm Transactions On Algorithms. 11. DOI: 10.1145/2650247  0.594
2014 Demaine ED, Hajiaghayi M, Klein PN. Node-weighted steiner tree and group steiner tree in planar graphs Acm Transactions On Algorithms. 10. DOI: 10.1145/2601070  0.723
2014 Alon N, Demaine ED, Hajiaghayi M, Kanellopoulos P, Leighton T. Correction: Basic network creation games Siam Journal On Discrete Mathematics. 28: 1638-1640. DOI: 10.1137/140955343  0.643
2014 Hajiaghayi M, Wijting C, Ribeiro CB, Hajiaghayi MT. Efficient and practical resource block allocation for LTE-based D2D network via graph coloring Wireless Networks. 20: 611-624. DOI: 10.1007/S11276-013-0626-5  0.442
2013 Bateni M, Hajiaghayi M, Zadimoghaddam M. Submodular secretary problem and extensions Acm Transactions On Algorithms. 9: 32. DOI: 10.1145/2500121  0.503
2013 Chitnis RH, Hajiaghayi M, Marx D. Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset Siam Journal On Computing. 42: 1674-1696. DOI: 10.1137/12086217X  0.542
2013 Demaine ED, Ghodsi M, Hajiaghayi M, Sayedi-Roshkhar AS, Zadimoghaddam M. Scheduling to minimize gaps and power consumption Journal of Scheduling. 16: 151-160. DOI: 10.1007/S10951-012-0309-6  0.599
2012 Hajiaghayi M, Khandekar R, Kortsarz G, Nutov Z. Prize-collecting steiner network problems Acm Transactions On Algorithms. 9: 2. DOI: 10.1145/2390176.2390178  0.531
2012 Bateni M, Hajiaghayi M. Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location Acm Transactions On Algorithms. 8: 20. DOI: 10.1145/2229163.2229164  0.435
2012 Demaine ED, Hajiaghayi M, Mahini H, Zadimoghaddam M. The price of anarchy in network creation games Acm Transactions On Algorithms. 8: 13. DOI: 10.1145/2151171.2151176  0.552
2012 Hajiaghayi M, Khandekar R, Kortsarz G, Mestre J. The checkpoint problem Theoretical Computer Science. 452: 88-99. DOI: 10.1016/J.Tcs.2012.05.021  0.569
2012 Hajiaghayi M, Khandekar R, Kortsarz G. Local Search Algorithms for the Red-Blue Median Problem Algorithmica. 63: 795-814. DOI: 10.1007/S00453-011-9547-9  0.476
2012 Bateni M, Hajiaghayi M. Euclidean Prize-Collecting Steiner Forest Algorithmica. 62: 906-929. DOI: 10.1007/S00453-011-9491-8  0.463
2011 Bateni M, Hajiaghayi M, Marx D. Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth Journal of the Acm. 58: 21. DOI: 10.1145/2027216.2027219  0.548
2011 Archer A, Bateni M, Hajiaghayi M, Karloff H. Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP Siam Journal On Computing. 40: 309-332. DOI: 10.1137/090771429  0.576
2011 Erman J, Gerber A, Hajiaghayi M, Pei D, Sen S, Spatscheck O. To cache or not to cache: The 3G case Ieee Internet Computing. 15: 27-34. DOI: 10.1109/Mic.2010.154  0.311
2011 Bateni M, Golab L, Hajiaghayi M, Karloff H. Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses Theory of Computing Systems \/ Mathematical Systems Theory. 49: 757-780. DOI: 10.1007/S00224-011-9347-2  0.412
2010 Gupta A, Hajiaghayi M, Nagarajan V, Ravi R. Dial a Ride from k -forest Acm Transactions On Algorithms. 6: 41. DOI: 10.1145/1721837.1721857  0.528
2010 Bateni M, Gerber A, Hajiaghayi M, Sen S. Multi-VPN optimization for scalable routing via relaying Ieee Acm Transactions On Networking. 18: 1544-1556. DOI: 10.1109/Tnet.2010.2043743  0.387
2009 Demaine ED, Hajiaghayi M, Mahini H, Zadimoghaddam M. The price of anarchy in cooperative network creation games Sigecom Exchanges. 8: 2. DOI: 10.1145/1980522.1980524  0.536
2009 Demaine ED, Hajiaghayi M, Kawarabayashi K. Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction Algorithmica. 54: 142-180. DOI: 10.1007/S00453-007-9138-Y  0.72
2008 Alon N, Bădoiu M, Demaine ED, Farach-Colton M, Hajiaghayi M, Sidiropoulos A. Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics Acm Transactions On Algorithms. 4: 46. DOI: 10.1145/1383369.1383377  0.618
2008 Demaine ED, Feige U, Hajiaghayi M, Salavatipour MR. Combination Can Be Hard: Approximability of the Unique Coverage Problem Siam Journal On Computing. 38: 1464-1483. DOI: 10.1137/060656048  0.676
2008 Feige U, Hajiaghayi M, Lee JR. Improved approximation algorithms for minimum weight vertex separators Siam Journal On Computing. 38: 629-657. DOI: 10.1137/05064299X  0.643
2008 Demaine ED, Hajiaghayi MT. The bidimensionality theory and its algorithmic applications Computer Journal. 51: 292-302. DOI: 10.1093/Comjnl/Bxm033  0.671
2008 Demaine ED, Hajiaghayi M. Linearity of grid minors in treewidth with applications through bidimensionality Combinatorica. 28: 19-36. DOI: 10.1007/S00493-008-2140-4  0.691
2007 Demaine ED, Hajiaghayi MT, Mahini H, Sayedi-Roshkhar AS, Oveisgharan S, Zadimoghaddam M. Minimizing movement Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 7: 258-267. DOI: 10.1145/1541885.1541891  0.653
2007 Hajiaghayi M, Nishimura N. Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth Journal of Computer and System Sciences. 73: 755-768. DOI: 10.1016/J.Jcss.2007.01.003  0.596
2007 Bateni M, Demaine ED, Hajiaghayi M, Moharrami M. Plane embeddings of planar graph metrics Discrete and Computational Geometry. 38: 615-637. DOI: 10.1007/S00454-007-1353-4  0.707
2006 Bahramgiri M, Hajiaghayi M, Mirrokni VS. Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks Wireless Networks. 12: 179-188. DOI: 10.1007/S11276-005-5265-Z  0.39
2006 Badoiu M, Demaine ED, Hajiaghayi M, Indyk P. Low-dimensional embedding with extra information Discrete and Computational Geometry. 36: 609-632. DOI: 10.1007/S00454-006-1268-5  0.666
2005 Demaine ED, Fomin FV, Hajiaghayi M, Thilikos DM. Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs Journal of the Acm. 52: 866-893. DOI: 10.1145/1101821.1101823  0.719
2005 Demaine ED, Fomin FV, Hajiaghayi M, Thilikos DM. Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs Acm Transactions On Algorithms. 1: 33-47. DOI: 10.1145/1077464.1077468  0.705
2004 Demaine ED, Hajiaghayi M, Thilikos DM. The bidimensional theory of bounded-genus graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3153: 191-203. DOI: 10.1137/040616929  0.721
2004 Ganjali Y, Hajiaghayi M. Characterization of networks supporting multi-dimensional linear interval routing schemes Theoretical Computer Science. 326: 103-116. DOI: 10.1016/J.Tcs.2004.06.013  0.352
2004 Coppersmith D, Gamarnik D, Hajiaghayi M, Sorkin GB. Random MAX SAT, random MAX CUT, and their phase transitions Random Structures and Algorithms. 24: 502-545. DOI: 10.1002/Rsa.V24:4  0.401
2003 Biedl T, Buss JF, Demaine ED, Demaine ML, Hajiaghayi M, Vinař T. Palindrome recognition using a multidimensional tape Theoretical Computer Science. 302: 475-480. DOI: 10.1016/S0304-3975(03)00086-0  0.546
2003 Hajiaghayi MT, Hajiaghayi M. A note on the bounded fragmentation property and its applications in network reliability The Journal of Combinatorics. 24: 891-896. DOI: 10.1016/S0195-6698(03)00080-5  0.554
Show low-probability matches.