Browse by IITH Authors

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 14.


Aravind, N R (2023) Perfectly matched sets in graphs: Parameterized and exact computation. Theoretical Computer Science, 954. p. 113797. ISSN 0304-3975

Aravind, N R and Maniyar, Udit (2022) Planar projections of graphs. Discrete Applied Mathematics, 319. pp. 216-222. ISSN 0166-218X

Aravind, N. R. and Cambie, Stijn and Cames van Batenburg, Wouter and De Joannis de Verclos, Rémi and Kang, Ross J. and Patel, Viresh (2021) Structure and Colour in Triangle-Free Graphs. The Electronic Journal of Combinatorics, 28 (2). ISSN 1077-8926

Aravind, N.R. and Kalyanasundaram, Subrahmanyam and Kare, Anjeneya Swami (2021) Vertex partitioning problems on graphs with bounded tree width. Discrete Applied Mathematics. ISSN 0166218X

Aravind, N R and Subramanian, C.R. (2020) Intersection dimension and graph invariants. Discussiones Mathematicae Graph Theory, 41 (1). pp. 153-166. ISSN 1234-3099

Agrawal, Akanksha and Aravind, N.R. and Kalyanasundaram, Subrahmanyam and Kare, Anjeneya Swami and Lauri, Juho and Misra, Neeldhara and Reddy, I. Vinod (2020) Parameterized complexity of happy coloring problems. Theoretical Computer Science, 835. pp. 58-81. ISSN 03043975

Aravind, N R and Sandeep, R B and Sivadasan, N (2017) On Polynomial Kernelization of H-free Edge Deletion. Algorithmica, 79 (3). pp. 654-666. ISSN 0178-4617

Aravind, N R and Subrahmanyam, C R (2013) Forbidden subgraph colorings and the oriented chromatic number. European Journal of Combinatorics. pp. 620-631.

Book Section

Aravind, N R and Kalyanasundaram, Subrahmanyam and Kare, A S (2016) Linear Time Algorithms for Happy Vertex Coloring Problems for Trees. In: Combinatorial Algorithms: 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings. Lecture Notes in Computer Science, 9843 . Springer, Switzerland, pp. 281-292. ISBN 978-3-319-44542-7

Conference or Workshop Item

Aravind, N.R. and Misra, N. and Mittal, H. (2022) Chess Is Hard Even for a Single Player. In: International Conference on Fun with Algorithms, FUN 2022, 30 May 2022 through 3 June 2022, Sicily.

Aravind, N. R. and Saxena, R. (2021) An FPT Algorithm for Matching Cut and d-Cut. In: 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021, 5 July 2021 through 7 July 2021, Virtual, Online.

Aravind, N. R. and Maniyar, Udit (2020) Planar Projections of Graphs. In: 6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020, 13-15 February 2020, Hyderabad.


Pandey, Digvijay and Aravind, N R (2019) Queue Layout of Planar 3−Tree. Masters thesis, Indian institute of technology Hyderabad.

Nayak, Bhagirathi and Aravind, N R (2018) Hardness of Games and Graph Sampling. Masters thesis, Indian Institute of Technology Hyderabad.

This list was generated on Sat Sep 30 22:08:49 2023 IST.