Anjeneya Swami Kare

According to our database, Anjeneya Swami Kare authored at least 24 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Interest maximization in social networks.

Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani

J. Supercomput., January, 2025

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., October, 2024

Algorithms for Minimum Membership Dominating Set Problem.

Sangam Balchandar Reddy, Anjeneya Swami Kare

CoRR, 2024

Heuristics for Influence Maximization with Tiered Influence and Activation thresholds.

Rahul Kumar Gautam, Anjeneya Swami Kare, Durga Bhavani S.

CoRR, 2024

A Genetic Algorithm-Based Heuristic for Rumour Minimization in Social Networks.

Vivek Kumar Rajak, Anjeneya Swami Kare

Proceedings of the Distributed Computing and Intelligent Technology, 2024

2023

On the Tractability of Defensive Alliance Problem.

Sangam Balchandar Reddy, Anjeneya Swami Kare

CoRR, 2023

Centrality Measures Based Heuristics for Perfect Awareness Problem in Social Networks.

Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani

Proceedings of the Multi-disciplinary Trends in Artificial Intelligence, 2023

Opinion Maximization in Signed Social Networks Using Centrality Measures and Clustering Techniques.

Leela Srija Alla, Anjeneya Swami Kare

Proceedings of the Distributed Computing and Intelligent Technology, 2023

Structural Parameterization of Alliance Problems.

Sangam Balchandar Reddy, Anjeneya Swami Kare

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022

Vertex partitioning problems on graphs with bounded tree width.

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare

Discret. Appl. Math., 2022

Faster heuristics for graph burning.

Rahul Kumar Gautam, Anjeneya Swami Kare, Durga Bhavani S.

Appl. Intell., 2022

2021

On the tractability of (k, i)-coloring.

Sriram Bhyravarapu, Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare

Discret. Appl. Math., 2021

Heuristics for the Generalized Graph Coloring Problem.

Anjeneya Swami Kare, Varun Kumar

Proceedings of the 12th International Conference on Computing Communication and Networking Technologies, 2021

2020

Parameterized complexity of happy coloring problems.

Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy

Theor. Comput. Sci., 2020

Heuristics for the Power Edge Set Problem.

Anjeneya Swami Kare, Sreshta Valluru

Proceedings of the 11th International Conference on Computing, 2020

2019

Parameterized Algorithms for Graph Burning Problem.

Anjeneya Swami Kare, I. Vinod Reddy

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

H-Free Coloring on Graphs with Bounded Tree-Width.

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Bipartitioning Problems on Graphs with Bounded Tree-Width.

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare

CoRR, 2018

2017

Algorithms and hardness results for happy coloring problems.

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri

CoRR, 2017

On Structural Parameterizations of the Matching Cut Problem.

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

A Simple Algorithm For Replacement Paths Problem.

Anjeneya Swami Kare

Electron. Notes Discret. Math., 2016

Linear Time Algorithms for Happy Vertex Coloring Problems for Trees.

N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2014

Swap Edges of Shortest Path Tree in Parallel.

Anjeneya Swami Kare, Sanjeev Saxena

Proceedings of the Recent Advances in Information Technology, 2014

2013

Efficient solutions for finding vitality with respect to shortest paths.

Anjeneya Swami Kare, Sanjeev Saxena

Proceedings of the Sixth International Conference on Contemporary Computing, 2013