| Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions I Bansal, J Cheriyan, L Grout, S Ibrahimpur Algorithmica, 1-30, 2024 | 10 | 2024 |
| The pseudoforest analogue for the strong nine dragon tree conjecture is true L Grout, B Moore Journal of Combinatorial Theory, Series B 145, 433-449, 2020 | 10 | 2020 |
| A -Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case S Boyd, J Cheriyan, R Cummings, L Grout, S Ibrahimpur, Z Szigeti, ... SIAM Journal on Discrete Mathematics 36 (3), 1730-1747, 2022 | 6 | 2022 |
| On decomposing graphs into forests and pseudoforests L Grout, B Moore arXiv preprint arXiv:1904.12435, 2019 | 3 | 2019 |
| 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 |
| Augmenting Trees to Achieve 2-Node-Connectivity L Grout University of Waterloo, 2020 | 1 | 2020 |
| On a partition LP relaxation for min-cost 2-node connected spanning subgraphs L Grout, J Cheriyan, B Laekhanukit Operations Research Letters 51 (3), 289-295, 2023 | | 2023 |
| Approximating (p, 2) flexible graph connectivity via the primal-dual method. I Bansal, J Cheriyan, L Grout, S Ibrahimpur CoRR, 2022 | | 2022 |
Sharat IbrahimpurPostDoc at London School of Economics and Political Science在 uwaterloo.ca 的电子邮件经过验证
