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)

The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true. - Logan Grout; Benjamin R. Moore (J. Comb. Theory B, 2020)

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)

On a partition LP relaxation for min-cost 2-node connected spanning subgraphs. - Logan Grout; Joseph Cheriyan; Bundit Laekhanukit (Oper. Res. Lett., 2023)

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