Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows. - Fabrizio Grandoni 001; Salvatore Ingala; Sumedha Uniyal (WAOA, 2015)

An approximation algorithm for Uniform Capacitated k-Median problem with 1 + ε capacity violation. - Jaroslaw Byrka; Bartosz Rybicki; Sumedha Uniyal (CoRR, 2015)

An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+ epsilon Capacity Violation. - Jaroslaw Byrka; Bartosz Rybicki; Sumedha Uniyal (IPCO, 2016)

A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints. - Eyal Mizrachi; Roy Schwartz 002; Joachim Spoerhase; Sumedha Uniyal (ICALP, 2019)

A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. - Parinya Chalermsook; Andreas Schmid 003; Sumedha Uniyal (STACS, 2019)

PTAS for Steiner Tree on Map Graphs. - Jaroslaw Byrka; Mateusz Lewandowski; Syed Mohammad Meesum; Joachim Spoerhase; Sumedha Uniyal (LATIN, 2020)

Multi-transversals for Triangles and the Tuza's Conjecture. - Parinya Chalermsook; Samir Khuller; Pattara Sukprasert; Sumedha Uniyal (SODA, 2020)

Local Optimization Algorithms for Maximum Planar Subgraph. - Gruia Calinescu; Sumedha Uniyal (ESA, 2024)

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. - Parinya Chalermsook; Matthias Kaul; Matthias Mnich; Joachim Spoerhase; Sumedha Uniyal; Daniel Vaz 001 (ACM Trans. Algorithms, 2024)

An Improved Guillotine Cut for Squares. - Parinya Chalermsook; Axel Kugelmann; Ly Orgo; Sumedha Uniyal; Minoo Zarsav (WADS, 2025)