Recent Publications
Sangam Balchandar Reddy, Anjeneya Swami Kare: Structural Parameterization of Alliance Problems, CALDAM-2023, Springer, LNCS.
Leela Srija Alla, Anjeneya Swami Kare: Opinion Maximization in Signed Social Networks Using Centrality Measures and Clustering Techniques, ICDCIT-2023, Springer, LNCS. (Selected for Best Student Paper Award)
Rahul Kumar Gautam, Anjeneya Swami Kare, S Durga Bhavani: Faster Heuristics for Graph Burning, Journal of Applied Intelligence, 2021.
Sriram Bhyravarapu, Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare: On the Tractability of (k, i)-Coloring, Journal of Discrete Applied Mathematics, 2020.
Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy: Parameterized complexity of happy coloring problems, Journal of Theoritical Computer Science, 2020, 835, 58-81.
Anjeneya Swami Kare, I Vinod Reddy: Parameterized Algorithms for Graph Burning Problem, IWOCA-2019, 304-314, Springer, LNCS.
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare: H-Free Coloring on Graphs with Bounded Tree-Width. CALDAM-2019, 231-244, Springer, LNCS.
Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram
Bhyravarapu: On the Tractability of (k, i)-Coloring, CALDAM 2018, 188-198, Springer, LNCS
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare: On
Structural Parameterizations of the Matching Cut Problem. COCOA (2) 2017, 475-482,
Springer, LNCS
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare: Linear Time
Algorithms for Happy Vertex Coloring Problems for Trees. IWOCA 2016, 281-292, Springer,
LNCS