Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Fully polynomial-time parameterized computations for graphs and matrices of low treewidthFedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna. soda 2017: 1419-1432 [doi] Polynomial-Time Approximation of Independent Set Parameterized by TreewidthParinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo. esa 2023: [doi]
The following publications are possibly variants of this publication: