| 2024 | WALCOM | The Parameterized Complexity of Terminal Monitoring Set. | N. R. Aravind, Roopam Saxena |
| 2023 | WALCOM | Parameterized Complexity of Path Set Packing. | N. R. Aravind, Roopam Saxena |
| 2022 | FUN | Chess Is Hard Even for a Single Player. | N. R. Aravind, Neeldhara Misra, Harshil Mittal |
| 2021 | IWOCA | An FPT Algorithm for Matching Cut and d-Cut. | N. R. Aravind, Roopam Saxena |
| 2017 | COCOA | On Structural Parameterizations of the Matching Cut Problem. | N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare |
| 2016 | IWOCA | Linear Time Algorithms for Happy Vertex Coloring Problems for Trees. | N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare |
| 2016 | LATIN | Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems. | N. R. Aravind, R. B. Sandeep, Naveen Sivadasan |
| 2015 | COCOA | Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems. | N. R. Aravind, R. B. Sandeep, Naveen Sivadasan |
| 2015 | FCT | On the Expressive Power of Read-Once Determinants. | N. R. Aravind, Pushkar S. Joglekar |
| 2009 | IWOCA | Forbidden Subgraph Colorings and the Oriented Chromatic Number. | N. R. Aravind, C. R. Subramanian |