Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Michal Pilipczuk, Marcin Wrochna. Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. ACM Transactions on Algorithms, 14(3), 2018. [doi]
@article{FominLSPW18,
title = {Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth},
author = {Fedor V. Fomin and Daniel Lokshtanov and Saket Saurabh 0001 and Michal Pilipczuk and Marcin Wrochna},
year = {2018},
doi = {10.1145/3186898},
url = {https://doi.org/10.1145/3186898},
researchr = {https://researchr.org/publication/FominLSPW18},
cites = {0},
citedby = {0},
journal = {ACM Transactions on Algorithms},
volume = {14},
number = {3},
}