| Parameterized algorithms for graph burning problem AS Kare, I Vinod Reddy International Workshop on Combinatorial Algorithms, 304-314, 2019 | 25 | 2019 |
| Linear time algorithms for happy vertex coloring problems for trees NR Aravind, S Kalyanasundaram, AS Kare International Workshop on Combinatorial Algorithms, 281-292, 2016 | 25 | 2016 |
| 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 | 16 | 2017 |
| Faster heuristics for graph burning RK Gautam, AS Kare, DB S Applied Intelligence 52 (2), 1351-1361, 2022 | 14 | 2022 |
| Vertex partitioning problems on graphs with bounded tree width NR Aravind, S Kalyanasundaram, AS Kare Discrete Applied Mathematics 319, 254-270, 2022 | 5 | 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 | 5 | 2020 |
| Opinion maximization in signed social networks using centrality measures and clustering techniques LS Alla, AS Kare International Conference on Distributed Computing and Intelligent Technology …, 2023 | 4 | 2023 |
| Centrality measures based heuristics for perfect awareness problem in social networks RK Gautam, AS Kare, S Durga Bhavani International Conference on Multi-disciplinary Trends in Artificial …, 2023 | 3 | 2023 |
| Heuristics for the power edge set problem AS Kare, S Valluru 2020 11th international conference on computing, communication and …, 2020 | 3 | 2020 |
| On the Tractability of (k, i)-Coloring S Joshi, S Kalyanasundaram, AS Kare, S Bhyravarapu Conference on Algorithms and Discrete Applied Mathematics, 188-198, 2018 | 3 | 2018 |
| On the tractability of (k, i)-coloring S Bhyravarapu, S Joshi, S Kalyanasundaram, AS Kare Discrete Applied Mathematics 305, 329-339, 2021 | 2 | 2021 |
| A simple algorithm for replacement paths problem AS Kare Electronic Notes in Discrete Mathematics 53, 307-318, 2016 | 2 | 2016 |
| Efficient solutions for finding vitality with respect to shortest paths AS Kare, S Saxena 2013 Sixth International Conference on Contemporary Computing (IC3), 70-75, 2013 | 2 | 2013 |
| H-Free Coloring on Graphs with Bounded Tree-Width NR Aravind, S Kalyanasundaram, AS Kare Conference on Algorithms and Discrete Applied Mathematics, 231-244, 2019 | 1 | 2019 |
| Bipartitioning problems on graphs with bounded tree-width NR Aravind, S Kalyanasundaram, AS Kare arXiv preprint arXiv:1804.04016, 2018 | 1 | 2018 |
| Interest Maximization in Social Networks RK Gautam, AS Kare, SD Bhavani arXiv preprint arXiv:2404.08236, 2024 | | 2024 |
| A Genetic Algorithm-Based Heuristic for Rumour Minimization in Social Networks VK Rajak, AS Kare International Conference on Distributed Computing and Intelligent Technology …, 2024 | | 2024 |
| On the Tractability of Defensive Alliance Problem SB Reddy, AS Kare arXiv preprint arXiv:2307.09760, 2023 | | 2023 |
| Approximation algorithms for the graph burning on cactus and directed trees RK Gautam, AS Kare, SD Bhavani arXiv preprint arXiv:2307.08505, 2023 | | 2023 |
Subrahmanyam KalyanasundaramIIT HyderabadVerified email at iith.ac.in
