@article{Fomin_2018,
    doi = {10.1145/3186898},
    url = {https://doi.org/10.1145%2F3186898},
    year = {2018},
    month = {jun},
    publisher = {Association for Computing Machinery ({ACM})},
    volume = {14},
    number = {3},
    pages = {1--45},
    author = {Fedor V. Fomin and Daniel Lokshtanov and Saket Saurabh and Micha{\L} Pilipczuk and Marcin Wrochna},
    title = {Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth},
    journal = {{ACM} Transactions on Algorithms}
}

@article{Fomin_2018, doi = {10.1145/3186898}, url = {https://doi.org/10.1145%2F3186898}, year = {2018}, month = {jun}, publisher = {Association for Computing Machinery ({ACM})}, volume = {14}, number = {3}, pages = {1--45}, author = {Fedor V. Fomin and Daniel Lokshtanov and Saket Saurabh and Micha{\L} Pilipczuk and Marcin Wrochna}, title = {Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth}, journal = {{ACM} Transactions on Algorithms} }