Algorithms for Message Ferrying on Mobile ad hoc Networks. - Mostafa H. Ammar; Deeparnab Chakrabarty; Atish Das Sarma; Subrahmanyam Kalyanasundaram; Richard J. Lipton (FSTTCS, 2009)

Turing machine algorithms and studies in quasi-randomness. - Subrahmanyam Kalyanasundaram (2011)

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)

Improved simulation of nondeterministic Turing machines. - Subrahmanyam Kalyanasundaram; Richard J. Lipton; Kenneth W. Regan; Farbod Shokrieh (Theor. Comput. Sci., 2012)

A Note on Even Cycles and Quasirandom Tournaments. - Subrahmanyam Kalyanasundaram; Asaf Shapira (J. Graph Theory, 2013)

Multi-threaded Graph Coloring Algorithm in Shared Memory Architecture. - Nandini Singhal; Sathya Peri; Subrahmanyam Kalyanasundaram (CoRR, 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)

The chromatic discrepancy of graphs. - N. R. Aravind; Subrahmanyam Kalyanasundaram; R. B. Sandeep; Naveen Sivadasan (Discret. Appl. Math., 2015)

Linear Time Algorithms for Happy Vertex Coloring Problems for Trees. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (IWOCA, 2016)

On Structural Parameterizations of the Matching Cut Problem. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (COCOA (2), 2017)

Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture. - Nandini Singhal; Sathya Peri; Subrahmanyam Kalyanasundaram (ICDCN, 2017)

Algorithms and hardness results for happy coloring problems. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare; Juho Lauri (CoRR, 2017)

Exact Computation of the Number of Accepting Paths of an NTM. - Subrahmanyam Kalyanasundaram; Kenneth W. Regan (CALDAM, 2018)

Bipartitioning Problems on Graphs with Bounded Tree-Width. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (CoRR, 2018)

H-Free Coloring on Graphs with Bounded Tree-Width. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (CALDAM, 2019)

Coordinated Intelligent Traffic Lights using Uppaal Stratego. - Thamilselvam B; Subrahmanyam Kalyanasundaram; M. V. Panduranga Rao (COMSNETS, 2019)

Conflict-Free Coloring on Open Neighborhoods. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram (CoRR, 2019)

Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram (WG, 2020)

Conflict-free coloring on closed neighborhoods of bounded degree graphs. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew (CoRR, 2020)

Parameterized complexity of happy coloring problems. - Akanksha Agrawal 001; N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare; Juho Lauri; Neeldhara Misra; I. Vinod Reddy (Theor. Comput. Sci., 2020)

Scalable Coordinated Intelligent Traffic Light Controller for Heterogeneous Traffic Scenarios Using UPPAAL STRATEGO. - Thamilselvam B; Subrahmanyam Kalyanasundaram; M. V. Panduranga Rao (COMSNETS, 2021)

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. - Sriram Bhyravarapu; Tim A. Hartmann; Subrahmanyam Kalyanasundaram; I. Vinod Reddy (IWOCA, 2021)

Statistical Model Checking for Traffic Models. - Thamilselvam B; Subrahmanyam Kalyanasundaram; Shubham Parmar; M. V. Panduranga Rao (SBMF, 2021)

Conflict-free coloring on open neighborhoods of claw-free graphs. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew (CoRR, 2021)

On the tractability of (k, i)-coloring. - Sriram Bhyravarapu; Saurabh Joshi 001; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (Discret. Appl. Math., 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)

Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew (MFCS, 2022)

Conflict-Free Coloring Bounds on Open Neighborhoods. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew (Algorithmica, 2022)

Vertex partitioning problems on graphs with bounded tree width. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (Discret. Appl. Math., 2022)

A tight bound for conflict-free coloring in terms of distance to cluster. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram (Discret. Math., 2022)

Decentralized Multi Agent Deep Reinforcement Q-Learning for Intelligent Traffic Controller. - Thamilselvam B; Subrahmanyam Kalyanasundaram; M. V. Panduranga Rao (AIAI (1), 2023)

Traffic Intersections as Agents: A model checking approach for analysing communicating agents. - Thamilselvam B; Yenda Ramesh; Subrahmanyam Kalyanasundaram; M. V. Panduranga Rao (SAC, 2023)

Extremal Results on Conflict-free Coloring. - Shiwali Gupta; Subrahmanyam Kalyanasundaram; Rogers Mathew (CoRR, 2023)

A bound for the cops and robber problem in terms of 2-component order connectivity. - Suryaansh Jain; Subrahmanyam Kalyanasundaram; Kartheek Sriram Tammana (CoRR, 2024)

Pliable Index Coding via Conflict-Free Colorings of Hypergraphs. - Prasad Krishnan; Rogers Mathew; Subrahmanyam Kalyanasundaram (IEEE Trans. Inf. Theory, 2024)

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

The complexity of optimizing atomic congestion. - Cornelius Brand; Robert Ganian; Subrahmanyam Kalyanasundaram; Fionn Mc Inerney (Artif. Intell., 2025)

Conflict-free coloring on subclasses of perfect graphs and bipartite graphs. - Sriram Bhyravarapu; Subrahmanyam Kalyanasundaram; Rogers Mathew (Theor. Comput. Sci., 2025)