publications

publications by categories in reversed chronological order. generated by jekyll-scholar.

2026

  1. STOC
    Combinatorial Optimization using Comparison Oracles
    Vincent Cohen-Addad, Tommaso d’Orsi, Anupam Gupta, and 7 more authors
    In ACM Symposium on Theory of Computing (STOC), 2026

2025

  1. arXiv
    An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
    Aditi Laddha and Madhusudhan Pittu
    arXiv preprint, 2025
  2. 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
  3. 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

2024

  1. 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

2023

  1. 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

2022

  1. arXiv
    Efficient Determinant Maximization for All Matroids
    Adam Brown, Aditi Laddha, Madhusudhan Pittu, and 1 more author
    arXiv preprint, 2022
  2. 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
  3. 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

2021

  1. arXiv
    A (2+\varepsilon)-Approximation Algorithm for Maximum Independent Set of Rectangles
    Waldo Gálvez, Arindam Khan, Mathieu Mari, and 3 more authors
    arXiv preprint, 2021

2020

  1. 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