| Streaming algorithms for estimating the matching size in planar graphs and beyond H Esfandiari, M Hajiaghayi, V Liaghat, M Monemizadeh, K Onak ACM Transactions on Algorithms (TALG) 14 (4), 1-23, 2018 | 97 | 2018 |
| Online prophet-inequality matching with applications to ad allocation S Alaei, MT Hajiaghayi, V Liaghat Proceedings of the 13th ACM Conference on Electronic Commerce, 18-35, 2012 | 94 | 2012 |
| Prophet secretary H Esfandiari, MT Hajiaghayi, V Liaghat, M Monemizadeh SIAM Journal on Discrete Mathematics 31 (3), 1685-1701, 2017 | 74 | 2017 |
| PACE: Policy-aware application cloud embedding LE Li, V Liaghat, H Zhao, MT Hajiaghayi, D Li, G Wilfong, YR Yang, C Guo 2013 Proceedings IEEE INFOCOM, 638-646, 2013 | 69 | 2013 |
| The online stochastic generalized assignment problem S Alaei, MT Hajiaghayi, V Liaghat Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013 | 54 | 2013 |
| Stochastic k-server: How should uber work? S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat, S Seddighin arXiv preprint arXiv:1705.05755, 2017 | 26 | 2017 |
| Online node-weighted steiner forest and extensions via disk paintings MT Hajiaghayi, V Liaghat, D Panigrahi 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 558-567, 2013 | 26 | 2013 |
| Near-optimal online algorithms for prize-collecting steiner problems MT Hajiaghayi, V Liaghat, D Panigrahi International Colloquium on Automata, Languages, and Programming, 576-587, 2014 | 25 | 2014 |
| Improved approximation algorithms for (budgeted) node-weighted steiner problems MH Bateni, MT Hajiaghayi, V Liaghat International Colloquium on Automata, Languages, and Programming, 81-92, 2013 | 25 | 2013 |
| Colorful paths in vertex coloring of graphs S Akbari, V Liaghat, A Nikzad the electronic journal of combinatorics, P17-P17, 2011 | 19 | 2011 |
| Adcell: Ad allocation in cellular networks S Alaei, MT Hajiaghayi, V Liaghat, D Pei, B Saha European Symposium on Algorithms, 311-322, 2011 | 15 | 2011 |
| Online degree-bounded steiner network design S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 10 | 2016 |
| Parameterized complexity of problems in coalitional resource games R Chitnis, MT Hajiaghayi, V Liaghat Proceedings of the AAAI Conference on Artificial Intelligence 25 (1), 620-625, 2011 | 10 | 2011 |
| Greedy algorithms for online survivable network design S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat, S Seddighin 45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018 | 8 | 2018 |
| Online weighted degree-bounded Steiner networks via novel online mixed packing/covering S Dehghani, S Ehsani, MT Hajiaghayi, V Liaghat, H Racke, S Seddighin arXiv preprint arXiv:1704.05811, 2017 | 7 | 2017 |
| Online stochastic reordering buffer scheduling H Esfandiari, MT Hajiaghayi, MR Khani, V Liaghat, H Mahini, H Räcke International Colloquium on Automata, Languages, and Programming, 465-476, 2014 | 7 | 2014 |
| Colorful paths in vertex coloring of graphs S Akbari, V Liaghat, A Nikzad | 6 | 2016 |
| Online energy storage management: an algorithmic approach A Kim, V Liaghat, J Qin, A Saberi Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016 | 6 | 2016 |
| Improved approximation algorithms for (budgeted) node-weighted Steiner problems MH Bateni, MT Hajiaghayi, V Liaghat SIAM Journal on Computing 47 (4), 1275-1293, 2018 | 5 | 2018 |
| Online node-weighted steiner forest and extensions via disk paintings MT Hajiaghayi, V Liaghat, D Panigrahi SIAM Journal on Computing 46 (3), 911-935, 2017 | 5 | 2017 |
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkVerified email at cs.umd.edu
