Research

Conference Papers:

  • Strong Graph Deletion:Bipartite Graphs [pdf]
    Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
    Submitted.
  • A Parameterized Algorithm for Mixed-Cut [pdf]
    Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
    In proceedings of Latin American Theoretical Informatics Symposium (LATIN) 2016.
  • Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel [pdf]
    Geevarghese Philip, Ashutosh Rai, Saket Saurabh
    In proceedings of Mathematical Foundations of Computer Science 2015 - 40th International Symposium, (MFCS) 2015.
  • Bivariate Complexity Analysis of Almost Forest Deletion [pdf]
    Ashutosh Rai, Saket Saurabh
    In proceedings of Annual International Computing and Combinatorics Conference (COCOON) 2015.
  • Kernel Lower Bounds on String Problems [pdf]
    Manu Basawaraju, Fahad Panolan, Ashutosh rai, M. S. Ramanujan, Saket Saurabh
    In proceedings of Annual International Computing and Combinatorics Conference (COCOON) 2014.
  • Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound [pdf] [slides] [arxiv]
    Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh
    In proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2013.
  • Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs [pdf]
    Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
    In proceedings of 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG) 2013.
  • Kernel lower bounds using co-nondeterminism: Finding induced hereditary subgraphs [pdf]
    Stefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman
    In proceedings of 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) 2012.
  • Faster Parameterized Algorithms for Deletion to Split Graphs [pdf] [slides]
    Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
    In proceedings of 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) 2012.
  • On the kernelization complexity of problems on graphs without long odd cycles [pdf]
    Fahad Panolan, Ashutosh Rai
    In proceedings of 18th Annual International Computing and Combinatorics Conference (COCOON) 2012.
Master's Thesis
Kernelization Lower Bounds: A Survey [pdf] [slides]