Browse by IITH Authors
 | Up a level |
Article
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
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
Thesis
Nayak, Bhagirathi and Aravind, N R (2018) Hardness of Games and Graph Sampling. Masters thesis, Indian Institute of Technology Hyderabad.
