| Title: |
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Fedor V. Fomin |
-
University of Bergen, Department of Informatics
|
| Daniel Lokshtanov |
-
University of Bergen, Department of Informatics
|
| Michal Pilipczuk |
-
University of Warsaw, Institute of Informatics
|
| Saket Saurabh |
-
Institute of Mathematical Sciences, India
-
University of Bergen, Department of Informatics
|
| Marcin Wrochna |
-
University of Warsaw, Institute of Informatics
|
| Sharing: |
Research produced no artifacts
|
| Verification: |
Authors have
verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
|
| DBLP Key: |
conf/soda/FominLPSW17
|
| Author Comments: |
|