Sumedha Uniyal

According to our database, Sumedha Uniyal authored at least 8 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter.

Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz

ACM Trans. Algorithms, January, 2024

2020

Multi-transversals for Triangles and the Tuza's Conjecture.

Parinya Chalermsook, Samir Khuller, Pattara Sukprasert, Sumedha Uniyal

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

PTAS for Steiner Tree on Map Graphs.

Jaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs.

Parinya Chalermsook, Andreas Schmid, Sumedha Uniyal

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints.

Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2016

An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+\epsilon Capacity Violation.

Jaroslaw Byrka, Bartosz Rybicki, Sumedha Uniyal

Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2015

An approximation algorithm for Uniform Capacitated k-Median problem with 1 + ε capacity violation.

Jaroslaw Byrka, Bartosz Rybicki, Sumedha Uniyal

CoRR, 2015

Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows.

Fabrizio Grandoni, Salvatore Ingala, Sumedha Uniyal

Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015