Intersection Dimension and Maximum Degree. - N. R. Aravind; C. R. Subramanian 001 (Electron. Notes Discret. Math., 2009)

Bounds on Edge Colorings with Restrictions on the Union of Color Classes. - N. R. Aravind; C. R. Subramanian 001 (SIAM J. Discret. Math., 2010)

Bounding χ in terms of ω and Δ for some classes of graphs. - N. R. Aravind; T. Karthick; C. R. Subramanian 001 (Discret. Math., 2011)

Oriented colouring of some graph products. - N. R. Aravind; N. Narayanan 001; C. R. Subramanian 001 (Discuss. Math. Graph Theory, 2011)

Bounds on vertex colorings with restrictions on the union of color classes. - N. R. Aravind; C. R. Subramanian 001 (J. Graph Theory, 2011)

Forbidden subgraph colorings and the oriented chromatic number. - N. R. Aravind; C. R. Subramanian 001 (Eur. J. Comb., 2013)

On Polynomial Kernelization of H -free Edge Deletion. - N. R. Aravind; R. B. Sandeep; Naveen Sivadasan (IPEC, 2014)

On Polynomial Kernelization of $ mathcal{H}$-free Edge Deletion. - N. R. Aravind; R. B. Sandeep; Naveen Sivadasan (CoRR, 2014)

Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems. - N. R. Aravind; R. B. Sandeep; Naveen Sivadasan (COCOA, 2015)

The chromatic discrepancy of graphs. - N. R. Aravind; Subrahmanyam Kalyanasundaram; R. B. Sandeep; Naveen Sivadasan (Discret. Appl. Math., 2015)

On the expressive power of read-once determinants. - Pushkar S. Joglekar; N. R. Aravind (Electron. Colloquium Comput. Complex., 2015)

Linear Time Algorithms for Happy Vertex Coloring Problems for Trees. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (IWOCA, 2016)

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)

On Structural Parameterizations of the Matching Cut Problem. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (COCOA (2), 2017)

On Polynomial Kernelization of H-free Edge Deletion. - N. R. Aravind; R. B. Sandeep; Naveen Sivadasan (Algorithmica, 2017)

Algorithms and hardness results for happy coloring problems. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare; Juho Lauri (CoRR, 2017)

Dichotomy Results on the Hardness of H-free Edge Modification Problems. - N. R. Aravind; R. B. Sandeep; Naveen Sivadasan (SIAM J. Discret. Math., 2017)

Bipartitioning Problems on Graphs with Bounded Tree-Width. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (CoRR, 2018)

H-Free Coloring on Graphs with Bounded Tree-Width. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (CALDAM, 2019)

Parameterized complexity of happy coloring problems. - Akanksha Agrawal 001; N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare; Juho Lauri; Neeldhara Misra; I. Vinod Reddy (Theor. Comput. Sci., 2020)

An FPT Algorithm for Matching Cut and d-Cut. - N. R. Aravind; Roopam Saxena (IWOCA, 2021)

Structure and Colour in Triangle-Free Graphs. - N. R. Aravind; Stijn Cambie; Wouter Cames van Batenburg; Rémi de Joannis de Verclos; Ross J. Kang; Viresh Patel (Electron. J. Comb., 2021)

An FPT algorithm for Matching Cut. - N. R. Aravind; Roopam Saxena (CoRR, 2021)

Perfectly Matched Sets in Graphs: Hardness, Kernelization Lower Bound, and FPT and Exact Algorithms. - N. R. Aravind; Roopam Saxena (CoRR, 2021)

Intersection dimension and graph invariants. - N. R. Aravind; C. R. Subramanian 001 (Discuss. Math. Graph Theory, 2021)

Vertex partitioning problems on graphs with bounded tree width. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (Discret. Appl. Math., 2022)

Planar projections of graphs. - N. R. Aravind; Udit Maniyar (Discret. Appl. Math., 2022)

Parameterized Complexity of Path Set Packing. - N. R. Aravind; Roopam Saxena (WALCOM, 2023)

Line-Constrained k-Semi-Obnoxious Facility Location. - Vishwanath R. Singireddy; Manjanna Basappa; N. R. Aravind (CoRR, 2023)

Perfectly matched sets in graphs: Parameterized and exact computation. - N. R. Aravind; Roopam Saxena (Theor. Comput. Sci., 2023)

The Parameterized Complexity of Terminal Monitoring Set. - N. R. Aravind; Roopam Saxena (WALCOM, 2024)

Chess is hard even for a single player. - N. R. Aravind; Neeldhara Misra; Harshil Mittal (Theor. Comput. Sci., 2024)