publications

complete publication record, grouped by publication type and ordered reverse chronologically.

Peer-reviewed journal articles

  1. A (2+ε)-Approximation Algorithm for Maximum Independent Set of Rectangles
    Waldo Gálvez, Arindam Khan, Mathieu Mari, and 3 more authors
    ACM Transactions on Algorithms, 2026
    Published online July 2, 2026.
  2. Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
    Adam Brown, Aditi Laddha, Madhusudhan Pittu, and 1 more author
    Mathematical Programming, Series A, 2025
    Journal version of the SODA 2024 paper; first published online December 23, 2025.

Peer-reviewed conference papers

  1. Combinatorial Optimization using Comparison Oracles
    Vincent Cohen-Addad, Tommaso d’Orsi, Anupam Gupta, and 7 more authors
    In Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026
    STOC 2026, pp. 1995-2006.
  2. Max-Cut with Multiple Cardinality Constraints
    Yury Makarychev, Madhusudhan Reddy Pittu, and Ali Vakilian
    In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2025), 2025
    LIPIcs 353, Article 13, pp. 13:1-13:21.
  3. Guessing Efficiently for Constrained Subspace Approximation
    Aditya Bhaskara, Sepideh Mahabadi, Madhusudhan Reddy Pittu, and 2 more authors
    In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), 2025
    LIPIcs 334, Article 29, pp. 29:1-29:20.
  4. Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
    Adam Brown, Aditi Laddha, Madhusudhan Reddy Pittu, and 1 more author
    In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024
    SODA 2024, pp. 1307-1327. The full journal version appears separately above.
  5. The Price of Explainability for Clustering
    Anupam Gupta, Madhusudhan Reddy Pittu, Ola Svensson, and 1 more author
    In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023
    FOCS 2023, pp. 1131-1148.
  6. Determinant Maximization via Matroid Intersection Algorithms
    Adam Brown, Aditi Laddha, Madhusudhan Pittu, and 2 more authors
    In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022
    FOCS 2022, pp. 255-266.
  7. A 3-Approximation Algorithm for Maximum Independent Set of Rectangles
    Waldo Gálvez, Arindam Khan, Mathieu Mari, and 3 more authors
    In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022
    SODA 2022, pp. 894-905. The arXiv link is pinned to version 2, which matches this title.
  8. On Guillotine Separability of Squares and Rectangles
    Arindam Khan and Madhusudhan Reddy Pittu
    In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020), 2020
    LIPIcs 176, Article 47, pp. 47:1-47:22.

Additional public preprints

  1. An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
    Aditi Laddha and Madhusudhan Reddy Pittu
    2025
    Public preprint, arXiv:2509.08121.
  2. Efficient Determinant Maximization for All Matroids
    Adam Brown, Aditi Laddha, Madhusudhan Pittu, and 1 more author
    2022
    Public preprint, arXiv:2211.10507.