Subrahmanyam Kalyanasundaram

Orcid: 0000-0001-9094-3368

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

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




Pliable Index Coding via Conflict-Free Colorings of Hypergraphs.
IEEE Trans. Inf. Theory, June, 2024

The Complexity of Optimizing Atomic Congestion.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Extremal Results on Conflict-free Coloring.
CoRR, 2023

Traffic Intersections as Agents: A model checking approach for analysing communicating agents.
Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, 2023

Decentralized Multi Agent Deep Reinforcement Q-Learning for Intelligent Traffic Controller.
Proceedings of the Artificial Intelligence Applications and Innovations, 2023

A tight bound for conflict-free coloring in terms of distance to cluster.
Discret. Math., 2022

Vertex partitioning problems on graphs with bounded tree width.
Discret. Appl. Math., 2022

Conflict-Free Coloring Bounds on Open Neighborhoods.
Algorithmica, 2022

Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs.
J. Graph Theory, 2021

On the tractability of (k, i)-coloring.
Discret. Appl. Math., 2021

Conflict-free coloring on open neighborhoods of claw-free graphs.
CoRR, 2021

Statistical Model Checking for Traffic Models.
Proceedings of the Formal Methods: Foundations and Applications - 24th Brazilian Symposium, 2021

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Scalable Coordinated Intelligent Traffic Light Controller for Heterogeneous Traffic Scenarios Using UPPAAL STRATEGO.
Proceedings of the 13th International Conference on COMmunication Systems & NETworkS, 2021

Parameterized complexity of happy coloring problems.
Theor. Comput. Sci., 2020

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

Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Conflict-Free Coloring on Open Neighborhoods.
CoRR, 2019

Coordinated Intelligent Traffic Lights using Uppaal Stratego.
Proceedings of the 11th International Conference on Communication Systems & Networks, 2019

H-Free Coloring on Graphs with Bounded Tree-Width.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

Bipartitioning Problems on Graphs with Bounded Tree-Width.
CoRR, 2018

Exact Computation of the Number of Accepting Paths of an NTM.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

Algorithms and hardness results for happy coloring problems.
CoRR, 2017

Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture.
Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

On Structural Parameterizations of the Matching Cut Problem.
Proceedings of the Combinatorial Optimization and Applications, 2017

Linear Time Algorithms for Happy Vertex Coloring Problems for Trees.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

The chromatic discrepancy of graphs.
Discret. Appl. Math., 2015

An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions.
Comb. Probab. Comput., 2015

Multi-threaded Graph Coloring Algorithm in Shared Memory Architecture.
CoRR, 2015

A Note on Even Cycles and Quasirandom Tournaments.
J. Graph Theory, 2013

Improved simulation of nondeterministic Turing machines.
Theor. Comput. Sci., 2012

A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma.
SIAM J. Discret. Math., 2012

Algorithms for Message Ferrying on Mobile ad hoc Networks.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009