Browse by IITH Authors

N R, Aravind and Kalyanasundaram, Subrahmanyam and Kare, A S (2017) On Structural Parameterizations of the Matching Cut Problem. In: International Conference on Combinatorial Optimization and Applications, December 16-18, 2017, China.

Joshi, Archit Pradeep and N R, Aravind (2017) Tree-Decomposition. Masters thesis, Indian Insitute of Technology Hyderabad.

N R, Aravind and R B, Sandeep and Sivadasan, N (2016) Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems. In: LATIN 2016: Theoretical Informatics (12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings). Lecture Notes in Computer Science, 9644 . Springer Berlin Heidelberg, pp. 82-95. ISBN 978-3-662-49529-2

N R, Aravind (2015) On the Expressive Power of Read-Once Determinants. In: Fundamentals of Computation Theory [20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings]. Lecture Notes in Computer Science, 9210 . Springer International Publishing, Switzerland, pp. 95-105. ISBN 978-3-319-22177-9

N R, Aravind and R B, Sandeep and Sivadasan, N (2015) Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems. In: Combinatorial Optimization and Applications 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings. Lecture Notes in Computer Science, 9486 . Springer International Publishing, pp. 424-438. ISBN 978-3-319-26625-1

N R, Aravind and Kalyanasundaram, S and R B, Sandeep and Sivadasan, N (2015) The chromatic discrepancy of graphs. Discrete Applied Mathematics, 184. pp. 40-49. ISSN 0166-218X

N R, Aravind and R B, Sandeep and Sivadasan, N (2014) On polynomial kernelization of h-free edge deletion. In: 9th International Symposium on Parameterized and Exact Computation, IPEC 2014, 10-12 September 2014, Wroclaw; Poland.