Graduate Students

Abhishek Sahu did his doctoral thesis with me. His thesis was on packing and covering cycles and paths in various graph classes in the realm of parameterized complexity. 

• Doctoral Thesis: Packing and Covering : New Paradigms and Algorithms

• Current Affiliation:  Visiting Scientist at NISER, Bhubaneswar (Offered Faculty position at IIT Bhubaneswar, India)

Kristine Vitting Klinkby Knudsen did her doctoral thesis with me co-supervised with Jørgen Bang-Jensen. Her phd thesis was around connectivity problems in undirected graphs and digraphs in the realm of parameterized complexity. 

• Doctoral Thesis:  Parameterized Problems on (Di)graphs

• Current Affiliation:  SDU

Lawqueen Kanesh did her doctoral thesis with me.  Her thesis was on basic graph problems in a presence of conflict graph in the realm of parameterized complexity. The solution in these problems need to satisfy two constraints: one in original graph and second being independent set in the conflict graph.

• Doctoral Thesis: Parameterized Complexity of  Conflict-Free Solutions

• Current Affiliation:  Faculty at Computer Science Department, IIT Indore,  Indore, India.

Sanjukta Roy did her doctoral thesis with me. Her thesis is on problems arising in computational social choice theory from the perspective of parameterized complexity. 

• Doctoral Thesis: Select, Allocate, and Manipulate via Multivariate Analysis 

• Current Affiliation:  Faculty at Indian Stastical Institute (ISI) Kolkata, MI Unit.

Jayakrishnan M did his doctoral thesis with me. His thesis is on graph partitioning problems in the realm of parameterized complexity.

• Doctoral Thesis: Cross and Part: Beyond the Known Boundaries 

• Current Affiliation:  Currently postdoc at University of Glasgow.

Roohani Sharma did her Master and Phd thesis with me. Her master thesis was on modern graph decompositions beyond treewidth and its application in designing parameterized algorithms. She did her phd on cut problems from the perspective of parameterized complexity. 

• Master Thesis: Modern Viewpoint of Tree Decompositions 

• Doctoral Thesis: Advancing the Algorithmic Tool-kit for Parameterized Cut Problems

• Current Affiliation:  Currently  Young Scientist Fellow, IBS, South Korea.

Prafullkumar Tale did his mater thesis and doctoral thesis with me. His master thesis was on parameterized algorithms using graph decomposition.  He did his phd on parameterized complexity of graph problems involving graph contractions.

• Master Thesis:  Parameterized Algorithms Using Decomposition 

• Doctoral Thesis: Some Results On Graph Contraction Problems 

• Current Affiliation:  Faculty at IISER Pune, Mathematics Department, India.

Akanksha Agrawal did her doctoral thesis with me. Her thesis was on graph modification problems from the modern perspective. In her thesis she resolved kernelization complexity of two well known open problems Chordal Vertex Deletion and Interval Vertex Deletion.

• Doctoral Thesis: Graph Modification Problems: Beyond the Known Boundaries

• Current Affiliation:  Faculty at Computer Science Department, IIT Madras,  Chennai, India.

Syed M. Meesum did his mater and doctoral thesis with me. His master thesis was on on linear algebraic methods in combinatorics. He did his phd on parameterized complexity of matrix problems involving certain editing operations.

• Master Thesis: A Few Linear Algebraic Methods In Combinatorics

• Doctoral Thesis: Matrix Editing via Multivariate Lens

• Current Affiliation:   Faculty of Sciences, Krea University, Sri City, India

Pranabendu Misra did his doctoral thesis with me. His thesis was on parameterized complexity of problems arising in network design. In his thesis he resolved several well-known open problems in this filed. 

• Doctoral Thesis: Parameterized Algorithms for Network Design

• Current Affiliation:  Faculty at Computer Science Department, Chennai Mathematical Institute (CMI), Chennai, India.

Sudeshna Kolay did her master and doctoral thesis with me. Her master thesis  was a survey on PTASes for graph optimization problems on planar graphs. Her phd thesis was on parameterized complexity of graph partitioning and geometric covering problems. Highlight of her thesis was subexponential time algorithm for Rectilinear Steiner Tree.

• Master Thesis: PTASes For Problems On Planar Graphs 

• Doctoral Thesis:  Parameterized Complexity of Graph Partitioning and Geometric Covering

• Current Affiliation:  Faculty at  Computer Science Department, IIT Kharagpur, India. 

Ashutosh Rai did his master thesis with Prof. Venkatesh Raman and me. He did his doctoral thesis with me. His master thesis was a survey on lower bounds on kernelization. He did his doctoral thesis on graph modification problems from the perspective of parameterized complexity. 

• Master Thesis: Kernel Lower Bounds: A Survey

• Doctoral Thesis: Parameterized Algorithms for Graph Modification Problems

• Current Affiliation:  Faculty at Mathematics Department, IIT Delhi, India. 

Fahad Panolan did his master and doctoral thesis with me. His master thesis  was a survey on randomization in parameterized algorithms via methods used in designing parameterized algorithms for k-Path. His phd thesis was on designing efficient parameterized and exact algorithm via representative families. The highlight of his thesis is the JACM paper where he developed efficient algorithms for computing representative families on general and uniform matroids. 

• Master Thesis: Randomization Techniques in FPT and k-Path Problem

• Doctoral Thesis: Dynamic Programming Using Representative Families

• Current Affiliation:  Faculty at Computer Science Department, IIT Hyderabad, India.

M. S. Ramanujan did his master and doctoral thesis with me. His master thesis  was a survey on important separators and other tools in designing parameterized algorithms for cut-problems. In his doctoral thesis he continued this line of investigations and designed several new tools and techniques for parameterized cut-problems. This included the introduction of important sequence technique. The highlight of his thesis is the first linear time parameterized algorithm for Odd Cycle Transversal. 

• Master Thesis: Graph Separation in Parameterized Algorithms

• Doctoral Thesis:  Parameterized Graph Separation Problems: New Techniques and Algorithms

• Current Affiliation:  Faculty at Computer Science Department, University of Warwick, UK.

Neeldhara Misra did her doctoral thesis with me in co-supervision of Prof. Venkatesh Raman. Her doctoral thesis was on kernelization complexity of a general graph problem that encompasses several well-known problems such as Vertex Cover and Feedback Vertex Set. The highlight of her thesis is the settlement of kernelization complexity of F-Deletion problem, when F contains a planar graph. This result still remains state of the art.

• Doctoral Thesis:  Kernels for the F-Deletion Problem

• Master Thesis: Infeasibility of Polynomial Kernelization

• Current Affiliation:  Faculty at Computer Science Department, IIT Gandhinagar, India.

G. Philip did his doctoral thesis with Prof. Venkatesh Raman, primarily. I helped Prof. Venkatesh Raman during this phase as a junior member and learned from him the nitty-gritty of advising. Philip's thesis was on kernelization complexity of domination and covering problems. 

• Master Thesis: Fixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory

• Doctoral Thesis: The Kernelization complexity of some domination and covering problems 

• Current Affiliation:  Faculty at Computer Science Department, Chennai Mathematical Institute (CMI), Chennai, India.