N. R. Aravind - RankMe

46 papers B 5C 4Misc 1Journal 33Unranked 3

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