EDBT 2026 Demo / reviewers in the wild / expert
Anjeneya Swami Kare
dblp:138/0168
· DBLP profile ↗
10ranked-venue papers
1as first author
6since 2021 · last 2026
0000-0003-3644-4802ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 7 · 1 first-author · 4 since 2021Artificial intelligence and machine learning · 2 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | On the tractability of defensive alliance problem
Sangam Balchandar Reddy, Anjeneya Swami Kare |
Discret. Appl. Math. | 2 |
| 2026 | Structural parameterization of minus domination
Sangam Balchandar Reddy, Anjeneya Swami Kare |
Discret. Appl. Math. | 2 |
| 2025 | Interest maximization in social networks
Rahul Kumar Gautam, Anjeneya Swami Kare, Durga Bhavani S. |
J. Supercomput. | 2 |
| 2022 | Faster heuristics for graph burning
Rahul Kumar Gautam, Anjeneya Swami Kare, Durga Bhavani S. |
Appl. Intell. | 2 |
| 2022 | Vertex partitioning problems on graphs with bounded tree width
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare |
Discret. Appl. Math. | 3 |
| 2021 | On the tractability of (k, i)-coloring
Sriram Bhyravarapu, Saurabh Joshi 0001, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare |
Discret. Appl. Math. | 4 |
| 2020 | Parameterized complexity of happy coloring problems
Akanksha Agrawal 0001, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy |
Theor. Comput. Sci. | 4 |
| 2019 | Parameterized Algorithms for Graph Burning Problem
Anjeneya Swami Kare, I. Vinod Reddy |
IWOCA | 1 |
| 2017 | On Structural Parameterizations of the Matching Cut Problem
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare |
COCOA (2) | 3 |
| 2016 | Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare |
IWOCA | 3 |