Subrahmanyam Kalyanasundaram

According to our database, Subrahmanyam Kalyanasundaram authored at least 34 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of two.

2024

The Complexity of Optimizing Atomic Congestion.

Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Extremal Results on Conflict-free Coloring.

Shiwali Gupta, Subrahmanyam Kalyanasundaram, Rogers Mathew

CoRR, 2023

Traffic Intersections as Agents: A model checking approach for analysing communicating agents.

Thamilselvam B, Yenda Ramesh, Subrahmanyam Kalyanasundaram, M. V. Panduranga Rao

Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, 2023

Decentralized Multi Agent Deep Reinforcement Q-Learning for Intelligent Traffic Controller.

Thamilselvam B, Subrahmanyam Kalyanasundaram, M. V. Panduranga Rao

Proceedings of the Artificial Intelligence Applications and Innovations, 2023

2022

A tight bound for conflict-free coloring in terms of distance to cluster.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram

Discret. Math., 2022

Vertex partitioning problems on graphs with bounded tree width.

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare

Discret. Appl. Math., 2022

Conflict-Free Coloring Bounds on Open Neighborhoods.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

Algorithmica, 2022

Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

J. Graph Theory, 2021

On the tractability of (k, i)-coloring.

Sriram Bhyravarapu, Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare

Discret. Appl. Math., 2021

Conflict-free coloring on open neighborhoods of claw-free graphs.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

CoRR, 2021

Statistical Model Checking for Traffic Models.

Thamilselvam B, Subrahmanyam Kalyanasundaram, Shubham Parmar, M. V. Panduranga Rao

Proceedings of the Formal Methods: Foundations and Applications - 24th Brazilian Symposium, 2021

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs.

Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Pliable Index Coding via Conflict-Free Colorings of Hypergraphs.

Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram

Proceedings of the IEEE International Symposium on Information Theory, 2021

Scalable Coordinated Intelligent Traffic Light Controller for Heterogeneous Traffic Scenarios Using UPPAAL STRATEGO.

Thamilselvam B, Subrahmanyam Kalyanasundaram, M. V. Panduranga Rao

Proceedings of the 13th International Conference on COMmunication Systems & NETworkS, 2021

2020

Parameterized complexity of happy coloring problems.

Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy

Theor. Comput. Sci., 2020

Conflict-free coloring on closed neighborhoods of bounded degree graphs.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew

CoRR, 2020

Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

2019

Conflict-Free Coloring on Open Neighborhoods.

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram

CoRR, 2019

Coordinated Intelligent Traffic Lights using Uppaal Stratego.

Thamilselvam B, Subrahmanyam Kalyanasundaram, M. V. Panduranga Rao

Proceedings of the 11th International Conference on Communication Systems & Networks, 2019

H-Free Coloring on Graphs with Bounded Tree-Width.

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Bipartitioning Problems on Graphs with Bounded Tree-Width.

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare

CoRR, 2018

Exact Computation of the Number of Accepting Paths of an NTM.

Subrahmanyam Kalyanasundaram, Kenneth W. Regan

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

Algorithms and hardness results for happy coloring problems.

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri

CoRR, 2017

Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture.

Nandini Singhal, Sathya Peri, Subrahmanyam Kalyanasundaram

Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

On Structural Parameterizations of the Matching Cut Problem.

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Linear Time Algorithms for Happy Vertex Coloring Problems for Trees.

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015

The chromatic discrepancy of graphs.

N. R. Aravind, Subrahmanyam Kalyanasundaram, R. B. Sandeep, Naveen Sivadasan

Discret. Appl. Math., 2015

An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions.

Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira

Comb. Probab. Comput., 2015

Multi-threaded Graph Coloring Algorithm in Shared Memory Architecture.

Nandini Singhal, Sathya Peri, Subrahmanyam Kalyanasundaram

CoRR, 2015

2013

A Note on Even Cycles and Quasirandom Tournaments.

Subrahmanyam Kalyanasundaram, Asaf Shapira

J. Graph Theory, 2013

2012

Improved simulation of nondeterministic Turing machines.

Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh

Theor. Comput. Sci., 2012

A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma.

Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira

SIAM J. Discret. Math., 2012

2009

Algorithms for Message Ferrying on Mobile ad hoc Networks.

Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, Richard J. Lipton

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009