Efficient solutions for finding vitality with respect to shortest paths. - Anjeneya Swami Kare; Sanjeev Saxena (IC3, 2013)

Swap Edges of Shortest Path Tree in Parallel. - Anjeneya Swami Kare; Sanjeev Saxena (RAIT, 2014)

Linear Time Algorithms for Happy Vertex Coloring Problems for Trees. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (IWOCA, 2016)

A Simple Algorithm For Replacement Paths Problem. - Anjeneya Swami Kare (Electron. Notes Discret. Math., 2016)

On Structural Parameterizations of the Matching Cut Problem. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (COCOA (2), 2017)

Algorithms and hardness results for happy coloring problems. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare; Juho Lauri (CoRR, 2017)

Bipartitioning Problems on Graphs with Bounded Tree-Width. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (CoRR, 2018)

H-Free Coloring on Graphs with Bounded Tree-Width. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (CALDAM, 2019)

Parameterized Algorithms for Graph Burning Problem. - Anjeneya Swami Kare; I. Vinod Reddy (IWOCA, 2019)

Heuristics for the Power Edge Set Problem. - Anjeneya Swami Kare; Sreshta Valluru (ICCCNT, 2020)

Parameterized complexity of happy coloring problems. - Akanksha Agrawal 001; N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare; Juho Lauri; Neeldhara Misra; I. Vinod Reddy (Theor. Comput. Sci., 2020)

Heuristics for the Generalized Graph Coloring Problem. - Anjeneya Swami Kare; Varun Kumar (ICCCNT, 2021)

On the tractability of (k, i)-coloring. - Sriram Bhyravarapu; Saurabh Joshi 001; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (Discret. Appl. Math., 2021)

Faster heuristics for graph burning. - Rahul Kumar Gautam; Anjeneya Swami Kare; Durga Bhavani S. (Appl. Intell., 2022)

Vertex partitioning problems on graphs with bounded tree width. - N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare (Discret. Appl. Math., 2022)

Structural Parameterization of Alliance Problems. - Sangam Balchandar Reddy; Anjeneya Swami Kare (CALDAM, 2023)

Opinion Maximization in Signed Social Networks Using Centrality Measures and Clustering Techniques. - Leela Srija Alla; Anjeneya Swami Kare (ICDCIT, 2023)

Centrality Measures Based Heuristics for Perfect Awareness Problem in Social Networks. - Rahul Kumar Gautam; Anjeneya Swami Kare; S. Durga Bhavani (MIWAI, 2023)

On the Tractability of Defensive Alliance Problem. - Sangam Balchandar Reddy; Anjeneya Swami Kare (CoRR, 2023)

A Genetic Algorithm-Based Heuristic for Rumour Minimization in Social Networks. - Vivek Kumar Rajak; Anjeneya Swami Kare (ICDCIT, 2024)

Heuristics for Influence Maximization with Tiered Influence and Activation thresholds. - Rahul Kumar Gautam; Anjeneya Swami Kare; Durga Bhavani S. (CoRR, 2024)

Algorithms for Minimum Membership Dominating Set Problem. - Sangam Balchandar Reddy; Anjeneya Swami Kare (CoRR, 2024)

Approximation algorithms for the graph burning on cactus and directed trees. - Rahul Kumar Gautam; Anjeneya Swami Kare; S. Durga Bhavani (Discret. Math. Algorithms Appl., 2024)

Structural Parameterization of Minus Domination. - Sangam Balchandar Reddy; Anjeneya Swami Kare (CALDAM, 2025)

Interest maximization in social networks. - Rahul Kumar Gautam; Anjeneya Swami Kare; S. Durga Bhavani (J. Supercomput., 2025)