@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 Pittu, Madhusudhan and Panigrahi, Debmalya and Schneider, Jon and Woodruff, David P.},booktitle={ACM Symposium on Theory of Computing (STOC)},year={2026},}
2025
arXiv
An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
@article{pittu2025permanents,title={An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality},author={Laddha, Aditi and Pittu, Madhusudhan},journal={arXiv preprint},year={2025},}
APPROX
Max-Cut with Multiple Cardinality Constraints
Yury Makarychev, Madhusudhan Pittu, and Ali Vakilian
In International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2025
@inproceedings{pittu2025maxcut,title={Max-Cut with Multiple Cardinality Constraints},author={Makarychev, Yury and Pittu, Madhusudhan and Vakilian, Ali},booktitle={International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)},year={2025},}
ICALP
Guessing Efficiently for Constrained Subspace Approximation
Aditya Bhaskara, Sepideh Mahabadi, Madhusudhan Pittu, and 2 more authors
In International Colloquium on Automata, Languages, and Programming (ICALP), 2025
@inproceedings{pittu2025subspace,title={Guessing Efficiently for Constrained Subspace Approximation},author={Bhaskara, Aditya and Mahabadi, Sepideh and Pittu, Madhusudhan and Vakilian, Ali and Woodruff, David P.},booktitle={International Colloquium on Automata, Languages, and Programming (ICALP)},year={2025},}
2024
SODA
Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
Adam Brown, Aditi Laddha, Madhusudhan Pittu, and 1 more author
In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024
@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 and Singh, Mohit},booktitle={ACM-SIAM Symposium on Discrete Algorithms (SODA)},year={2024},}
2023
FOCS
The Price of Explainability for Clustering
Anupam Gupta, Madhusudhan Pittu, Ola Svensson, and 1 more author
In IEEE Symposium on Foundations of Computer Science (FOCS), 2023
@inproceedings{pittu2023explainability,title={The Price of Explainability for Clustering},author={Gupta, Anupam and Pittu, Madhusudhan and Svensson, Ola and Yuan, Rachel},booktitle={IEEE Symposium on Foundations of Computer Science (FOCS)},year={2023},}
2022
arXiv
Efficient Determinant Maximization for All Matroids
Adam Brown, Aditi Laddha, Madhusudhan Pittu, and 1 more author
@article{pittu2022detmaxefficient,title={Efficient Determinant Maximization for All Matroids},author={Brown, Adam and Laddha, Aditi and Pittu, Madhusudhan and Singh, Mohit},journal={arXiv preprint},year={2022},}
FOCS
Determinant Maximization via Matroid Intersection Algorithms
Adam Brown, Aditi Laddha, Madhusudhan Pittu, and 2 more authors
In IEEE Symposium on Foundations of Computer Science (FOCS), 2022
@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={IEEE Symposium on Foundations of Computer Science (FOCS)},year={2022},}
SODA
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles
Waldo Gálvez, Arindam Khan, Mathieu Mari, and 3 more authors
In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022
@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 and Wiese, Andreas},booktitle={ACM-SIAM Symposium on Discrete Algorithms (SODA)},year={2022},}
2021
arXiv
A (2+\varepsilon)-Approximation Algorithm for Maximum Independent Set of Rectangles
Waldo Gálvez, Arindam Khan, Mathieu Mari, and 3 more authors
@article{pittu2021misr2,title={A (2+$\varepsilon$)-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 and Wiese, Andreas},journal={arXiv preprint},year={2021},}
2020
APPROX
On Guillotine Separability of Squares and Rectangles
Arindam Khan and Madhusudhan Pittu
In International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2020
@inproceedings{pittu2020guillotine,title={On Guillotine Separability of Squares and Rectangles},author={Khan, Arindam and Pittu, Madhusudhan},booktitle={International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)},year={2020},}