Faster parameterized algorithms for deletion to split graphs E Ghosh, S Kolay, M Kumar, P Misra, F Panolan, A Rai, MS Ramanujan Algorithmica 71 (4), 989-1006, 2015 | 42 | 2015 |

Kernel lower bounds using co-nondeterminism: Finding induced hereditary subgraphs S Kratsch, M Pilipczuk, A Rai, V Raman ACM Transactions on Computation Theory (TOCT) 7 (1), 1-18, 2015 | 23 | 2015 |

Lossy kernels for graph contraction problems R Krithika, P Misra, A Rai, P Tale 36th IARCS Annual Conference on Foundations of Software Technology and …, 2016 | 18 | 2016 |

Faster parameterized algorithms for deletion to split graphs E Ghosh, S Kolay, M Kumar, P Misra, F Panolan, A Rai, MS Ramanujan Scandinavian Workshop on Algorithm Theory, 107-118, 2012 | 18 | 2012 |

Polynomial Kernels for {\lambda}-extendible Properties Parameterized Above the Poljak-Turz\'ik Bound R Crowston, M Jones, G Muciaccia, G Philip, A Rai, S Saurabh arXiv preprint arXiv:1310.2928, 2013 | 15 | 2013 |

Generalized pseudoforest deletion: Algorithms and uniform kernel G Philip, A Rai, S Saurabh SIAM Journal on Discrete Mathematics 32 (2), 882-901, 2018 | 13 | 2018 |

Parameterized and exact algorithms for class domination coloring R Krithika, A Rai, S Saurabh, P Tale Discrete Applied Mathematics 291, 286-299, 2021 | 10 | 2021 |

Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs N Misra, F Panolan, A Rai, V Raman, S Saurabh International Workshop on Graph-Theoretic Concepts in Computer Science, 370-381, 2013 | 9 | 2013 |

A polynomial kernel for diamond-free editing Y Cao, A Rai, RB Sandeep, J Ye Algorithmica 84 (1), 197-215, 2022 | 7 | 2022 |

On the kernelization complexity of string problems M Basavaraju, F Panolan, A Rai, MS Ramanujan, S Saurabh Theoretical Computer Science 730, 21-31, 2018 | 7 | 2018 |

Parameterized Inapproximability of Independent Set in *H*-Free GraphsP Dvořák, AE Feldmann, A Rai, P Rzążewski International Workshop on Graph-Theoretic Concepts in Computer Science, 40-53, 2020 | 6 | 2020 |

A Parameterized Algorithm for Mixed-Cut A Rai, MS Ramanujan, S Saurabh LATIN 2016: Theoretical Informatics, 672-685, 2016 | 6 | 2016 |

Bivariate complexity analysis of almost forest deletion A Rai, S Saurabh Theoretical Computer Science 708, 18-33, 2018 | 5 | 2018 |

Fixed-parameter tractability of the weighted edge clique partition problem AE Feldmann, D Issac, A Rai arXiv preprint arXiv:2002.07761, 2020 | 4 | 2020 |

Bivariate Complexity Analysis of Almost Forest Deletion A Rai, S Saurabh International Computing and Combinatorics Conference, 133-144, 2015 | 4 | 2015 |

Strong parameterized deletion: Bipartite graphs A Rai, MS Ramanujan 36th IARCS Annual Conference on Foundations of Software Technology and …, 2016 | 3 | 2016 |

On the kernelization complexity of string problems M Basavaraju, F Panolan, A Rai, MS Ramanujan, S Saurabh International Computing and Combinatorics Conference, 141-153, 2014 | 3 | 2014 |

On the kernelization complexity of problems on graphs without long odd cycles F Panolan, A Rai International Computing and Combinatorics Conference, 445-457, 2012 | 3 | 2012 |

Parameterized algorithms for max colorable induced subgraph problem on perfect graphs N Misra, F Panolan, A Rai, V Raman, S Saurabh Algorithmica 81 (1), 26-46, 2019 | 2 | 2019 |

Parameterized algorithms for graph modification problems A Rai Ph. D. thesis, Homi Bhabha National Institute, Chennai, India, 2016 | 2 | 2016 |