Anjeneya Swami Kare

35 papers C 2Misc 2Journal 21Unranked 10
YearRankTypeTitle / Venue / Authors
2026 J jnl
On the complexity of global Roman domination problem in graphs.
CoRR
Sangam Balchandar Reddy, Arun Kumar Das, Anjeneya Swami Kare, I. Vinod Reddy
2026 J jnl
On the tractability of defensive alliance problem.
Discret. Appl. Math.
Sangam Balchandar Reddy, Anjeneya Swami Kare
2026 J jnl
Structural parameterization of minus domination.
Discret. Appl. Math.
Sangam Balchandar Reddy, Anjeneya Swami Kare
2025 J jnl
Algorithms for Minimum Membership Dominating Set problem.
RAIRO Oper. Res.
Sangam Balchandar Reddy, Anjeneya Swami Kare
2025 J jnl
Interest maximization in social networks.
J. Supercomput.
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
2025 — conf
Structural Parameterization of Minus Domination.
CALDAM
Sangam Balchandar Reddy, Anjeneya Swami Kare
2024 Misc conf
A Genetic Algorithm-Based Heuristic for Rumour Minimization in Social Networks.
ICDCIT
Vivek Kumar Rajak, Anjeneya Swami Kare
2024 J jnl
Algorithms for Minimum Membership Dominating Set Problem.
CoRR
Sangam Balchandar Reddy, Anjeneya Swami Kare
2024 J jnl
Approximation algorithms for the graph burning on cactus and directed trees.
Discret. Math. Algorithms Appl.
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
2024 J jnl
Heuristics for Influence Maximization with Tiered Influence and Activation thresholds.
CoRR
Rahul Kumar Gautam, Anjeneya Swami Kare, Durga Bhavani S.
2024 J jnl
Interest Maximization in Social Networks.
CoRR
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
2023 J jnl
Approximation Algorithms for the Graph Burning on Cactus and Directed Trees.
CoRR
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
2023 — conf
Centrality Measures Based Heuristics for Perfect Awareness Problem in Social Networks.
MIWAI
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
2023 J jnl
On the Tractability of Defensive Alliance Problem.
CoRR
Sangam Balchandar Reddy, Anjeneya Swami Kare
2023 Misc conf
Opinion Maximization in Signed Social Networks Using Centrality Measures and Clustering Techniques.
ICDCIT
Leela Srija Alla, Anjeneya Swami Kare
2023 — conf
Structural Parameterization of Alliance Problems.
CALDAM
Sangam Balchandar Reddy, Anjeneya Swami Kare
2022 J jnl
Faster heuristics for graph burning.
Appl. Intell.
Rahul Kumar Gautam, Anjeneya Swami Kare, Durga Bhavani S.
2022 J jnl
Vertex partitioning problems on graphs with bounded tree width.
Discret. Appl. Math.
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
2021 — conf
Heuristics for the Generalized Graph Coloring Problem.
ICCCNT
Anjeneya Swami Kare, Varun Kumar
2021 J jnl
On the tractability of (k, i)-coloring.
Discret. Appl. Math.
Sriram Bhyravarapu, Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
2020 J jnl
Faster Heuristics for Graph Burning.
CoRR
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
2020 — conf
Heuristics for the Power Edge Set Problem.
ICCCNT
Anjeneya Swami Kare, Sreshta Valluru
2020 J jnl
Parameterized complexity of happy coloring problems.
Theor. Comput. Sci.
Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy
2019 — conf
H-Free Coloring on Graphs with Bounded Tree-Width.
CALDAM
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
2019 C conf
Parameterized Algorithms for Graph Burning Problem.
IWOCA
Anjeneya Swami Kare, I. Vinod Reddy
2018 J jnl
Bipartitioning Problems on Graphs with Bounded Tree-Width.
CoRR
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
2018 — conf
On the Tractability of (k, i)-Coloring.
CALDAM
Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram Bhyravarapu
2018 J jnl
On the Tractability of (k, i)-Coloring.
CoRR
Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram Bhyravarapu
2017 J jnl
Algorithms and hardness results for happy coloring problems.
CoRR
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri
2017 — conf
On Structural Parameterizations of the Matching Cut Problem.
COCOA (2)
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
2016 J jnl
A Simple Algorithm For Replacement Paths Problem.
Electron. Notes Discret. Math.
Anjeneya Swami Kare
2016 C conf
Linear Time Algorithms for Happy Vertex Coloring Problems for Trees.
IWOCA
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
2015 J jnl
A Simple Algorithm For Replacement Paths Problem.
CoRR
Anjeneya Swami Kare
2014 — conf
Swap Edges of Shortest Path Tree in Parallel.
RAIT
Anjeneya Swami Kare, Sanjeev Saxena
2013 — conf
Efficient solutions for finding vitality with respect to shortest paths.
IC3
Anjeneya Swami Kare, Sanjeev Saxena