| Linear time algorithms for happy vertex coloring problems for trees NR Aravind, S Kalyanasundaram, AS Kare International Workshop on Combinatorial Algorithms, 281-292, 2016 | 27 | 2016 |
| Doppler radar–A detecting tool and measuring instrument in meteorology AK Bhatnagar, PR Rao, S Kalyanasundaram, SB Thampi, R Suresh, ... Current Science 85 (3), 256-264, 2003 | 25 | 2003 |
| Algorithms and hardness results for happy coloring problems NR Aravind, S Kalyanasundaram, AS Kare, J Lauri arXiv preprint arXiv:1705.08282, 2017 | 20 | 2017 |
| On structural parameterizations of the matching cut problem NR Aravind, S Kalyanasundaram, AS Kare Combinatorial Optimization and Applications: 11th International Conference …, 2017 | 18 | 2017 |
| A note on even cycles and quasirandom tournaments S Kalyanasundaram, A Shapira Journal of Graph Theory 73 (3), 260-266, 2013 | 15 | 2013 |
| High-rate, full-diversity STBCs from field extensions V Shashidhar, K Subrahmanyam, R Chandrasekharan, BS Rajan, ... IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 126-126, 2003 | 13 | 2003 |
| Pliable index coding via conflict-free colorings of hypergraphs P Krishnan, R Mathew, S Kalyanasundaram IEEE Transactions on Information Theory, 2024 | 12 | 2024 |
| A Wowzer‐type lower bound for the strong regularity lemma S Kalyanasundaram, A Shapira Proceedings of the London Mathematical Society 106 (3), 621-649, 2013 | 12 | 2013 |
| A deterministic algorithm for the Frieze–Kannan regularity lemma D Dellamonica, S Kalyanasundaram, D Martin, V Rödl, A Shapira SIAM Journal on Discrete Mathematics 26 (1), 15-29, 2012 | 12 | 2012 |
| Algorithms for message ferrying on mobile ad hoc networks M Ammar, D Chakrabarty, AD Sarma, S Kalyanasundaram, RJ Lipton IARCS Annual Conference on Foundations of Software Technology and …, 2009 | 12 | 2009 |
| A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs S Bhyravarapu, S Kalyanasundaram, R Mathew Journal of Graph Theory 97 (4), 553-556, 2021 | 11 | 2021 |
| An optimal algorithm for finding Frieze–Kannan regular partitions D Dellamonica, S Kalyanasundaram, DM Martin, V RÖDL, A Shapira Combinatorics, Probability and Computing 24 (2), 407-437, 2015 | 11 | 2015 |
| On optimum rain rate estimation from a pulsed Doppler Weather Radar at Chennai R Suresh, PK Ravichandran, JP Gupta, SB Thampi, S Kalyanasundaram, ... Mausam 56 (2), 433-446, 2005 | 11 | 2005 |
| Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs S Bhyravarapu, TA Hartmann, HP Hoang, S Kalyanasundaram, ... Algorithmica, 1-39, 2024 | 10 | 2024 |
| Practical multi-threaded graph coloring algorithms for shared memory architecture N Singhal, S Peri, S Kalyanasundaram Proceedings of the 18th International Conference on Distributed Computing …, 2017 | 10 | 2017 |
| Conflict-free coloring bounds on open neighborhoods S Bhyravarapu, S Kalyanasundaram, R Mathew Algorithmica 84 (8), 2154-2185, 2022 | 9 | 2022 |
| Parameterized complexity of happy coloring problems A Agrawal, NR Aravind, S Kalyanasundaram, AS Kare, J Lauri, N Misra, ... Theoretical Computer Science 835, 58-81, 2020 | 8 | 2020 |
| Combinatorial bounds for conflict-free coloring on open neighborhoods S Bhyravarapu, S Kalyanasundaram Graph-Theoretic Concepts in Computer Science: 46th International Workshop …, 2020 | 8 | 2020 |
| Coordinated intelligent traffic lights using Uppaal Stratego B Thamilselvam, S Kalyanasundaram, MVP Rao 2019 11th International Conference on Communication Systems & Networks …, 2019 | 8 | 2019 |
| Vertex partitioning problems on graphs with bounded tree width NR Aravind, S Kalyanasundaram, AS Kare Discrete Applied Mathematics 319, 254-270, 2022 | 6 | 2022 |
