Sumedha Uniyal
 | The topic of this article may not meet Wikihoc's general notability guideline. |
Sumedha Uniyal | |
|---|---|
| Add a Photo | |
| Born | Sumedha Gupta May 11, 1985 India |
| Died | February 2020 (aged 34) |
| Nationality | Indian |
| Other names | Sumedha Gupta |
| Citizenship | India |
| Education | Indian Institute of Technology Delhi (Integrated M.Tech.) IDSIA (Ph.D.) |
| Known for | Approximation algorithms, graph algorithms, combinatorial optimization, network design, submodular optimization |
| Scientific career | |
| Fields | Computer science |
| Institutions | Aalto University |
Sumedha Uniyal (née Gupta; 11 May 1985 – February 2020) was an Indian computer scientist whose research focused on approximation algorithms, graph algorithms, combinatorial optimization, network design, and submodular optimization.[1] She completed her doctoral studies in the Algorithms and Complexity Group at IDSIA and later worked as a postdoctoral researcher at Aalto University.[2]
Education
Uniyal studied Mathematics and Computing at the Indian Institute of Technology Delhi, where she completed an integrated M.Tech. degree in 2009.[2]
From 2013 to 2017, she pursued a Ph.D. in the Algorithms and Complexity Group at IDSIA under the supervision of Fabrizio Grandoni and Naveen Garg.[1][3]
Career
From 2010 to 2012, Uniyal worked as a data analyst at IndusInd Bank.[2] She subsequently served as a research associate in the Department of Computer Science and Engineering at Indian Institute of Technology Delhi.[2]
In 2013, she joined IDSIA as a doctoral researcher. During her academic career she participated in research visits at Aalto University, IIT Delhi, and the University of Wrocław. She also served as a teaching assistant for courses in algorithms, data structures, discrete mathematics, and algorithmics at the University of Lugano.[2]
Following completion of her doctorate, she joined Aalto University as a postdoctoral researcher working with Parinya Chalermsook.[2][4]
Research
Uniyal's research interests included:
- approximation algorithms
- graph algorithms
- combinatorial optimization
- submodular optimization
- online algorithms
- network design
Her work appeared in conferences and journals in theoretical computer science including SODA, ICALP, STACS, IPCO, ESA, WAOA, LATIN, and ACM Transactions on Algorithms.[2]
Among her research contributions were work on approximation algorithms for network design, capacitated k-median problems, submodular maximization, planar graph optimization, and problems related to Tuza's conjecture.[1]
Legacy
Uniyal died in February 2020.
Several research papers co-authored by Uniyal were published after her death as collaborators completed ongoing research projects. Published acknowledgements and funding statements in later papers noted that Uniyal had died in February 2020 and that unfinished collaborative work was subsequently prepared for publication by her co-authors.
In the doctoral dissertation Advanced Machine Learning Methods for Information Leakage Detection in Cryptographic Systems (2025), computer scientist Pritha Gupta acknowledged Uniyal's influence on her academic development and credited her with providing guidance and encouragement during her education.
Publications
Posthumous publications (2020–2025)
- Chalermsook, Parinya; Kugelmann, Axel; Orgo, Ly; Uniyal, Sumedha; Zarsav, Minoo (2025). "An Improved Guillotine Cut for Squares". WADS 2025.
- Chalermsook, Parinya; Kaul, Matthias; Mnich, Matthias; Spoerhase, Joachim; Uniyal, Sumedha; Vaz, Daniel (2024). "Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter". ACM Transactions on Algorithms.
- Calinescu, Gruia; Uniyal, Sumedha (2024). "Local Optimization Algorithms for Maximum Planar Subgraph". ESA 2024.
Publications (2015–2020)
- Byrka, Jaroslaw; Lewandowski, Mateusz; Meesum, Syed Mohammad; Spoerhase, Joachim; Uniyal, Sumedha (2020). "PTAS for Steiner Tree on Map Graphs". LATIN 2020.
- Chalermsook, Parinya; Khuller, Samir; Sukprasert, Pattara; Uniyal, Sumedha (2020). "Multi-transversals for Triangles and Tuza's Conjecture". SODA 2020.
- Chalermsook, Parinya; Schmid, Andreas; Uniyal, Sumedha (2019). "A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs". STACS 2019.
- Mizrachi, Eyal; Schwartz, Roy; Spoerhase, Joachim; Uniyal, Sumedha (2019). "A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints". ICALP 2019.
- Byrka, Jarosław; Rybicki, Bartosz; Uniyal, Sumedha (2016). "An Approximation Algorithm for the Uniform Capacitated k-Median Problem with 1+ε Capacity Violation". IPCO 2016.
- Grandoni, Fabrizio; Ingala, Salvatore; Uniyal, Sumedha (2015). "Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows". WAOA 2015.
References
- ↑ 1.0 1.1 1.2 Uniyal, Sumedha (2017). "Approximation Algorithms for Network Design Problems" (PDF). IDSIA.
- ↑ 2.0 2.1 2.2 2.3 2.4 2.5 2.6 "Curriculum Vitae – Sumedha Uniyal" (PDF).
- ↑ "Fabrizio Grandoni". IDSIA. Retrieved 2026-06-06.
- ↑ "Parinya Chalermsook". Retrieved 2026-06-06.
External links
This article "Sumedha Uniyal" is from Wikipedia. The list of its authors can be seen in its historical. Articles taken from Draft Namespace on Wikipedia could be accessed on Wikipedia's Draft Namespace.