Please use this identifier to cite or link to this item: http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/8605
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGAIKWAD, AJINKYAen_US
dc.contributor.authorMAITY, SOUMENen_US
dc.date.accessioned2024-04-01T05:08:12Z
dc.date.available2024-04-01T05:08:12Z
dc.date.issued2024-03en_US
dc.identifier.citationTheoretical Computer Science, 989, 114401.en_US
dc.identifier.issn0304-3975en_US
dc.identifier.issn1879-2294en_US
dc.identifier.urihttps://doi.org/10.1016/j.tcs.2024.114401en_US
dc.identifier.urihttp://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/8605
dc.language.isoenen_US
dc.publisherElsevier B.V.en_US
dc.subjectDefensive and offensive allianceen_US
dc.subjectParameterized complexityen_US
dc.subjectFPTen_US
dc.subjectW[1]-harden_US
dc.subjectTreewidthen_US
dc.subjectETHen_US
dc.subject2024en_US
dc.subject2024-MAR-WEEK3en_US
dc.subjectTOC-MAR-2024en_US
dc.titleOffensive alliances in graphsen_US
dc.typeArticleen_US
dc.contributor.departmentDept. of Mathematicsen_US
dc.identifier.sourcetitleTheoretical Computer Scienceen_US
dc.publication.originofpublisherForeignen_US
Appears in Collections:JOURNAL ARTICLES

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.