Publications

Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy (2024). Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. Algorithmica.

PDF DOI arXiv Publisher Link

Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney (2024). The Complexity of Optimizing Atomic Congestion. Proceedings of the The 38th Annual AAAI Conference on Artificial Intelligence - AAAI 2024, Vancouver, Canada.

DOI Publisher Link arXiv

Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram (2024). Pliable Index Coding via Conflict-Free Colorings of Hypergraphs. IEEE Transactions on Information Theory.

PDF DOI Publisher Link arXiv

B. Thamilselvam, Subrahmanyam Kalyanasundaram, M. V. Panduranga Rao (2023). Decentralized Multi Agent Deep Reinforcement Q-learning for Intelligent Traffic Controller. Proceedings of the 19th IFIP International Conference on Artificial Intelligence Applications and Innovations - AIAI 2023, León, Spain.

PDF DOI Publisher Link

B. Thamilselvam, Y. Ramesh, Subrahmanyam Kalyanasundaram, M. V. Panduranga Rao (2023). Traffic Intersections as Agents: A model checking approach for analysing communicating agents. Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing - SAC 2023, Tallinn, Estonia.

PDF DOI Publisher Link

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram (2022). A tight bound for conflict-free coloring in terms of distance to cluster. Discrete Mathematics, Volume 345, Issue 11, Article 113058.

PDF DOI Publisher Link arXiv

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare (2022). Vertex partitioning problems on graphs with bounded tree width. Discrete Applied Mathematics, Volume 319, pages 254 - 270.

PDF DOI Publisher Link

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew (2022). Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs. Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science - MFCS 2022, Vienna, Austria.

PDF Slides DOI Publisher Link

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew (2022). Conflict-Free Coloring Bounds on Open Neighborhoods. Algorithmica, Volume 84, pages 2154-2185.

PDF DOI Publisher Link

Sriram Bhyravarapu, Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare (2021). On the Tractability of $(k,i)$-Coloring. Discrete Applied Mathematics, Volume 305, pages 329-339.

PDF DOI arXiv Publisher Link

B. Thamilselvam, Subrahmanyam Kalyanasundaram, Shubham Parmar, M. V. Panduranga Rao (2021). Statistical Model Checking for Traffic Models. Proceedings of the Brazilian Symposium on Formal Methods - SBMF 2021, Campina Grande, Brazil.

PDF DOI Publisher Link

Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram (2021). Pliable Index Coding via Conflict-Free Colorings of Hypergraphs. Proceedings of the 2021 IEEE International Symposium on Information Theory - ISIT 2021, Melbourne, Australia.

PDF DOI Publisher Link arXiv

Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy (2021). Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. Proceedings of the 32nd International Workshop on Combinatorial Algorithms - IWOCA 2021, Ottwawa, Canada.

PDF Slides Video DOI arXiv

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew (2021). A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs. Journal of Graph Theory, Volume 97, Issue 4, pages 553-556.

PDF DOI Publisher Link arXiv

B. Thamilselvam, Subrahmanyam Kalyanasundaram, M. V. Panduranga Rao (2021). Scalable Coordinated Intelligent Traffic Light Controller for Heterogeneous Traffic Scenarios Using UPPAAL STRATEGO. Proceedings of the 13th International Conference on Communication Systems and Networks - COMSNETS 2021, Bengaluru, India.

PDF DOI Publisher Link

Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy (2020). Parameterized Complexity of Happy Coloring Problems. Theoretical Computer Science, Volume 835, pages 58-81.

PDF DOI Publisher Link

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram (2020). Combinatorial Bounds for Conflict-free Coloring on Open Neighborhoods. 46th International Workshop on Graph-Theoretic Concepts in Computer Science - WG 2020, Leeds, UK.

PDF Slides Video DOI arXiv

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare (2019). $H$-Free Coloring on Graphs with Bounded Tree-Width. Proceedings of the 5th International Conference on Algorithms and Discrete Applied Mathematics - CALDAM 2019, Kharagpur, India..

PDF DOI Publisher Link

B. Thamilselvam, Subrahmanyam Kalyanasundaram, M. V. Panduranga Rao (2019). Coordinated Intelligent Traffic Lights using Uppaal Stratego. Presented in the 5th Workshop on Intelligent Transportation Systems (ITS). Proceedings of the 11th International Conference on Communication Systems and Networks - COMSNETS 2019, Bengaluru, India.

PDF DOI Publisher Link

Subrahmanyam Kalyanasundaram, Kenneth Regan (2018). Exact computation of the number of accepting paths of an NTM. Proceedings of the 4th International Conference on Algorithms and Discrete Applied Mathematics - CALDAM 2018, Guwahati, India.

PDF Slides DOI Publisher Link

Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram Bhyravarapu (2018). On the Tractability of $(k,i)$-Coloring. Proceedings of the 4th International Conference on Algorithms and Discrete Applied Mathematics - CALDAM 2018, Guwahati, India.

PDF DOI arXiv Publisher Link

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare (2017). On Structural Parameterizations of the Matching Cut Problem. Proceedings of the 11th International Conference on Combinatorial Optimization and Applications - COCOA 2017, Shanghai, China.

PDF DOI Publisher Link

Nandini Singhal, Sathya Peri, Subrahmanyam Kalyanasundaram (2017). Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture. Presented in the 1st International Workshop on Algorithms & Architectures for Distributed Data Analytics (AADDA). Proceedings of the 18th International Conference on Distributed Computing and Networking - ICDCN 2017, Hyderabad, India.

PDF DOI Publisher Link

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare (2016). Linear Time Algorithms for Happy Vertex Coloring Problems for Trees. Proceedings of the 27th International Workshop on Combinatorial Algorithms - IWOCA 2016, Helsinki, Finland.

PDF DOI Publisher Link

N. R. Aravind, Subrahmanyam Kalyanasundaram, R. B. Sandeep, Naveen Sivadasan (2015). The Chromatic Discrepancy of Graphs. Discrete Applied Mathematics, 184. pp. 40-49.

DOI arXiv Publisher Link

Domingos Dellamonica, Subrahmanyam Kalyanasundaram, Daniel Martin, Vojtěch Rödl, Asaf Shapira (2015). An Optimal Algorithm for Computing Frieze-Kannan Regular Partitions. Combinatorics, Probability and Computing, 24(2), pages 407–437.

PDF DOI Publisher Link

S. A. Ahammed, K. Badam, G. V. Bhaskar, S. Chhuttani, A. Gangwar, V. Garg, L. Gupta, A. Jain, R. Jindal, N. Kumar, K. K. Manku, V. K. Midde, M. Nagarjuna, R. Patil, S. Singh, N. Sneha, P. B. Srinivas, M. Tanwani, S. Wasnik, R. Guravannavar, S. Kalyanasundaram, K. Kataoka, M. V. P. Rao, N. Sivadasan (2014). Acquisition, storage, retrieval and dissemination of disaster related data. Proceedings of the IEEE Region 10 Humanitarian Technology Conference 2014, Chennai, India.

PDF DOI Publisher Link

Subrahmanyam Kalyanasundaram, Asaf Shapira (2013). A Note on Even Cycles and Quasi-Random Tournaments. Journal of Graph Theory, Volume 73, Issue 3, pages 260–266.

PDF DOI Publisher Link arXiv

Subrahmanyam Kalyanasundaram, Asaf Shapira (2013). A Wowzer-type Lower bound for the Strong Regularity Lemma. Proceedings of the London Mathematical Society, Volume 106, Issue 3, pages 621–649.

DOI arXiv Publisher Link

Subrahmanyam Kalyanasundaram, Richard Lipton, Kenneth Regan, Farbod Shokrieh (2012). Improved Simulation of Nondeterministic Turing Machines. Theoretical Computer Science (Special MFCS 2010 Issue) Volume 417, pages 66–73.
Preliminary version appeared in the Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2010.

PDF DOI Publisher Link Publisher Link for Conference Version

Domingos Dellamonica, Subrahmanyam Kalyanasundaram, Daniel Martin, Vojtěch Rödl, Asaf Shapira (2012). A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma. SIAM Journal on Discrete Math (SIDMA) Volume 26 Issue 1, pages 15–29.
Preliminary version appeared in the Proceedings of the 15th International Workshop on Randomization and Computation - RANDOM 2011.

PDF DOI Publisher Link Publisher Link for Conference Version

Mostafa Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, Richard Lipton (2009). Algorithms for Message Ferrying on Mobile ad hoc Networks. Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2009, Kanpur, India.

PDF DOI Publisher Link

V. Shashidhar, K. Subrahmanyam, R. Chandrasekharan, B. Sundar Rajan, B. A. Sethuraman (2003). High-rate, full-diversity STBCs from field extensions. Proceedings of IEEE International Symposium on Information Theory (ISIT) 2003, Yokohama, Japan.

PDF DOI Publisher Link