| Popular matchings and limits to tractability Y Faenza, T Kavitha, V Powers, X Zhang Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 52 | 2019 |
| Basc: constrained approximation by semidefinite programming S Foucart, V Powers IMA Journal of Numerical Analysis 37 (2), 1066-1085, 2017 | 13 | 2017 |
| Understanding popular matchings via stable matchings A Cseh, Y Faenza, T Kavitha, V Powers SIAM Journal on Discrete Mathematics 36 (1), 188-213, 2022 | 8 | 2022 |
| Understanding popular matchings via stable matchings A Cseh, Y Faenza, T Kavitha, V Powers arXiv preprint arXiv:1811.06897, 2018 | 4 | 2018 |
| Two-sided popular matchings in bipartite graphs with forbidden/forced elements and weights Y Faenza, V Powers, X Zhang arXiv preprint arXiv:1803.01478, 2018 | 4 | 2018 |
| Discrete Optimization Problems in Popular Matchings and Scheduling V Powers Columbia University, 2020 | 1 | 2020 |
| Popularity, stability, and the dominant matching polytope. Á Cseh, Y Faenza, T Kavitha, V Powers arXiv preprint arXiv:1811.06897, 2018 | | 2018 |
Yuri FaenzaAssociate Professor, IEOR, Columbia UniversityVerified email at columbia.edu
