Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth
- Submitting institution
-
The University of Warwick
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 10610
- Type
- E - Conference contribution
- DOI
-
10.1109/FOCS.2014.28
- Title of conference / published proceedings
- 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014)
- First page
- 186
- Volume
- -
- Issue
- -
- ISSN
- 0272-5428
- Open access status
- Out of scope for open access requirements
- Month of publication
- December
- Year of publication
- 2014
- URL
-
-
- 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
-
3
- Research group(s)
-
T - Theory and Foundations
- Citation count
- 13
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper appeared in FOCS'14, one of the two strongest conferences in theoretical computer science, and was selected for invitation to the subsequent special issue of SICOMP, a top journal in the field. A reviewer commented: "The result is an important breakthrough in the field of algorithms". This research underpinned a successful ERC Starting Grant proposal of the author. The developed techniques led to several other breakthroughs (FOCS'15, FOCS'18), and became part of the highly cited book "Parametrized Algorithms" (co-authored with other leading researchers, Springer, 2015), that defined the state-of-the-art and set the future research agenda in this area.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -