# Browse by IITH Authors

Up a level |

**12**.

## Article

Dellamonica, D and Kalyanasundaram, Subrahmanyam and Martin, D M and Roedl, V and Shapira, A
(2015)
*An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions.*
Combinatorics, Probability and Computing, 24 (2).
pp. 407-437.
ISSN 0963-5483

Kalyanasundaram, Subrahmanyam and Shapira, A
(2013)
*A Note on Even Cycles and Quasi-Random Tournaments.*
Journal of Graph Theory, 73.
pp. 260-266.
ISSN 0364-9024

Kalyanasundaram, Subrahmanyam and Shapira, A
(2013)
*A Note on Even Cycles and Quasirandom Tournaments.*
Journal of Graph Theory, 73 (3).
pp. 260-266.
ISSN 0364-9024

Kalyanasundaram, Subrahmanyam and Shapira, A
(2013)
*A Wowzer-type lower bound for the strong regularity lemma.*
Proceedings of the London Mathematical Society, 106 (3).
pp. 621-649.
ISSN 0024-6115

## 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

B, Thamilselvam and Kalyanasundaram, Subrahmanyam and Rao, M V Panduranga
(2019)
*Coordinated Intelligent Traffic Lights using Uppaal Stratego.*
In: 11th International Conference on Communication Systems and Networks, COMSNETS 2019, 7-11 January 2019, Bengaluru,India.

Aravind, N R and Kalyanasundaram, Subrahmanyam and Kare, Anjeneya Swami
(2019)
*H-Free Coloring on Graphs with Bounded Tree-Width.*
In: 5th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM, 14-16 February 2019, Kharagpur, India.

Singhal, N and Peri, Sathya and Kalyanasundaram, Subrahmanyam
(2017)
*Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture.*
In: Proceedings of the 18th International Conference on Distributed Computing and Networking, January 05 - 07, 2017, Hyderabad, India.

Ahammed, S A and Badam, K and Bhaskar, G V and Chhuttani, S and Gangwar, A and Garg, V and Gupta, L and Jain, A K and Jindal, R and Kumar, N and Manku, K K and Midde, V K and Nagarjuna, M and Patil, R and Singh, S and Sneha, N and Srinivas, P B and Tanwani, M and Wasnik, S and Guravannavar, R and Kalyanasundaram, Subrahmanyam and Kataoka, Kotaro and M V, Panduranga Rao and Sivadasan, N
(2014)
*Acquisition, storage, retrieval and dissemination of disaster related data.*
In: IEEE Region 10 Humanitarian Technology Conference (R10-HTC), 6-9 Aug. 2014.

## Book

Kalyanasundaram, Subrahmanyam and Regan, Kenneth W
(2018)
*Exact Computation of the Number of Accepting Paths of an NTM.*
Springer, pp. 105-117.
ISBN 9783319741802

## Thesis

Ranjan, Rajeev and Kalyanasundaram, Subrahmanyam
(2018)
*Discovering Authorities as a function of time in
Community Question Answering.*
Masters thesis, Indian Institute of Technology Hyderabad.

Kare, A S and Kalyanasundaram, Subrahmanyam
(2018)
*Parameterized Algorithms for Graph
Partitioning Problems.*
PhD thesis, Indian institute of technology Hyderabad.