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: 3.

Article

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

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

Conference or Workshop Item

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.

This list was generated on Thu Jan 27 22:38:17 2022 IST.