Browse by IITH Authors

Bhyravarapu, Sriram and Kalyanasundaram, Subrahmanyam and Mathew, R. (2022) Conflict-Free Coloring Bounds on Open Neighborhoods. Algorithmica. ISSN 0178-4617

Bhyravarapu, S. and Kalyanasundaram, Subrahmanyam and Mathew, Rogers (2022) Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs. In: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, 22 August 2022 through 26 August 2022, Vienna.

Bhyravarapu, Sriram and Kalyanasundaram, Subrahmanyam (2022) A tight bound for conflict-free coloring in terms of distance to cluster. Discrete Mathematics, 345 (11). ISSN 0012-365X

Krishnan, P. and Mathew, R. and Kalyanasundaram, S. (2021) Pliable Index Coding via Conflict-Free Colorings of Hypergraphs. In: 2021 IEEE International Symposium on Information Theory (ISIT), 12 July 2021 through 20 July 2021, Melbourne, Virtual.

Bhyravarapu, S. and Kalyanasundaram, S. et al. (2021) Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. In: 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021, 5 July 2021 through 7 July 2021, Virtual, Online.

Bhyravarapu, S. and Kalyanasundaram, S. and Mathew, R. (2021) A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs. Journal of Graph Theory, 97 (4). pp. 553-556. ISSN 03649024

Bhyravarapu, Sriram and Joshi, Saurabh and Kalyanasundaram, Subrahmanyam and et al, . (2021) On the tractability of (k,i)-coloring. Discrete Applied Mathematics, 305. pp. 329-339. ISSN 0166-218X

Thamilselvam, B and Kalyanasundaram, Subrahmanyam and Rao, M V Panduranga (2021) Scalable Coordinated Intelligent Traffic Light Controller for Heterogeneous Traffic Scenarios Using UPPAAL STRATEGO. In: 2021 International Conference on COMmunication Systems and NETworkS, COMSNETS 2021, 5 January 2021 - 9 January 2021.

Thamilselvam, B. and Kalyanasundaram, Subrahmanyam and Parmar, Shubham and Panduranga Rao, M. V. (2021) Statistical Model Checking for Traffic Models. In: 24th Brazilian Symposium on Formal Methods, SBMF 2021, 6 December 2021through 10 December 2021, Virtual, Online.

Bhyravarapu, Sriram and Kalyanasundaram, Subrahmanyam (2020) Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods. In: 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020, 24 June 2020through 26 June 2020, Leeds.

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.

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

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

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

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.

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

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

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.

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