Shivesh K. Roy

Shivesh K. Roy is a postdoctoral researcher at the Institute of Mathematical Sciences (IMSc), Chennai, working with Prof. Saket Saurabh. Previously, he completed his Ph.D. at Eindhoven University of Technology under Prof. Bart Jansen, supported by an ERC Starting Grant titled "Rigorous Search Space Reduction".

His educational background includes:

• Ph.D. in Algorithms, TU Eindhoven (2024); Thesis: "Parameterized Algorithms for Augmented Graph Problems"

His research focuses on theoretical computer science, specifically graph algorithms, parameterized complexity, and kernelization. He develops rigorous algorithmic frameworks for NP-hard graph problems by exploiting structural properties and parameterization techniques to achieve efficient solutions.

His publications (2021-2025) reveal consistent advancement in kernelization methods and parameterized algorithms, particularly for vertex cover, feedback vertex set, and clique packing problems. Key innovations include linear-vertex kernels for sparse graphs and hardness results for weight compression, demonstrating deep integration of combinatorial structures with computational complexity.

He has contributed academic service through peer review for SIAM Journal on Discrete Mathematics, Algorithmica, FCT 2025, SOFSEM 2025, and WG 2022.

Currently embedded in Prof. Saket Saurabh's research group at IMSc, he continues collaborative work initiated during his ERC-funded doctoral research at TU Eindhoven's Algorithms group.