Fully polynomial-time parameterized computations for graphs and matrices of low treewidth.

Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna

Browse the full SODA paper archive.