| 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 | 49 | 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 | 22 | 2016 |
| Generalized pseudoforest deletion: Algorithms and uniform kernel G Philip, A Rai, S Saurabh SIAM Journal on Discrete Mathematics 32 (2), 882-901, 2018 | 20 | 2018 |
| 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 | 19 | 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 | 18 | 2013 |
| Parameterized and exact algorithms for class domination coloring R Krithika, A Rai, S Saurabh, P Tale Discrete Applied Mathematics 291, 286-299, 2021 | 16 | 2021 |
| Kernel lower bounds using co-nondeterminism: Finding induced hereditary subgraphs S Kratsch, M Pilipczuk, A Rai, V Raman Algorithm Theory–SWAT 2012: 13th Scandinavian Symposium and Workshops …, 2012 | 15 | 2012 |
| On the kernelization complexity of string problems M Basavaraju, F Panolan, A Rai, MS Ramanujan, S Saurabh Theoretical Computer Science 730, 21-31, 2018 | 12 | 2018 |
| Bivariate complexity analysis of almost forest deletion A Rai, S Saurabh Theoretical Computer Science 708, 18-33, 2018 | 10 | 2018 |
| 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 | 10 | 2015 |
| Parameterized inapproximability of independent set in H-free graphs P Dvořák, AE Feldmann, A Rai, P Rzążewski Algorithmica 85 (4), 902-928, 2023 | 9 | 2023 |
| A polynomial kernel for diamond-free editing Y Cao, A Rai, RB Sandeep, J Ye Algorithmica, 1-19, 2018 | 9 | 2018 |
| Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs N Misra, F Panolan, A Rai, V Raman, S Saurabh Graph-Theoretic Concepts in Computer Science: 39th International Workshop …, 2013 | 9 | 2013 |
| Energy conservation aspect of induction motors using improved design and power controllers SS Murthy, CS Jha, SR Lakshmi, AK Rai, DA Desai Proceedings of the 24th Intersociety Energy Conversion Engineering …, 1989 | 8 | 1989 |
| A Parameterized Algorithm for Mixed-Cut A Rai, MS Ramanujan, S Saurabh LATIN 2016: Theoretical Informatics, 672-685, 2016 | 7 | 2016 |
| Fixed-parameter tractability of the weighted edge clique partition problem AE Feldmann, D Issac, A Rai arXiv preprint arXiv:2002.07761, 2020 | 5 | 2020 |
| Strong parameterized deletion: Bipartite graphs A Rai, MS Ramanujan 36th IARCS Annual Conference on Foundations of Software Technology and …, 2016 | 5 | 2016 |
| Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs N Misra, F Panolan, A Rai, V Raman, S Saurabh Algorithmica 81, 26-46, 2019 | 4 | 2019 |
| Bivariate Complexity Analysis of Almost Forest Deletion A Rai, S Saurabh Computing and Combinatorics: 21st International Conference, COCOON 2015 …, 2015 | 4 | 2015 |
| On the kernelization complexity of string problems M Basavaraju, F Panolan, A Rai, MS Ramanujan, S Saurabh Computing and Combinatorics: 20th International Conference, COCOON 2014 …, 2014 | 3 | 2014 |
Saket SaurabhProfessor at Institute of Mathematical Sciences在 imsc.res.in 的电子邮件经过验证
