| Chess is hard even for a single player | N.R.Aravind, Neeldhara Misra, Harshil Mittal | Theoretical Computer Science | 2024 |
| Perfectly matched sets in graphs: Parameterized and exact computation | N.R.Aravind, Roopam Saxena | Theoretical Computer Science | 2023 |
| Planar projections of graphs | N.R.Aravind, Udit Maniyar | Discrete Applied Mathematics | 2022 |
| Vertex partitioning problems on graphs with bounded tree width | N.R.Aravind, Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare | Discrete Applied Mathematics | 2022 |
| Structure and color in triangle-free graphs | N.R.Aravind, Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, Viresh Patel | Electronic Journal of Combinatorics | 2021 |
| Intersection dimension and graph invariants | N.R.Aravind, C.R.Subramanian | Discuss. Math. Graph Theory | 2021 |
| Parameterized complexity of happy coloring problems | Akanksha Agarwal, N.R.Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy | Theoretical Computer Science | 2020 |
| On polynomial kernelization of H-free edge deletion | N.R.Aravind, R.B.Sandeep, Naveen Sivadasan | Algorithmica | 2017 |
| Dichotomy results on the hardness of H-free edge modification problems | N.R.Aravind, R.B.Sandeep, Naveen Sivadasan | SIAM Journal of Discrete Mathematics | 2017 |
| The chromatic discrepancy of graphs | N.R.Aravind, Subrahmanyam Kalyanasundaram, R.B.Sandeep, Naveen Sivadasan | Discrete Applied Mathematics | 2015 |
| Forbidden subgraph colorings and the oriented chromatic number | N.R.Aravind, C.R. Subramanian | European Journal of Combinatorics | 2013 |
| Oriented colouring of some graph products | N.R.Aravind, N.Narayanan, C.R.Subramanian | Discussiones Mathematicae Graph Theory | 2011 |
| Bounding $\chi$ in terms of $\omega$ and $\Delta$ for some classes of graphs | N.R.Aravind, T.Karthick, C.R.Subramanian | Discrete Mathematics | 2011 |
| Bounds on vertex colorings with restrictions on the union of color classes | N.R.Aravind, C.R.Subramanian | Journal of Graph Theory | 2011 |
| Bounds on edge colorings with restrictions on the union of color classes | N.R.Aravind, C.R.Subramanian | SIAM Journal on Discrete Mathematics | 2010 |
| The Parameterized Complexity of Terminal Monitoring Set | N.R.Aravind, Roopam Saxena | WALCOM | 2024 |
| Parameterized Complexity of Path set Packing | N.R.Aravind, Roopam Saxena | WALCOM | 2023 |
| Chess is hard even for a single player. | N.R.Aravind, Neeldhara Misra and Harshil Mittal | FUN | 2022 |
| An FPT Algorithm for Matching Cut and d-Cut | N.R.Aravind, Roopam Saxena | IWOCA | 2021 |
| Planar projections of graphs | N.R.Aravind, Udit Maniyar | CALDAM | 2020 |
| H-free coloring on graphs with bounded treewidth | N.R.Aravind, Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare | CALDAM | 2020 |
| Linear time algorithms for happy vertex coloring problems for trees | N.R.Aravind, Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare | IWOCA | 2016 |
| On structural parameterizations of the matching cut problem | N.R.Aravind, Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare | COCOA | 2017 |
| Parameterized Lower bounds and dichotomy results for the NP-completeness of H-free edge modification problems | N.R.Aravind, R.B.Sandeep, Naveen Sivadasan | LATIN | 2016 |
| Parameterized lower bounds and NP-completeness of some H-free edge deletion problems | N.R.Aravind, R.B. Sandeep and Naveen Sivadasan | COCOA | 2015 |
| On the Expressive Power of Read-Once Determinants | N.R.Aravind, Pushkar Joglekar | Foundations of Computation Theory (FCT) | 2015 |
| On Polynomial Kernelization of H-free Edge Deletion | N.R.Aravind, R.B. Sandeep and Naveen Sivadasan | IPEC | 2014 |
| Intersection Dimension and Maximum Degree | N.R.Aravind, C.R. Subramanian | LAGOS | 2009 |
| Forbidden subgraph colorings and the oriented chromatic number | N.R.Aravind, C.R.Subramanian | IWOCA | 2009 |