| Anarchy, stability, and utopia: creating better matchings E Anshelevich, S Das, Y Naamad Autonomous Agents and Multi-Agent Systems 26 (1), 120-140, 2013 | 55 | 2013 |
| Multi-commodity flow with in-network processing M Charikar, Y Naamad, J Rexford, XK Zou International Symposium on Algorithmic Aspects of Cloud Computing, 73-101, 2018 | 38 | 2018 |
| Instructor rating markets M Chakraborty, S Das, A Lavoie, M Magdon-Ismail, Y Naamad Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013 | 27 | 2013 |
| Anarchy, stability, and utopia: Creating better matchings E Anshelevich, S Das, Y Naamad International Symposium on Algorithmic Game Theory, 159-170, 2009 | 25 | 2009 |
| On approximating target set selection M Charikar, Y Naamad, A Wirth Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016 | 20 | 2016 |
| On finding dense common subgraphs M Charikar, Y Naamad, J Wu arXiv preprint arXiv:1802.06361, 2018 | 13 | 2018 |
| Fast and effective distribution-key recommendation for amazon redshift P Parchas, Y Naamad, P Van Bouwel, C Faloutsos, M Petropoulos Proceedings of the VLDB Endowment 13 (12), 2411-2423, 2020 | 9 | 2020 |
| Question answering system N Mishra, Y Naamad US Patent 10,713,289, 2020 | 6 | 2020 |
| On DkS hardness for MinRep-hard problems M Charikar, Y Naamad, A Wirth Unpublished manuscript 1, 2017 | 2 | 2017 |
| Intervention-Aware Early Warning D Eswaran, C Faloutsos, N Mishra, Y Naamad | 1* | |
| Hardness from Densest Subgraph Conjectures Y Naamad Princeton, NJ: Princeton University, 2017 | | 2017 |
