Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth

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]

Authors

Fedor V. Fomin

This author has not been identified. Look up 'Fedor V. Fomin' in Google

Daniel Lokshtanov

This author has not been identified. Look up 'Daniel Lokshtanov' in Google

Saket Saurabh 0001

This author has not been identified. Look up 'Saket Saurabh 0001' in Google

Michal Pilipczuk

This author has not been identified. Look up 'Michal Pilipczuk' in Google

Marcin Wrochna

This author has not been identified. Look up 'Marcin Wrochna' in Google