Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs
- Submitting institution
-
University of Durham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 109866
- Type
- D - Journal article
- DOI
-
10.1016/j.tcs.2017.05.017
- Title of journal
- Theoretical Computer Science
- Article number
- -
- First page
- 67
- Volume
- 689
- Issue
- -
- ISSN
- 03043975
- Open access status
- Compliant
- Month of publication
- -
- Year of publication
- 2017
- URL
-
https://doi.org/10.1016/j.tcs.2017.05.017
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
B - Algorithms and Complexity
- Citation count
- 9
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Subsequently to the initial conference publication which initiated a novel line of research, this paper inspired many researchers in Europe and the USA to start developing fixed-parameter algorithms for polynomial-time solvable problems. These results appeared, among others, in world-leading algorithmic venues such as ESA'15 (http://dx.doi.org/10.4230/LIPIcs.IPEC.2015.17), SODA'16 (https://doi.org/10.1137/1.9781611974331.ch28), SODA’16 (https://doi.org/10.1137/1.9781611974331.ch88), SODA'17 (https://doi.org/10.1137/1.9781611974782.92), SODA'18 (https://doi.org/10.1137/1.9781611975031.176), ESA’18 (http://dx.doi.org/10.4230/LIPIcs.ESA.2018.55), ACM Transactions on Algorithms 2018 (https://doi.org/10.1145/3093239 and https://doi.org/10.1145/3186898) and 2019 (https://doi.org/10.1145/3310228).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -