| 2026 | MFCS | The Parameterized Complexity of Maximum Span on Natural Matroid Classes. | Madhumita Kundu, Ashutosh Rai, Sahiba, Saket Saurabh |
| 2026 | MFCS | Bi-Criteria Approximations for Vertex Deletion Problems and d-Hitting Set. | Soumen Mandal, Ashutosh Rai, Saket Saurabh |
| 2025 | IECON | Vehicle-to-Vehicle Wireless Power Transfer in Electric Vehicles for Input Supply Outage Scenarios. | Ashutosh Rai, Abhishek Singhal, Narsa Reddy Tummuru, Venkata Ratnam Vakacharla |
| 2025 | IECON | Solar Power Based Subsea Docking Station for Wireless Charging of AUVs. | Abhishek Singhal, Ashutosh Rai, Narsa Reddy Tummuru, G. Shrikanth Reddy |
| 2025 | WG | Chromatic Index Under Parameterized Settings. | Sriram Bhyravarapu, Soumen Mandal, Ashutosh Rai, Saket Saurabh, Shaily Verma |
| 2024 | ISAAC | On the Parameterized Complexity of Diverse SAT. | Neeldhara Misra, Harshil Mittal, Ashutosh Rai |
| 2024 | LATIN | Parameterized Approximation Algorithms for Weighted Vertex Cover. | Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh |
| 2023 | MFCS | Parameterized Approximation Scheme for Feedback Vertex Set. | Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh |
| 2022 | CSR | Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. | Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh |
| 2022 | ICALP | Parameterized Complexity of Untangling Knots. | Clment Legrand-Duchesne, Ashutosh Rai, Martin Tancer |
| 2020 | MFCS | Quick Separation in Chordal and Split Graphs. | Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma |
| 2020 | WG | Parameterized Inapproximability of Independent Set in H-Free Graphs. | Pavel Dvork, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski |
| 2018 | ESA | A Polynomial Kernel for Diamond-Free Editing. | Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye |
| 2017 | SOFSEM | Parameterized and Exact Algorithms for Class Domination Coloring. | R. Krithika, Ashutosh Rai, Saket Saurabh, Prafullkumar Tale |
| 2016 | LATIN | A Parameterized Algorithm for Mixed-Cut. | Ashutosh Rai, M. S. Ramanujan, Saket Saurabh |
| 2015 | COCOON | Bivariate Complexity Analysis of Almost Forest Deletion. | Ashutosh Rai, Saket Saurabh |
| 2015 | MFCS | Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. | Geevarghese Philip, Ashutosh Rai, Saket Saurabh |
| 2014 | COCOON | On the Kernelization Complexity of String Problems. | Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh |
| 2013 | WG | Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. | Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh |
| 2012 | COCOON | On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles. | Fahad Panolan, Ashutosh Rai |