Disclaimer : This page lists only the information about the individual member relevant to the theory group activities. Please visit the individual's page (using the link above) for broader profile information.
Research InterestsAlgorithms for Subgraph Isomorphism and Graph Modification Problems.Moved to:PhD Student, Department of Computer Science, Rutgers University, USA |
Publications (while with the group, last 10)
See here for all publications while at IITM
- Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices
Authors: Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma
ACM Transactions on Computation Theory (To Appear), Apr 2016 - Arithmetic Circuit Lower Bounds via MaxRank
Authors: Mrinal Kumar, Gaurav Maheshwari, Jayalal Sarma
40th International Colloquium on Automata, Languages and Programming (ICALP 2013), Lecture Notes in Computer Science, Vol 7965, pp.661-672, Jul 2013 - Faster Parameterized Algorithms for Deletion to Split Graphs
Authors: Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Mishra, Fahad Panolan, Ashuthosh Rai, M. S. Ramanujan
13th Scandinavian Symposium and Workshops on Algorithm Theory - SWAT 2012, Lecture Notes in Computer Science, Vol 7357, pp.107--118, Jul 2012 - A Characterization of all Stable Minimal Separator Graphs
Authors: Mrinal Kumar, Gaurav Maheshwari, Sadagopan Narasimhan
Accepted for Poster Presentation in European Conference on Combinatorics, Graph Theory and Applications (EURO- COMB 2011), Jun 2011