N. R. Aravind

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 35

Top Topics

Bounded Tree Width

Cubic Spline Interpolation

Parameterized Complexity

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

Publications

N. R. Aravind, Neeldhara Misra, Harshil Mittal
Chess is hard even for a single player. Theor. Comput. Sci. 1015 (2024)
N. R. Aravind, Roopam Saxena
The Parameterized Complexity of Terminal Monitoring Set. WALCOM (2024)
N. R. Aravind, Roopam Saxena
The Parameterized Complexity of Terminal Monitoring Set. CoRR (2024)
Vishwanath R. Singireddy, Manjanna Basappa, N. R. Aravind
Line-Constrained k-Semi-Obnoxious Facility Location. CoRR (2023)
N. R. Aravind, Roopam Saxena
Parameterized Complexity of Path Set Packing. WALCOM (2023)
N. R. Aravind, Roopam Saxena
Perfectly matched sets in graphs: Parameterized and exact computation. Theor. Comput. Sci. 954 (2023)
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
Vertex partitioning problems on graphs with bounded tree width. Discret. Appl. Math. 319 (2022)
N. R. Aravind, Roopam Saxena
Parameterized Complexity of Path Set Packing. CoRR (2022)
N. R. Aravind, Neeldhara Misra, Harshil Mittal
Chess is hard even for a single player. CoRR (2022)
N. R. Aravind, Udit Maniyar
Planar projections of graphs. Discret. Appl. Math. 319 (2022)
N. R. Aravind, Neeldhara Misra, Harshil Mittal
Chess Is Hard Even for a Single Player. FUN (2022)
N. R. Aravind, Roopam Saxena
Perfectly Matched Sets in Graphs: Hardness, Kernelization Lower Bound, and FPT and Exact Algorithms. CoRR (2021)
N. R. Aravind, C. R. Subramanian
Intersection dimension and graph invariants. Discuss. Math. Graph Theory 41 (1) (2021)
N. R. Aravind, Roopam Saxena
An FPT Algorithm for Matching Cut and d-Cut. IWOCA (2021)
N. R. Aravind, Roopam Saxena
An FPT algorithm for Matching Cut. CoRR (2021)
N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, Viresh Patel
Structure and Colour in Triangle-Free Graphs. Electron. J. Comb. 28 (2) (2021)
Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy
Parameterized complexity of happy coloring problems. Theor. Comput. Sci. 835 (2020)
N. R. Aravind, Udit Maniyar
Planar Projections of Graphs. CALDAM (2020)
N. R. Aravind, Udit Maniyar
Planar projections of graphs. CoRR (2020)
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
H-Free Coloring on Graphs with Bounded Tree-Width. CALDAM (2019)
N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, Viresh Patel
Structure and colour in triangle-free graphs. CoRR (2019)
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
Bipartitioning Problems on Graphs with Bounded Tree-Width. CoRR (2018)
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
On Polynomial Kernelization of H-free Edge Deletion. Algorithmica 79 (3) (2017)
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
Dichotomy Results on the Hardness of H-free Edge Modification Problems. SIAM J. Discret. Math. 31 (1) (2017)
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
On Structural Parameterizations of the Matching Cut Problem. COCOA (2) (2017)
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri
Algorithms and hardness results for happy coloring problems. CoRR (2017)
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems. LATIN (2016)
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
Linear Time Algorithms for Happy Vertex Coloring Problems for Trees. IWOCA (2016)
N. R. Aravind, Pushkar S. Joglekar
On the expressive power of read-once determinants. CoRR (2015)
N. R. Aravind, Pushkar S. Joglekar
On the Expressive Power of Read-Once Determinants. FCT (2015)
N. R. Aravind, Subrahmanyam Kalyanasundaram, R. B. Sandeep, Naveen Sivadasan
The chromatic discrepancy of graphs. Discret. Appl. Math. 184 (2015)
Pushkar S. Joglekar, N. R. Aravind
On the expressive power of read-once determinants. Electron. Colloquium Comput. Complex. 22 (2015)
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of $H$-free Edge Modification Problems. CoRR (2015)
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
Parameterized lower bound and NP-completeness of some H-free Edge Deletion problems. CoRR (2015)
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems. COCOA (2015)
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
On Polynomial Kernelization of $\mathcal{H}$-free Edge Deletion. CoRR (2014)
N. R. Aravind, R. B. Sandeep, Naveen Sivadasan
-free Edge Deletion. IPEC (2014)
N. R. Aravind, C. R. Subramanian
Forbidden subgraph colorings and the oriented chromatic number. Eur. J. Comb. 34 (3) (2013)
N. R. Aravind, T. Karthick, C. R. Subramanian
Bounding χ in terms of ω and Δ for some classes of graphs. Discret. Math. 311 (12) (2011)
N. R. Aravind, N. Narayanan, C. R. Subramanian
Oriented colouring of some graph products. Discuss. Math. Graph Theory 31 (4) (2011)
N. R. Aravind, C. R. Subramanian
Bounds on vertex colorings with restrictions on the union of color classes. J. Graph Theory 66 (3) (2011)
N. R. Aravind, C. R. Subramanian
Bounds on Edge Colorings with Restrictions on the Union of Color Classes. SIAM J. Discret. Math. 24 (3) (2010)
N. R. Aravind, C. R. Subramanian
Forbidden Subgraph Colorings and the Oriented Chromatic Number. IWOCA (2009)
N. R. Aravind, C. R. Subramanian
Intersection Dimension and Maximum Degree. Electron. Notes Discret. Math. 35 (2009)