| dc.contributor.author |
Misra, Neeldhara |
|
| dc.contributor.author |
Rosamond, Frances |
|
| dc.contributor.author |
Zehavi, Meirav |
|
| dc.date.accessioned |
2020-10-06T07:55:37Z |
|
| dc.date.available |
2020-10-06T07:55:37Z |
|
| dc.date.issued |
2020-09 |
|
| dc.identifier.citation |
Misra, Neeldhara; Rosamond, Frances and Zehavi, Meirav, "Special issue new frontiers in parameterized complexity and algorithms: foreward by the guest editors", Algorithms, DOI: 10.3390/a13090236, vol. 13, no. 9, Sep. 2020. |
en_US |
| dc.identifier.issn |
1999-4893 |
|
| dc.identifier.uri |
https://doi.org/10.3390/a13090236 |
|
| dc.identifier.uri |
https://repository.iitgn.ac.in/handle/123456789/5736 |
|
| dc.description.abstract |
This Special Issue contains eleven articles�surveys and research papers�that represent fresh and ambitious new directions in the area of Parameterized Complexity. They provide ground-breaking research at the frontiers of knowledge, and they contribute to bridging the gap between theory and practice. The scope and impact of the field continues to increase. Promising avenues and new research challenges are highlighted in this Special Issue. |
|
| dc.description.statementofresponsibility |
by Neeldhara Misra, Frances Rosamond and Meirav Zehavi |
|
| dc.language.iso |
en_US |
en_US |
| dc.publisher |
MDPI |
en_US |
| dc.subject |
FPT; parameterized complexity; kernelization; lower bounds; fine-grained; Heuristics; turbo-charged; ETH/SETH |
en_US |
| dc.title |
Special issue new frontiers in parameterized complexity and algorithms: foreward by the guest editors |
en_US |
| dc.type |
Article |
en_US |
| dc.relation.journal |
Algorithms |
|