Publications

In reverse chronlogical order.

1. A 5-Approximation Analysis for the Cover Small Cuts Problem
   Miles Simmons, Ishan Bansal, Joseph Cheriyan. Preprint

2. Symmetric Submodular Functions, Uncrossable Functions, and Structural Submodularity
   Miles Simmons, Ishan Bansal, Joseph Cheriyan. Preprint

3. A Bad Example for Jain’s Iterative Rounding Theorem for the Cover Small Cuts Problem
   Miles Simmons, Ishan Bansal, Joseph Cheriyan. APPROX 2026

4. Parallel token swapping for qubit routing
   Ishan Bansal, Oktay Günlük, Ricky Shapley. Discrete Applied Mathematics 2025

5. A Global Analysis of the Primal-Dual Method for Edge Augmentation Problems
   Ishan Bansal. IPCO 2025

6. Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
   Ishan Bansal, Joseph Cheiryan, Sanjeev Khanna, Miles Simmons. ICALP 2025

7. Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions
   Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur. ICALP 2023, Algorithmica 2024

8. Network Design on Undirected Series-Parallel Graphs Ishan Bansal, Ryan Mao, Avhan Mishra. ISCO 2024

9. Warehouse Problem with Multiple Vendors and Generalized Complementarity Constraints
   Ishan Bansal, Oktay Günlük. Preprint

10. Discrete Optimization Problems Arising in Supply Chain Optimization
    Ishan Bansal. Ph.D. Thesis, Cornell University

11. Warehouse Problem with Bounds, Fixed Costs and Complementairity Constraints
    Ishan Bansal, Oktay Günlük. Preprint

12. A constant factor approximation for the $(p,3)$-Flexible Graph Connectivity Problem
    Ishan Bansal. Preprint

13. Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals
    Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur. APPROX 2023

14. Extensions of the $(p,q)$-Flexible Graph Connectivity Problem
    Ishan Bansal, Joseph Cheriyan, Logan Grout, Sharat Ibrahimpur. Preprint

15. Capacitated Network Design on Outerplanar Graphs
    Ishan Bansal. M.Math. Thesis, University of Waterloo

Working Papers

1. New and Improved Approximation Algorithms for the Capacitated Set Covering Problem on Tree-Fundamental Cycle Matrices.
   Ishan Bansal, Jochen Köenemann, Chaitanya Swamy

2. Inventory Placement Planning - Overcoming the Limitations of Product Grouping.
   Ishan Bansal, Cristiana Lara, Myunseok Cheon, R Ravi, Arash Haddadan, David Mildebrath

3. A General Disaggregation Framework for Inventory Placement with Product Groups.
   Ishan Bansal