A.S. Himmel
Fast parameterized preprocessing for polynomial-time solvable graph problems
Himmel, A.S.; Mertzios, G.B.; Nichterlein, A.; Niedermeier, R.
Authors
Citation
Himmel, A., Mertzios, G., Nichterlein, A., & Niedermeier, R. (in press). Fast parameterized preprocessing for polynomial-time solvable graph problems. Communications of the ACM,
| Journal Article Type | Article |
|---|---|
| Acceptance Date | Jul 30, 2023 |
| Deposit Date | Aug 8, 2023 |
| Journal | Communications of the ACM |
| Print ISSN | 0001-0782 |
| Publisher | Association for Computing Machinery (ACM) |
| Peer Reviewed | Peer Reviewed |
| Public URL | https://durham-repository.worktribe.com/output/1713272 |
| Publisher URL | https://cacm.acm.org/ |
This file is under embargo due to copyright reasons.
You might also like
Graphs with minimum fractional domatic number
(2023)
Journal Article
Approximate and Randomized algorithms for Computing a Second Hamiltonian Cycle
(2023)
Journal Article
Sliding into the Future: Investigating Sliding Windows in Temporal Graphs
(2023)
Conference Proceeding
The complexity of computing optimum labelings for temporal connectivity
(2022)
Conference Proceeding
The complexity of temporal vertex cover in small-degree graphs
(2022)
Conference Proceeding
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search