ABOUT ME
ABOUT ME
Embedded Files
I, Arpit Kumar, am a PhD Scholar at the CSE Department in IIIT Delhi, India. My doctoral work is in Graph Theoretic Problems in Parameterized Complexity in the Theory lab, advised by Dr Diptapriyo Majumdar.
Prior to that, I was a research intern at CCNSB LAB in IIIT Hyderabad, India, where I continued and completed my master's project. I completed my master's (M.Sc. in Mathematics) in 2022 from the Department of Mathematics at NIT Durgapur, India.
What's New
What's New
[21-25 May 2025]: Attended Summer School on Approximation Algorithms at IISc Bangalore.
[14-20 Dec 2024]: Attended FSTTCS conference, Workshop on Algorithmic Mechanism Design workshop and Milestones and Motifs in the Theory of Proofs, Algebraic Computation, and Lower Bounds workshop at IIT Gandhinagar.
[1-3 July 2024]: Attended Recent Trends in Algorithms workshop at IACS Kolkata
Motivation and Significance of My Research
Motivation and Significance of My Research
My research lies at the intersection of graph theory and algorithm design, with particular focus on parameterized algorithms, approximation techniques and algorithms for special graph classes. This area is motivated by several factors: Coping with NP‑hardness, Combining parameterization and approximation, Leveraging special graph structures, and Broad applicability.
A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graphs and Trees with Diptapriyo Majumdar and Ashwin Jacob. [arXiv]
Impact of local navigation rules on biased random walks in multiplex Markov chains with Subrata Ghosh, Pinaki Pal and Chittaranjan Hens. In: Physica A: Statistical Mechanics and its Applications [Journal]
[18 Aug 2025]: Gave a talk on Iterative Compression based FPT algorithms for feedback vertex set problems in the Theory Seminar Series at IIITD
Page updated
Report abuse