Anjeneya Swami Kare

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 25

Top Topics

Tractable Classes

Social Networks

Bounded Tree Width

Parameterized Complexity

Top Venues

Discret. Appl. Math.

Publications

Rahul Kumar Gautam, Anjeneya Swami Kare, Durga Bhavani S.
Heuristics for Influence Maximization with Tiered Influence and Activation thresholds. CoRR (2024)
Vivek Kumar Rajak, Anjeneya Swami Kare
A Genetic Algorithm-Based Heuristic for Rumour Minimization in Social Networks. ICDCIT (2024)
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
Interest Maximization in Social Networks. CoRR (2024)
Sangam Balchandar Reddy, Anjeneya Swami Kare
Structural Parameterization of Alliance Problems. CALDAM (2023)
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
Approximation Algorithms for the Graph Burning on Cactus and Directed Trees. CoRR (2023)
Leela Srija Alla, Anjeneya Swami Kare
Opinion Maximization in Signed Social Networks Using Centrality Measures and Clustering Techniques. ICDCIT (2023)
Sangam Balchandar Reddy, Anjeneya Swami Kare
On the Tractability of Defensive Alliance Problem. CoRR (2023)
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
Centrality Measures Based Heuristics for Perfect Awareness Problem in Social Networks. MIWAI (2023)
Rahul Kumar Gautam, Anjeneya Swami Kare, Durga Bhavani S.
Faster heuristics for graph burning. Appl. Intell. 52 (2) (2022)
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
Vertex partitioning problems on graphs with bounded tree width. Discret. Appl. Math. 319 (2022)
Anjeneya Swami Kare, Varun Kumar
Heuristics for the Generalized Graph Coloring Problem. ICCCNT (2021)
Sriram Bhyravarapu, Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
On the tractability of (k, i)-coloring. Discret. Appl. Math. 305 (2021)
Anjeneya Swami Kare, Sreshta Valluru
Heuristics for the Power Edge Set Problem. ICCCNT (2020)
Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy
Parameterized complexity of happy coloring problems. Theor. Comput. Sci. 835 (2020)
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
Faster Heuristics for Graph Burning. CoRR (2020)
Anjeneya Swami Kare, I. Vinod Reddy
Parameterized Algorithms for Graph Burning Problem. IWOCA (2019)
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
H-Free Coloring on Graphs with Bounded Tree-Width. CALDAM (2019)
Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram Bhyravarapu
On the Tractability of (k, i)-Coloring. CoRR (2018)
Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram Bhyravarapu
On the Tractability of (k, i)-Coloring. CALDAM (2018)
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
Bipartitioning Problems on Graphs with Bounded Tree-Width. CoRR (2018)
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
On Structural Parameterizations of the Matching Cut Problem. COCOA (2) (2017)
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri
Algorithms and hardness results for happy coloring problems. CoRR (2017)
Anjeneya Swami Kare
A Simple Algorithm For Replacement Paths Problem. Electron. Notes Discret. Math. 53 (2016)
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
Linear Time Algorithms for Happy Vertex Coloring Problems for Trees. IWOCA (2016)
Anjeneya Swami Kare
A Simple Algorithm For Replacement Paths Problem. CoRR (2015)
Anjeneya Swami Kare, Sanjeev Saxena
Swap Edges of Shortest Path Tree in Parallel. RAIT (2014)
Anjeneya Swami Kare, Sanjeev Saxena
Efficient solutions for finding vitality with respect to shortest paths. IC3 (2013)