I am a postdoctoral researcher in the Department of Combinatorics and Optimization at the University of Waterloo, hosted by Joseph Cheriyan, Jochen Koenemann, Kanstantsin Pashkovich, and Chaitanya Swamy. Prior to this, I completed my PhD at the Indian Institute of Science advised by Arindam Khan.
My interests lie in the general area of Theoretical Computer Science and I am currently working on online network design problems and approximation algorithms for geometric optimization problems. I enjoy thinking about problems in graph algorithms and combinatorial optimization, and look forward to exploring more of TCS.
Outside of TCS, I spend a lot of time speedcubing, trekking, and playing the tabla, having trained under the tutelage of Sri. Amit Mishra of the Banaras Gharana. I am also enthusiastic about free and open-source software, and enjoy tinkering with Linux - and yes, I use Arch btw.
Publications
Weighted and Unweighted Online Connectivity Augmentation via Geometric Hitting Set, Manuscript
Daniel Hathcock, Aditya Subramanian, Seeun William Umboh, Michael Zlatin.Online Connectivity Augmentation, SODA 2026
Mohit Garg, Aditya Subramanian.A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions, PODS 2026
Rachana Gusain, Saladi Rahul, Aditya Subramanian.On Approximation Schemes for Stabbing Rectilinear Polygons, FSTTCS 2024
Arindam Khan, Aditya Subramanian, Tobias Widmann, Andreas Wiese.Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set, SoCG 2023
Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese.Fair Rank Aggregation, NeurIPS 2022
Diptarka Chakraborty, Syamantak Das, Arindam Khan, Aditya Subramanian.A PTAS for the Horizontal Rectangle Stabbing Problem, IPCO 2022, Math. Program. 206(1)
Arindam Khan, Aditya Subramanian, Andreas Wiese.
Teaching Experience
A IISc:
- E0 318 Topics in Geometric Algorithms (fall24) - Took lectures on ANNs
- E0 249 Approximation Algorithms (spring24) - Took lectures on geometric approximation algorithms
- E0 234 Introduction to Randomized Algorithms (spring23) - Teaching Assistant
- E0 225 Design and Analysis of Algorithms (fall21) - Teaching Assistant
At SNU:
- CSD203 Principles of Programming Languages (monsoon20) - Teaching Assistant
- CSD302 Design and Analysis of Algorithms (spring20) - Teaching Assistant
- CSD205 Discrete Mathematics (monsoon19) - Teaching Assistant
Service
Subreviewer for SODA (2025, 2027), SoCG (2022, 2023, 2025, 2026), TALG(2026), ICALP (2026), ITCS (2027), ESA(2026), APPROX (2023, 2024), STACS (2025, 2026), FSTTCS (2026), WG 2025, COCOON (2026), LATIN 2024, FCT 2023.
Organized CSA Summer School 2025, Summer School on Approximation Algorithms 2025, Theory CS Winter School 2024, Bangalore Theory Seminars 2022-2023, reading group on computational geometry 2023-2024.