| Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions I Bansal, J Cheriyan, L Grout, S Ibrahimpur arXiv preprint arXiv:2209.11209, 2022 | 7 | 2022 |
| A constant factor approximation for the (p, 3)-flexible graph connectivity problem I Bansal arXiv preprint arXiv:2308.15714, 2023 | 3 | 2023 |
| Extensions of the -Flexible-Graph-Connectivity model I Bansal, J Cheriyan, L Grout, S Ibrahimpur arXiv preprint arXiv:2211.09747, 2022 | 2 | 2022 |
| Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals I Bansal, J Cheriyan, L Grout, S Ibrahimpur arXiv preprint arXiv:2206.11807, 2022 | 2 | 2022 |
| Warehouse problem with bounds, fixed costs and complementarity constraints I Bansal, O Günlük arXiv preprint arXiv:2302.12136, 2023 | 1 | 2023 |
| Network Design on Undirected Series-Parallel Graphs I Bansal, R Mao, A Mishra arXiv preprint arXiv:2401.10729, 2024 | | 2024 |
| Warehouse Problem with Multiple Vendors and Generalized Complementarity Constraints I Bansal, O Günlük arXiv preprint arXiv:2401.10738, 2024 | | 2024 |
| A Brief Introduction to Parameterized Complexity I Bansal, H Pulyassary | | 2023 |
| Approximating (p, 2) flexible graph connectivity via the primal-dual method. I Bansal, J Cheriyan, L Grout, S Ibrahimpur CoRR, 2022 | | 2022 |
| Capacitated Network Design on Outerplanar Graphs I Bansal University of Waterloo, 2020 | | 2020 |
