Research: packing and covering cycles and paths in parameterized complexity.

PhD thesis: Packing and Covering: New Paradigms and Algorithms

Current affiliation: Faculty, NISER Bhubaneswar

Research: connectivity problems in undirected and directed graphs.

PhD thesis: Parameterized Problems on (Di)graphs

Current affiliation: University of Southern Denmark (SDU)

Research: conflict-free graph problems in parameterized complexity.

PhD thesis: Parameterized Complexity of Conflict-Free Solutions

Current affiliation: Faculty, IIT Indore

Research: computational social choice and parameterized complexity.

PhD thesis: Select, Allocate, and Manipulate via Multivariate Analysis

Current affiliation: Faculty, Indian Statistical Institute Kolkata

Research: graph partitioning in parameterized complexity.

PhD thesis: Cross and Part: Beyond the Known Boundaries

Current affiliation: School of Computing Science, University of Glasgow

Research: graph decompositions and parameterized cut problems.

Master’s thesis: Modern Viewpoint of Tree Decompositions

PhD thesis: Advancing the Algorithmic Tool-kit for Parameterized Cut Problems

Current affiliation: Discrete Mathematics Group, Institute for Basic Science, South Korea

Research: graph decompositions and graph-contraction problems.

Master’s thesis: Parameterized Algorithms Using Decomposition

PhD thesis: Some Results on Graph Contraction Problems

Current affiliation: Faculty, IISER Pune

Research: graph-modification problems and kernelization.

PhD thesis: Graph Modification Problems: Beyond the Known Boundaries

Current affiliation: Faculty, IIT Madras

Research: algebraic methods and parameterized matrix-editing problems.

Master’s thesis: A Few Linear Algebraic Methods in Combinatorics

PhD thesis: Matrix Editing via Multivariate Lens

Current affiliation: Faculty, Krea University

Research: parameterized algorithms for network-design problems.

PhD thesis: Parameterized Algorithms for Network Design

Current affiliation: Faculty, Chennai Mathematical Institute

Research: graph partitioning and geometric covering.

Master’s thesis: PTASes for Problems on Planar Graphs

PhD thesis: Parameterized Complexity of Graph Partitioning and Geometric Covering

Current affiliation: Faculty, IIT Kharagpur

Research: graph modification and kernelization.

Master’s thesis: Kernel Lower Bounds: A Survey

PhD thesis: Parameterized Algorithms for Graph Modification Problems

Current affiliation: Faculty, IIT Delhi

Research: representative families, exact algorithms, and parameterized algorithms.

Master’s thesis: Randomization Techniques in FPT and the k-Path Problem

PhD thesis: Dynamic Programming Using Representative Families

Current affiliation: Faculty, University of Leeds

Research: graph separation and parameterized cut problems.

Master’s thesis: Graph Separation in Parameterized Algorithms

PhD thesis: Parameterized Graph Separation Problems: New Techniques and Algorithms

Current affiliation: Faculty, University of Warwick

Research: kernelization and F-deletion problems.

Master’s thesis: Infeasibility of Polynomial Kernelization

PhD thesis: Kernels for the F-Deletion Problem

Current affiliation: Faculty, IIT Gandhinagar

Research: kernelization for domination and covering problems.

Master’s thesis: Fixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory

PhD thesis: The Kernelization Complexity of Some Domination and Covering Problems

Current affiliation: Faculty, Chennai Mathematical Institute