default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSubrahmanyam Kalyanasundaram
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j14]Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney:
The complexity of optimizing atomic congestion. Artif. Intell. 338: 104241 (2025)- 2024
- [j13]Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy:
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs. Algorithmica 86(7): 2250-2288 (2024) - [j12]Prasad Krishnan
, Rogers Mathew, Subrahmanyam Kalyanasundaram:
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs. IEEE Trans. Inf. Theory 70(6): 3903-3921 (2024) - 2022
- [j11]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew:
Conflict-Free Coloring Bounds on Open Neighborhoods. Algorithmica 84(8): 2154-2185 (2022) - [j10]N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare:
Vertex partitioning problems on graphs with bounded tree width. Discret. Appl. Math. 319: 254-270 (2022) - [j9]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram:
A tight bound for conflict-free coloring in terms of distance to cluster. Discret. Math. 345(11): 113058 (2022) - 2021
- [j8]Sriram Bhyravarapu, Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare:
On the tractability of (k, i)-coloring. Discret. Appl. Math. 305: 329-339 (2021) - [j7]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew:
A short note on conflict-free coloring on closed neighborhoods of bounded degree graphs. J. Graph Theory 97(4): 553-556 (2021) - 2020
- [j6]Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy:
Parameterized complexity of happy coloring problems. Theor. Comput. Sci. 835: 58-81 (2020) - 2015
- [j5]Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira:
An Optimal Algorithm for Finding Frieze-Kannan Regular Partitions. Comb. Probab. Comput. 24(2): 407-437 (2015) - [j4]N. R. Aravind, Subrahmanyam Kalyanasundaram, R. B. Sandeep, Naveen Sivadasan:
The chromatic discrepancy of graphs. Discret. Appl. Math. 184: 40-49 (2015) - 2013
- [j3]Subrahmanyam Kalyanasundaram, Asaf Shapira:
A Note on Even Cycles and Quasirandom Tournaments. J. Graph Theory 73(3): 260-266 (2013) - 2012
- [j2]Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira:
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma. SIAM J. Discret. Math. 26(1): 15-29 (2012) - [j1]Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh:
Improved simulation of nondeterministic Turing machines. Theor. Comput. Sci. 417: 66-73 (2012)
Conference and Workshop Papers
- 2024
- [c19]Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney:
The Complexity of Optimizing Atomic Congestion. AAAI 2024: 20044-20052 - 2023
- [c18]Thamilselvam B, Subrahmanyam Kalyanasundaram, M. V. Panduranga Rao:
Decentralized Multi Agent Deep Reinforcement Q-Learning for Intelligent Traffic Controller. AIAI (1) 2023: 45-56 - [c17]Thamilselvam B, Yenda Ramesh, Subrahmanyam Kalyanasundaram, M. V. Panduranga Rao:
Traffic Intersections as Agents: A model checking approach for analysing communicating agents. SAC 2023: 109-118 - 2022
- [c16]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew:
Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs. MFCS 2022: 19:1-19:14 - 2021
- [c15]Thamilselvam B, Subrahmanyam Kalyanasundaram, M. V. Panduranga Rao:
Scalable Coordinated Intelligent Traffic Light Controller for Heterogeneous Traffic Scenarios Using UPPAAL STRATEGO. COMSNETS 2021: 404-412 - [c14]Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram:
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs. ISIT 2021: 214-219 - [c13]Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy:
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. IWOCA 2021: 92-106 - [c12]Thamilselvam B, Subrahmanyam Kalyanasundaram, Shubham Parmar, M. V. Panduranga Rao:
Statistical Model Checking for Traffic Models. SBMF 2021: 17-33 - 2020
- [c11]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram:
Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods. WG 2020: 1-13 - 2019
- [c10]N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare:
H-Free Coloring on Graphs with Bounded Tree-Width. CALDAM 2019: 231-244 - [c9]Thamilselvam B, Subrahmanyam Kalyanasundaram, M. V. Panduranga Rao:
Coordinated Intelligent Traffic Lights using Uppaal Stratego. COMSNETS 2019: 789-794 - 2018
- [c8]Subrahmanyam Kalyanasundaram, Kenneth W. Regan:
Exact Computation of the Number of Accepting Paths of an NTM. CALDAM 2018: 105-117 - [c7]Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram Bhyravarapu:
On the Tractability of (k, i)-Coloring. CALDAM 2018: 188-198 - 2017
- [c6]N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare:
On Structural Parameterizations of the Matching Cut Problem. COCOA (2) 2017: 475-482 - [c5]Nandini Singhal, Sathya Peri, Subrahmanyam Kalyanasundaram:
Practical Multi-threaded Graph Coloring Algorithms for Shared Memory Architecture. ICDCN 2017: 44 - 2016
- [c4]N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare:
Linear Time Algorithms for Happy Vertex Coloring Problems for Trees. IWOCA 2016: 281-292 - 2011
- [c3]Domingos Dellamonica Jr., Subrahmanyam Kalyanasundaram, Daniel M. Martin, Vojtech Rödl, Asaf Shapira:
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma. APPROX-RANDOM 2011: 495-506 - 2010
- [c2]Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh:
Improved Simulation of Nondeterministic Turing Machines. MFCS 2010: 453-464 - 2009
- [c1]Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, Richard J. Lipton:
Algorithms for Message Ferrying on Mobile ad hoc Networks. FSTTCS 2009: 13-24
Editorship
- 2024
- [e1]Subrahmanyam Kalyanasundaram, Anil Maheshwari:
Algorithms and Discrete Applied Mathematics - 10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024, Proceedings. Lecture Notes in Computer Science 14508, Springer 2024, ISBN 978-3-031-52212-3 [contents]
Informal and Other Publications
- 2023
- [i11]Shiwali Gupta, Subrahmanyam Kalyanasundaram, Rogers Mathew:
Extremal Results on Conflict-free Coloring. CoRR abs/2305.02570 (2023) - [i10]Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney:
The Complexity of Optimizing Atomic Congestion. CoRR abs/2312.10219 (2023) - 2021
- [i9]Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram:
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs. CoRR abs/2102.02182 (2021) - [i8]Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy:
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. CoRR abs/2105.08693 (2021) - [i7]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew:
Conflict-free coloring on open neighborhoods of claw-free graphs. CoRR abs/2112.12173 (2021) - 2020
- [i6]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew:
Conflict-free coloring on closed neighborhoods of bounded degree graphs. CoRR abs/2003.05637 (2020) - 2019
- [i5]Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram:
Conflict-Free Coloring on Open Neighborhoods. CoRR abs/1910.00863 (2019) - 2018
- [i4]Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram Bhyravarapu:
On the Tractability of (k, i)-Coloring. CoRR abs/1802.03634 (2018) - [i3]N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare:
Bipartitioning Problems on Graphs with Bounded Tree-Width. CoRR abs/1804.04016 (2018) - 2017
- [i2]N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri:
Algorithms and hardness results for happy coloring problems. CoRR abs/1705.08282 (2017) - 2015
- [i1]Nandini Singhal, Sathya Peri, Subrahmanyam Kalyanasundaram:
Multi-threaded Graph Coloring Algorithm in Shared Memory Architecture. CoRR abs/1509.08267 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
