@article{pittu2026misr2,title={A (2+ε)-Approximation Algorithm for Maximum Independent Set of Rectangles},author={G\'{a}lvez, Waldo and Khan, Arindam and Mari, Mathieu and M\"{o}mke, Tobias and Pittu, Madhusudhan Reddy and Wiese, Andreas},journal={ACM Transactions on Algorithms},year={2026},doi={10.1145/3820880},note={Published online July 2, 2026.},}
@article{pittu2025nswjournal,title={Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs},author={Brown, Adam and Laddha, Aditi and Pittu, Madhusudhan and Singh, Mohit},journal={Mathematical Programming, Series A},year={2025},doi={10.1007/s10107-025-02300-6},note={Journal version of the SODA 2024 paper; first published online December 23, 2025.},}
@inproceedings{pittu2026comparison,title={Combinatorial Optimization using Comparison Oracles},author={Cohen-Addad, Vincent and d'Orsi, Tommaso and Gupta, Anupam and Guruganesh, Guru and Lee, Euiwoong and Paes Leme, Renato and Panigrahi, Debmalya and Pittu, Madhusudhan Reddy and Schneider, Jon and Woodruff, David P.},booktitle={Proceedings of the 58th Annual ACM Symposium on Theory of Computing},year={2026},pages={1995--2006},doi={10.1145/3798129.3800904},note={STOC 2026, pp. 1995-2006.},}
@inproceedings{pittu2025maxcut,title={Max-Cut with Multiple Cardinality Constraints},author={Makarychev, Yury and Pittu, Madhusudhan Reddy and Vakilian, Ali},booktitle={Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2025)},year={2025},volume={353},pages={13:1--13:21},doi={10.4230/LIPIcs.APPROX/RANDOM.2025.13},note={LIPIcs 353, Article 13, pp. 13:1-13:21.},}
@inproceedings{pittu2025subspace,title={Guessing Efficiently for Constrained Subspace Approximation},author={Bhaskara, Aditya and Mahabadi, Sepideh and Pittu, Madhusudhan Reddy and Vakilian, Ali and Woodruff, David P.},booktitle={52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025)},year={2025},volume={334},pages={29:1--29:20},doi={10.4230/LIPIcs.ICALP.2025.29},note={LIPIcs 334, Article 29, pp. 29:1-29:20.},}
@inproceedings{pittu2024nsw,title={Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs},author={Brown, Adam and Laddha, Aditi and Pittu, Madhusudhan Reddy and Singh, Mohit},booktitle={Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},year={2024},pages={1307--1327},doi={10.1137/1.9781611977912.52},note={SODA 2024, pp. 1307-1327. The full journal version appears separately above.},}
@inproceedings{pittu2023explainability,title={The Price of Explainability for Clustering},author={Gupta, Anupam and Pittu, Madhusudhan Reddy and Svensson, Ola and Yuan, Rachel},booktitle={2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)},year={2023},pages={1131--1148},doi={10.1109/FOCS57990.2023.00067},note={FOCS 2023, pp. 1131-1148.},}
@inproceedings{pittu2022detmax,title={Determinant Maximization via Matroid Intersection Algorithms},author={Brown, Adam and Laddha, Aditi and Pittu, Madhusudhan and Singh, Mohit and Tetali, Prasad},booktitle={2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)},year={2022},pages={255--266},doi={10.1109/FOCS54457.2022.00031},note={FOCS 2022, pp. 255-266.},}
@inproceedings{pittu2022misr3,title={A 3-Approximation Algorithm for Maximum Independent Set of Rectangles},author={G\'{a}lvez, Waldo and Khan, Arindam and Mari, Mathieu and M\"{o}mke, Tobias and Pittu, Madhusudhan Reddy and Wiese, Andreas},booktitle={Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},year={2022},pages={894--905},doi={10.1137/1.9781611977073.38},note={SODA 2022, pp. 894-905. The arXiv link is pinned to version 2, which matches this title.},}
@inproceedings{pittu2020guillotine,title={On Guillotine Separability of Squares and Rectangles},author={Khan, Arindam and Pittu, Madhusudhan Reddy},booktitle={Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},year={2020},volume={176},pages={47:1--47:22},doi={10.4230/LIPIcs.APPROX/RANDOM.2020.47},note={LIPIcs 176, Article 47, pp. 47:1-47:22.},}
@unpublished{pittu2025permanents,title={An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality},author={Laddha, Aditi and Pittu, Madhusudhan Reddy},year={2025},note={Public preprint, arXiv:2509.08121.},}
@unpublished{pittu2022detmaxefficient,title={Efficient Determinant Maximization for All Matroids},author={Brown, Adam and Laddha, Aditi and Pittu, Madhusudhan and Singh, Mohit},year={2022},note={Public preprint, arXiv:2211.10507.},}