Subrahmanyam Kalyanasundaram

50 papers A* 1B 4C 2Misc 4Journal 29Unranked 8
YearRankTypeTitle / Venue / Authors
2025 J jnl
Conflict-free coloring on subclasses of perfect graphs and bipartite graphs.
Theor. Comput. Sci.
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew
2025 J jnl
Extremal Results on Conflict-Free Coloring.
J. Graph Theory
Sriram Bhyravarapu, Shiwali Gupta, Subrahmanyam Kalyanasundaram, Rogers Mathew
2025 J jnl
The complexity of optimizing atomic congestion.
Artif. Intell.
Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney
2025 J jnl
VexIR2Vec: An Architecture-Neutral Embedding Framework for Binary Similarity.
ACM Trans. Softw. Eng. Methodol.
S. VenkataKeerthy, Soumya Banerjee, Sayan Dey, Yashas Andaluri, Raghul P. S., Subrahmanyam Kalyanasundaram, Fernando Magno Quintão Pereira, Ramakrishna Upadrasta
2024 J jnl
A bound for the cops and robber problem in terms of 2-component order connectivity.
CoRR
Suryaansh Jain, Subrahmanyam Kalyanasundaram, Kartheek Sriram Tammana
2024 — ed.
Algorithms and Discrete Applied Mathematics - 10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024, Proceedings
CALDAM
Subrahmanyam Kalyanasundaram, Anil Maheshwari
2024 J jnl
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs.
Algorithmica
Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy
2024 J jnl
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs.
IEEE Trans. Inf. Theory
Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram
2024 A* conf
The Complexity of Optimizing Atomic Congestion.
AAAI
Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney
2023 — conf
Decentralized Multi Agent Deep Reinforcement Q-Learning for Intelligent Traffic Controller.
AIAI (1)
Thamilselvam B, Subrahmanyam Kalyanasundaram, M. V. Panduranga Rao
2023 J jnl
Extremal Results on Conflict-free Coloring.
CoRR
Shiwali Gupta, Subrahmanyam Kalyanasundaram, Rogers Mathew
2023 J jnl
The Complexity of Optimizing Atomic Congestion.
CoRR
Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney
2023 Misc conf
Traffic Intersections as Agents: A model checking approach for analysing communicating agents.
SAC
Thamilselvam B, Yenda Ramesh, Subrahmanyam Kalyanasundaram, M. V. Panduranga Rao
2022 J jnl
A tight bound for conflict-free coloring in terms of distance to cluster.
Discret. Math.
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram
2022 J jnl
Conflict-Free Coloring Bounds on Open Neighborhoods.
Algorithmica
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew
2022 B conf
Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs.
MFCS
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew
2022 J jnl
Vertex partitioning problems on graphs with bounded tree width.
Discret. Appl. Math.
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
2021 J jnl
A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs.
J. Graph Theory
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew
2021 C conf
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs.
IWOCA
Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy
2021 J jnl
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs.
CoRR
Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy
2021 J jnl
Conflict-free coloring on open neighborhoods of claw-free graphs.
CoRR
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew
2021 J jnl
On the tractability of (k, i)-coloring.
Discret. Appl. Math.
Sriram Bhyravarapu, Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
2021 B conf
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs.
ISIT
Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram
2021 J jnl
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs.
CoRR
Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram
2021 Misc conf
Scalable Coordinated Intelligent Traffic Light Controller for Heterogeneous Traffic Scenarios Using UPPAAL STRATEGO.
COMSNETS
Thamilselvam B, Subrahmanyam Kalyanasundaram, M. V. Panduranga Rao
2021 — conf
Statistical Model Checking for Traffic Models.
SBMF
Thamilselvam B, Subrahmanyam Kalyanasundaram, Shubham Parmar, M. V. Panduranga Rao
2020 B conf
Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods.
WG
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram
2020 J jnl
Conflict-free coloring on closed neighborhoods of bounded degree graphs.
CoRR
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew
2020 J jnl
Parameterized complexity of happy coloring problems.
Theor. Comput. Sci.
Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy
2019 J jnl
Conflict-Free Coloring on Open Neighborhoods.
CoRR
Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram
2019 Misc conf
Coordinated Intelligent Traffic Lights using Uppaal Stratego.
COMSNETS
Thamilselvam B, Subrahmanyam Kalyanasundaram, M. V. Panduranga Rao
2019 — conf
H-Free Coloring on Graphs with Bounded Tree-Width.
CALDAM
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
2018 J jnl
Bipartitioning Problems on Graphs with Bounded Tree-Width.
CoRR
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
2018 — conf
Exact Computation of the Number of Accepting Paths of an NTM.
CALDAM
Subrahmanyam Kalyanasundaram, Kenneth W. Regan
2018 — conf
On the Tractability of (k, i)-Coloring.
CALDAM
Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram Bhyravarapu
2018 J jnl
On the Tractability of (k, i)-Coloring.
CoRR
Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram Bhyravarapu
2017 J jnl
Algorithms and hardness results for happy coloring problems.
CoRR
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri
2017 — conf
On Structural Parameterizations of the Matching Cut Problem.
COCOA (2)
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
2017 Misc conf
Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture.
ICDCN
Nandini Singhal, Sathya Peri, Subrahmanyam Kalyanasundaram
2016 C conf
Linear Time Algorithms for Happy Vertex Coloring Problems for Trees.
IWOCA
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
2015 J jnl
An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions.
Comb. Probab. Comput.
Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira
2015 J jnl
Multi-threaded Graph Coloring Algorithm in Shared Memory Architecture.
CoRR
Nandini Singhal, Sathya Peri, Subrahmanyam Kalyanasundaram
2015 J jnl
The chromatic discrepancy of graphs.
Discret. Appl. Math.
N. R. Aravind, Subrahmanyam Kalyanasundaram, R. B. Sandeep, Naveen Sivadasan
2013 J jnl
A Note on Even Cycles and Quasirandom Tournaments.
J. Graph Theory
Subrahmanyam Kalyanasundaram, Asaf Shapira
2012 J jnl
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma.
SIAM J. Discret. Math.
Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira
2012 J jnl
Improved simulation of nondeterministic Turing machines.
Theor. Comput. Sci.
Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh
2011 — conf
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma.
APPROX-RANDOM
Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira
2011 — —
Turing machine algorithms and studies in quasi-randomness.
Subrahmanyam Kalyanasundaram
2010 B conf
Improved Simulation of Nondeterministic Turing Machines.
MFCS
Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh
2009 — conf
Algorithms for Message Ferrying on Mobile ad hoc Networks.
FSTTCS
Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, Richard J. Lipton