Get started
Author

Subrahmanyam Kalyanasundaram

Observed names: Kalyanasundaram, Subrahmanyam, S, Kalyanasundaram, SUBRAHMANYAM KALYANASUNDARAM
ORCID: 0000-0001-9094-3368
Observed ORCID: 0000-0001-9094-3368
OpenAlex ID: A5067577293
Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
2016 · N. R. Aravind, Subrahmanyam Kalyanasundaram, et al. · Lecture notes in computer science · 23
Algorithms and hardness results for happy coloring problems
2017 · Aravind, N. R., Kalyanasundaram, Subrahmanyam, et al. · arXiv (Cornell University) · 14
PDF
On Structural Parameterizations of the Matching Cut Problem
2017 · N. R. Aravind, Subrahmanyam Kalyanasundaram, et al. · Lecture notes in computer science · 14
A Note on Even Cycles and Quasirandom Tournaments
2012 · Subrahmanyam Kalyanasundaram, Asaf Shapira · Journal of Graph Theory · 12
VexIR2Vec : An Architecture-Neutral Embedding Framework for Binary Similarity
2025 · S. VenkataKeerthy, Soumya Banerjee, et al. · ACM Transactions on Software Engineering and Methodology · 11
A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs
2021 · Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, et al. · Journal of Graph Theory · 11
PDF
An Optimal Algorithm for Finding Frieze–Kannan Regular Partitions
2014 · DOMINGOS DELLAMONICA, SUBRAHMANYAM KALYANASUNDARAM, et al. · Combinatorics Probability Computing · 11
A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma
2012 · Domingos Dellamonica, Subrahmanyam Kalyanasundaram, et al. · SIAM Journal on Discrete Mathematics · 11
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs
2021 · Prasad Krishnan, Rogers Mathew, et al. · IEEE International Symposium on Information Theory (ISIT) · 10
2 A Wowzer-Type Lower Bound for the Strong Regularity Lemma
2012 · Subrahmanyam Kalyanasundaram, Asaf Shapira · 10
Coordinated Intelligent Traffic Lights using Uppaal Stratego
2019 · B. Thamilselvam, Subrahmanyam Kalyanasundaram, et al. · International Conference on Communication Systems & Networks (COMSNETS) · 9
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs
2024 · Prasad Krishnan, Rogers Mathew, et al. · IEEE Transactions on Information Theory · 8
Conflict-Free Coloring Bounds on Open Neighborhoods
2022 · Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, et al. · Algorithmica · 8
Parameterized complexity of happy coloring problems
2020 · Akanksha Agrawal, N.R. Aravind, et al. · Theoretical Computer Science · 8
Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods
2020 · Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram · Lecture notes in computer science · 7
PDF
Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture
2017 · Nandini Singhal, Sathya Peri, et al. · International Conference on Distributed Computing and Networking (ICDCN) · 7
PDF
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
2021 · Sriram Bhyravarapu, Tim A. Hartmann, et al. · Lecture notes in computer science · 6
Algorithms for Message Ferrying on Mobile ad hoc Networks
2009 · Ammar, Mostafa, Chakrabarty, Deeparnab, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 6
PDF
Vertex partitioning problems on graphs with bounded tree width
2021 · N.R. Aravind, Subrahmanyam Kalyanasundaram, et al. · Discrete Applied Mathematics · 4
Scalable Coordinated Intelligent Traffic Light Controller for Heterogeneous Traffic Scenarios Using UPPAAL STRATEGO
2021 · B Thamilselvam, Subrahmanyam Kalyanasundaram, et al. · International Conference on Communication Systems & Networks (COMSNETS) · 4
Acquisition, storage, retrieval and dissemination of disaster related data
2014 · Shaik A. Ahammed, Karthik Badam, et al. · IEEE Region Humanitarian Technology Conference · 4
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs
2024 · Sriram Bhyravarapu, Tim A. Hartmann, et al. · Algorithmica · 3
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma
2011 · Domingos Dellamonica, Subrahmanyam Kalyanasundaram, et al. · Lecture notes in computer science · 3
Conflict-free coloring on subclasses of perfect graphs and bipartite graphs
2025 · Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, et al. · Theoretical Computer Science · 2
The Complexity of Optimizing Atomic Congestion
2024 · Cornelius Brand, Robert Ganian, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 2
PDF
Works count: 62
Citation count: 221
H-index: 10
I10-index: 10
Year
Topic
Type