Min-Max Theorems for Packing and Covering Odd (u, v)-trails. - Sharat Ibrahimpur; Chaitanya Swamy (IPCO, 2017)

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. - Sylvia C. Boyd; Joseph Cheriyan; Robert Cummings; Logan Grout; Sharat Ibrahimpur; Zoltán Szigeti; Lu Wang (APPROX-RANDOM, 2020)

Approximation Algorithms for Stochastic Minimum-Norm Combinatorial Optimization. - Sharat Ibrahimpur; Chaitanya Swamy (FOCS, 2020)

Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan. - Sharat Ibrahimpur; Chaitanya Swamy (ICALP, 2021)

A 2-Approximation Algorithm for Flexible Graph Connectivity. - Sylvia C. Boyd; Joseph Cheriyan; Arash Haddadan; Sharat Ibrahimpur (CoRR, 2021)

Caching with Reserves. - Sharat Ibrahimpur; Manish Purohit; Zoya Svitkina; Erik Vee; Joshua R. Wang (APPROX/RANDOM, 2022)

A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing. - Sharat Ibrahimpur; Chaitanya Swamy (SOSA, 2022)

Approximating (p, 2) flexible graph connectivity via the primal-dual method. - Ishan Bansal; Joseph Cheriyan; Logan Grout; Sharat Ibrahimpur (CoRR, 2022)

Extensions of the (p, q)-Flexible-Graph-Connectivity model. - Ishan Bansal; Joseph Cheriyan; Logan Grout; Sharat Ibrahimpur (CoRR, 2022)

A $ frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. - Sylvia C. Boyd; Joseph Cheriyan; Robert Cummings; Logan Grout; Sharat Ibrahimpur; Zoltán Szigeti; Lu Wang (SIAM J. Discret. Math., 2022)

Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals. - Ishan Bansal; Joe Cheriyan; Logan Grout; Sharat Ibrahimpur (APPROX/RANDOM, 2023)

Efficient Caching with Reserves via Marking. - Sharat Ibrahimpur; Manish Purohit; Zoya Svitkina; Erik Vee; Joshua R. Wang (ICALP, 2023)

Approximation algorithms for flexible graph connectivity. - Sylvia C. Boyd; Joseph Cheriyan; Arash Haddadan; Sharat Ibrahimpur (Math. Program., 2024)

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

An O(log n)-Approximation Algorithm for (p, q)-Flexible Graph Connectivity via Independent Rounding. - Sharat Ibrahimpur; László A. Végh (IPCO, 2025)