![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Ajinkya Gaikwad
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Ajinkya Gaikwad, Soumen Maity:
On Structural Parameterizations of the Harmless Set Problem. Algorithmica 86(5): 1475-1511 (2024) - [j5]Ajinkya Gaikwad, Soumen Maity:
Offensive alliances in graphs. Theor. Comput. Sci. 989: 114401 (2024) - [i12]Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity:
Kernelization Algorithms for the Eigenvalue Deletion Problems. CoRR abs/2404.10023 (2024) - 2023
- [c8]Ajinkya Gaikwad, Soumen Maity:
Parameterized Complexity of the Th+1-Free Edge Deletion Problem. FCT 2023: 221-233 - 2022
- [j4]Ajinkya Gaikwad, Soumen Maity:
Globally minimal defensive alliances. Inf. Process. Lett. 177: 106253 (2022) - [j3]Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
Parameterized complexity of satisfactory partition problem. Theor. Comput. Sci. 907: 113-127 (2022) - [j2]Ajinkya Gaikwad, Soumen Maity:
Defensive alliances in graphs. Theor. Comput. Sci. 928: 136-150 (2022) - [j1]Ajinkya Gaikwad, Soumen Maity:
Further parameterized algorithms for the F-free edge deletion problem. Theor. Comput. Sci. 933: 125-137 (2022) - [c7]Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
Parameterized Intractability of Defensive Alliance Problem. CALDAM 2022: 279-291 - [c6]Ajinkya Gaikwad, Soumen Maity:
On the Harmless Set Problem Parameterized by Treewidth. WALCOM 2022: 227-238 - [i11]Ajinkya Gaikwad, Soumen Maity:
Globally Minimal Defensive Alliances: A Parameterized Perspective. CoRR abs/2202.02010 (2022) - [i10]Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Shuvam Kant Tripathi:
Maximum Minimal Feedback Vertex Set: A Parameterized Perspective. CoRR abs/2208.01953 (2022) - [i9]Ajinkya Gaikwad, Soumen Maity:
Parameterized Complexity of Upper Edge Domination. CoRR abs/2208.02522 (2022) - [i8]Ajinkya Gaikwad, Soumen Maity:
Offensive Alliances in Graphs. CoRR abs/2208.02992 (2022) - [i7]Ajinkya Gaikwad, Soumen Maity, Saket Saurabh:
Parameterized Algorithms for Locally Minimal Defensive Alliance. CoRR abs/2208.03491 (2022) - 2021
- [c5]Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
Parameterized Complexity of Locally Minimal Defensive Alliances. CALDAM 2021: 135-148 - [c4]Ajinkya Gaikwad, Soumen Maity:
On Structural Parameterizations of the Offensive Alliance Problem. COCOA 2021: 579-586 - [c3]Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
Parameterized Complexity of Defensive and Offensive Alliances in Graphs. ICDCIT 2021: 175-187 - [c2]Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
The Balanced Satisfactory Partition Problem. SOFSEM 2021: 322-336 - [i6]Ajinkya Gaikwad, Soumen Maity:
Edge Deletion to Restrict the Size of an Epidemic. CoRR abs/2102.06068 (2021) - [i5]Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
Parameterized Complexity of Locally Minimal Defensive Alliances. CoRR abs/2105.10742 (2021) - [i4]Ajinkya Gaikwad, Soumen Maity:
On Structural Parameterizations of the Offensive Alliance Problem. CoRR abs/2110.15757 (2021) - [i3]Ajinkya Gaikwad, Soumen Maity:
Defensive Alliances in Graphs. CoRR abs/2111.05545 (2021) - [i2]Ajinkya Gaikwad, Soumen Maity:
The Harmless Set Problem. CoRR abs/2111.06267 (2021) - 2020
- [c1]Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
Parameterized Complexity of Satisfactory Partition Problem. COCOA 2020: 76-90 - [i1]Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:
The Satisfactory Partition Problem. CoRR abs/2007.14339 (2020)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-05-20 00:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint