On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles. - Fahad Panolan; Ashutosh Rai 001 (COCOON, 2012)

Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound. - Robert Crowston; Mark Jones 001; Gabriele Muciaccia; Geevarghese Philip; Ashutosh Rai 001; Saket Saurabh 001 (FSTTCS, 2013)

Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzík Bound. - Robert Crowston; Mark Jones 001; Gabriele Muciaccia; Geevarghese Philip; Ashutosh Rai 001; Saket Saurabh 001 (CoRR, 2013)

Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs. - Stefan Kratsch; Marcin Pilipczuk; Ashutosh Rai 001; Venkatesh Raman 001 (ACM Trans. Comput. Theory, 2014)

Faster Parameterized Algorithms for Deletion to Split Graphs. - Esha Ghosh; Sudeshna Kolay; Mrinal Kumar 001; Pranabendu Misra; Fahad Panolan; Ashutosh Rai 001; M. S. Ramanujan 001 (Algorithmica, 2015)

Strong Parameterized Deletion: Bipartite Graphs. - Ashutosh Rai 001; M. S. Ramanujan 001 (FSTTCS, 2016)

Lossy Kernels for Graph Contraction Problems. - R. Krithika 001; Pranabendu Misra; Ashutosh Rai 001; Prafullkumar Tale (FSTTCS, 2016)

A Parameterized Algorithm for Mixed-Cut. - Ashutosh Rai 001; M. S. Ramanujan 001; Saket Saurabh 001 (LATIN, 2016)

Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. - Geevarghese Philip; Ashutosh Rai 001; Saket Saurabh 001 (SIAM J. Discret. Math., 2018)

On the kernelization complexity of string problems. - Manu Basavaraju; Fahad Panolan; Ashutosh Rai 001; M. S. Ramanujan 001; Saket Saurabh 001 (Theor. Comput. Sci., 2018)

Bivariate complexity analysis of Almost Forest Deletion. - Ashutosh Rai 001; Saket Saurabh 001 (Theor. Comput. Sci., 2018)

Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. - Neeldhara Misra; Fahad Panolan; Ashutosh Rai 001; Venkatesh Raman 001; Saket Saurabh 001 (Algorithmica, 2019)

Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. - Andreas Emil Feldmann; Davis Issac; Ashutosh Rai 001 (IPEC, 2020)

Quick Separation in Chordal and Split Graphs. - Pranabendu Misra; Fahad Panolan; Ashutosh Rai 001; Saket Saurabh 001; Roohani Sharma (MFCS, 2020)

On Extended Formulations For Parameterized Steiner Trees. - Andreas Emil Feldmann; Ashutosh Rai 001 (IPEC, 2021)

Parameterized and exact algorithms for class domination coloring. - R. Krithika 001; Ashutosh Rai 001; Saket Saurabh 001; Prafullkumar Tale (Discret. Appl. Math., 2021)

Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. - Petr A. Golovach; Fahad Panolan; Ashutosh Rai 001; Saket Saurabh 001 (CSR, 2022)

A Polynomial Kernel for Diamond-Free Editing. - Yixin Cao 001; Ashutosh Rai 001; R. B. Sandeep; Junjie Ye (Algorithmica, 2022)

Parameterized Approximation Scheme for Feedback Vertex Set. - Satyabrata Jana; Daniel Lokshtanov; Soumen Mandal 001; Ashutosh Rai 001; Saket Saurabh 001 (MFCS, 2023)

Parameterized Inapproximability of Independent Set in H-Free Graphs. - Pavel Dvorák; Andreas Emil Feldmann; Ashutosh Rai 001; Pawel Rzazewski (Algorithmica, 2023)

On the Parameterized Complexity of Diverse SAT. - Neeldhara Misra; Harshil Mittal; Ashutosh Rai 001 (ISAAC, 2024)

Parameterized Complexity of Untangling Knots. - Clément Legrand-Duchesne; Ashutosh Rai 001; Martin Tancer (SIAM J. Comput., 2024)

Parameterized approximation algorithms for weighted vertex cover. - Soumen Mandal 001; Pranabendu Misra; Ashutosh Rai 001; Saket Saurabh 001 (Theor. Comput. Sci., 2024)