Subrahmanyam Kalyanasundaram, Ph.D.
Affiliations: | 2011 | Georgia Institute of Technology, Atlanta, GA |
Area:
Computer ScienceGoogle:
"Subrahmanyam Kalyanasundaram"Parents
Sign in to add mentor| Asaf Shapira | grad student | 2011 | Georgia Tech | |
| (Turing machine algorithms and studies in quasi-randomness.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Agrawal A, Aravind NR, Kalyanasundaram S, et al. (2020) Parameterized complexity of happy coloring problems Theoretical Computer Science. 835: 58-81 |
| Bhyravarapu S, Joshi S, Kalyanasundaram S, et al. (2020) On the tractability of (k,i)-coloring Discrete Applied Mathematics |
| Aravind NR, Kalyanasundaram S, Kare AS. (2016) Linear time algorithms for happy vertex coloring problems for trees Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9843: 281-292 |
| Dellamonica D, Kalyanasundaram S, Martin DM, et al. (2015) An optimal algorithm for finding frieze-kannan regular partitions Combinatorics Probability and Computing. 24: 407-437 |
| Aravind NR, Kalyanasundaram S, Sandeep RB, et al. (2015) The chromatic discrepancy of graphs Discrete Applied Mathematics. 184: 40-49 |
| Kalyanasundaram S, Shapira A. (2013) A Wowzer-type lower bound for the strong regularity lemma Proceedings of the London Mathematical Society. 106: 621-649 |
| Kalyanasundaram S, Shapira A. (2013) A note on even cycles and quasirandom tournaments Journal of Graph Theory. 73: 260-266 |
| Dellamonica D, Kalyanasundaram S, Martin D, et al. (2012) A deterministic algorithm for the frieze-kannan regularity lemma Siam Journal On Discrete Mathematics. 26: 15-29 |
| Kalyanasundaram S, Lipton RJ, Regan KW, et al. (2012) Improved simulation of nondeterministic Turing machines Theoretical Computer Science. 417: 66-73 |