| Submodular secretary problem with shortlists S Agrawal, M Shadravan, C Stein 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2019 | 29 | 2019 |
| Linear programming hierarchies suffice for directed steiner tree Z Friggstad, J Könemann, Y Kun-Ko, A Louis, M Shadravan, M Tulsiani International Conference on Integer Programming and Combinatorial …, 2014 | 29 | 2014 |
| Parallelizing thompson sampling A Karbasi, V Mirrokni, M Shadravan Advances in Neural Information Processing Systems 34, 10535-10548, 2021 | 21 | 2021 |
| A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs Z Friggstad, J Könemann, M Shadravan 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016 | 8 | 2016 |
| Online conflict-free coloring of intervals MA Abam, MJ Rezaei Seraji, M Shadravan Scientia Iranica 21 (6), 2138-2141, 2014 | 6 | 2014 |
| Improved submodular secretary problem with shortlists M Shadravan arXiv preprint arXiv:2010.01901, 2020 | 2 | 2020 |
| Submodular Matroid Secretary Problem with Shortlists M Shadravan arXiv preprint arXiv:2001.00894, 2020 | 1 | 2020 |
| On domatic number of graphs. M Shadravan, RA Borzooei Journal of Mathematical Extension 17 (8), 2023 | | 2023 |
| Parallelizing Thompson Sampling V Mirrokni, M Shadravan Advances in Neural Information Processing Systems, 2021 | | 2021 |
| Submodular Secretary Problem with Shortlists under General Constraints M Shadravan Columbia University, 2020 | | 2020 |
| 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016) Z Friggstad, M Rezapour, MR Salavatipour, J Byrka, M Lewandowski, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2016 | | 2016 |
| On The Integrality Gap of Directed Steiner Tree Problem M Shadravan University of Waterloo, 2014 | | 2014 |
