Linear kernels and single-exponential algorithms via Protrusion Decompositions
- Submitting institution
-
Birkbeck College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 190
- Type
- D - Journal article
- DOI
-
10.1145/2797140
- Title of journal
- ACM Transactions on Algorithms
- Article number
- -
- First page
- 21:1
- Volume
- 12
- Issue
- 2
- ISSN
- 1549-6325
- Open access status
- Out of scope for open access requirements
- Month of publication
- December
- Year of publication
- 2015
- URL
-
http://eprints.bbk.ac.uk/id/eprint/24759/
- 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
-
6
- Research group(s)
-
1 - Algorithms, Verification and Software
- Citation count
- 33
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This work opened up a new perspective on preprocessing of sparse graphs, an instance of so-called meta-algorithmic results, and cast previous results in a new light. This turned out to be significant in that it opened the door for follow-on research which turned the attention of our community towards the rich mathematical theory of structurally sparse graphs and their algorithmic properties. An earlier version appeared in ICALP 2013, the top-ranking European conference for theoretical computer science (not returned to REF 2014).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -