On the least size of a graph with a given degree set – II
Jai Moondra, Aditya Sahdev, Amitabha Tripathi. (2020). "On the least size of a graph with a given degree set – II." arXiv.
CV
Education
- B.Tech. in Computer Science and Engineering, Indian Institute of Technology, 2019
- Ph.D. in Algorithms Combinatorics and Optimization, Georgia Tech (expected 2025)
Work experience
Paper reviews for conferences including APPROX 2023, Conference on Applied & Computational Discrete Algorithms (ACDA) 2023, Integer Programming and Combinatorial Optimization (IPCO) 2022, Innovations in Theoretical Computer Science (ITCS) 2022, and Health Care Management Science (HCMS) 2022.
Research Assistant at Georgia Institute of Technology (January 2021 - present)
Summer 2018: Research Assistant at Duke University Computer Science Department
- Advisors: Dr. Debmalya Panigrahi, Dr. Rong Ge
Talks
Portfolio Approximations and Fairness in Combinatorial Optimization at INFORMS 2023
Which $L_p$ norm is the fairest? Approximations for fair facility location across all `$p$’ at EC 2023
Fairness Objectives in Facility Location Problems at INFORMS 2022
Publications
Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes
Jai Moondra, Hassan Mortagy, Swati Gupta. (2021). "Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes." In proceedings of the 34th conference on Neural Information Processing Systems (NeurIPS).
New Proofs for the Disjunctive Rado Number of the Equations $x_1 - x_2 = a$ and $x_1 - x_2 = b$
A. Dileep, Jai Moondra, Amitabha Tripathi. (2022). "New Proofs for the Disjunctive Rado Number of the Equations $x_1 - x_2 = a$ and $x_1 - x_2 = b$." Graphs and Combinatorics 38:38.
Generating Target Graph Couplings for QAOA from Native Quantum Hardware Couplings
Joel Rajakumar, Jai Moondra, Bryan Gard, Swati Gupta, Creston D. Herold. (August 2022). "Generating Target Graph Couplings for QAOA from Native Quantum Hardware Couplings." Physical Review A 106.2
Multi Purpose Routing: New Perspectives and Approximation Algorithms
Majid Farhadi, Jai Moondra, Prasad Tetali, Alejandro Toriello. (2022). "Multi Purpose Routing: New Perspectives and Approximation Algorithms." arXiv.
Which $L_p$ norm is the fairest? Approximations for fair facility location across all “$p$”
Swati Gupta, Jai Moondra, Mohit Singh. (July 2023). " Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"." In Proceedings of the 24th ACM Conference on Economics and Computation (EC) 2023
Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson’s Max-Cut at Low Circuit Depths
Reuben Tate, Jai Moondra, Bryan Gard, Greg Mohler, Swati Gupta. (September 2023). "Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson’s Max-Cut at Low Circuit Depths"
Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations
Jai Moondra, Philip C. Lotshaw, Greg Mohler, Swati Gupta. (June 2024). " Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations ." In arXiv
Balancing Notions of Equity: Approximation Algorithms for Fair Portfolio of Solutions in Combinatorial Optimization
Swati Gupta, Jai Moondra, Mohit Singh. (July 2024). "Balancing Notions of Equity: Approximation Algorithms for Fair Portfolio of Solutions in Combinatorial Optimization"
Academic awards and fellowships
ARC-ACO fellowship at Georgia Tech for Spring 2023: this is jointly awarded by the Algorithms and Randomness Center and the Algorithms, Combinatorics, and Optimization program at Georgia Tech each year.
Poster on Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes received honorable mention for best poster at Mixed Integer Programming (MIP)
- Joint work with Hassan Mortagy and Swati Gupta.