default search action
Anjeneya Swami Kare
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j7]Rahul Kumar Gautam, Anjeneya Swami Kare
, S. Durga Bhavani
Interest maximization in social networks. J. Supercomput. 81(1): 146 (2025) - 2024
- [j6]Rahul Kumar Gautam
Approximation algorithms for the graph burning on cactus and directed trees. Discret. Math. Algorithms Appl. 16(7): 2350096:1-2350096:20 (2024) - [c13]Vivek Kumar Rajak, Anjeneya Swami Kare:
A Genetic Algorithm-Based Heuristic for Rumour Minimization in Social Networks. ICDCIT 2024: 249-265 - [i10]Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani:
Interest Maximization in Social Networks. CoRR abs/2404.08236 (2024) - [i9]Rahul Kumar Gautam, Anjeneya Swami Kare, Durga Bhavani S.:
Heuristics for Influence Maximization with Tiered Influence and Activation thresholds. CoRR abs/2406.08876 (2024) - [i8]Sangam Balchandar Reddy, Anjeneya Swami Kare:
Algorithms for Minimum Membership Dominating Set Problem. CoRR abs/2408.00797 (2024) - 2023
- [c12]Sangam Balchandar Reddy
Structural Parameterization of Alliance Problems. CALDAM 2023: 447-459 - [c11]Leela Srija Alla, Anjeneya Swami Kare:
Opinion Maximization in Signed Social Networks Using Centrality Measures and Clustering Techniques. ICDCIT 2023: 125-140 - [c10]Rahul Kumar Gautam
Centrality Measures Based Heuristics for Perfect Awareness Problem in Social Networks. MIWAI 2023: 91-100 - [i7]Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani:
Approximation Algorithms for the Graph Burning on Cactus and Directed Trees. CoRR abs/2307.08505 (2023) - [i6]Sangam Balchandar Reddy
On the Tractability of Defensive Alliance Problem. CoRR abs/2307.09760 (2023) - 2022
- [j5]Rahul Kumar Gautam
Faster heuristics for graph burning. Appl. Intell. 52(2): 1351-1361 (2022) - [j4]N. R. Aravind
Vertex partitioning problems on graphs with bounded tree width. Discret. Appl. Math. 319: 254-270 (2022) - 2021
- [j3]Sriram Bhyravarapu
On the tractability of (k, i)-coloring. Discret. Appl. Math. 305: 329-339 (2021) - [c9]Anjeneya Swami Kare, Varun Kumar:
Heuristics for the Generalized Graph Coloring Problem. ICCCNT 2021: 1-6 - 2020
- [j2]Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram
Parameterized complexity of happy coloring problems. Theor. Comput. Sci. 835: 58-81 (2020) - [c8]Anjeneya Swami Kare
Heuristics for the Power Edge Set Problem. ICCCNT 2020: 1-7 - [i5]Rahul Kumar Gautam, Anjeneya Swami Kare
Faster Heuristics for Graph Burning. CoRR abs/2008.08811 (2020)
2010 – 2019
- 2019
- [c7]N. R. Aravind, Subrahmanyam Kalyanasundaram
H-Free Coloring on Graphs with Bounded Tree-Width. CALDAM 2019: 231-244 - [c6]Anjeneya Swami Kare
Parameterized Algorithms for Graph Burning Problem. IWOCA 2019: 304-314 - 2018
- [c5]Saurabh Joshi, Subrahmanyam Kalyanasundaram
On the Tractability of (k, i)-Coloring. CALDAM 2018: 188-198 - [i4]Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram Bhyravarapu:
On the Tractability of (k, i)-Coloring. CoRR abs/1802.03634 (2018) - [i3]N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare:
Bipartitioning Problems on Graphs with Bounded Tree-Width. CoRR abs/1804.04016 (2018) - 2017
- [c4]N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
On Structural Parameterizations of the Matching Cut Problem. COCOA (2) 2017: 475-482 - [i2]N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri:
Algorithms and hardness results for happy coloring problems. CoRR abs/1705.08282 (2017) - 2016
- [j1]Anjeneya Swami Kare
A Simple Algorithm For Replacement Paths Problem. Electron. Notes Discret. Math. 53: 307-318 (2016) - [c3]N. R. Aravind, Subrahmanyam Kalyanasundaram
Linear Time Algorithms for Happy Vertex Coloring Problems for Trees. IWOCA 2016: 281-292 - 2015
- [i1]Anjeneya Swami Kare:
A Simple Algorithm For Replacement Paths Problem. CoRR abs/1511.06905 (2015) - 2014
- [c2]Anjeneya Swami Kare
Swap Edges of Shortest Path Tree in Parallel. RAIT 2014: 77-85 - 2013
- [c1]Anjeneya Swami Kare
Efficient solutions for finding vitality with respect to shortest paths. IC3 2013: 70-75
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: