| Title: |
Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Ivan Bliznets |
-
Steklov Institute of Mathematics, St. Petersburg Department
|
| Marek Cygan |
-
University of Warsaw, Poland, Institute of Informatics
|
| Pawel Komosa |
-
University of Warsaw, Poland, Institute of Informatics
|
| Lukás Mach |
-
University of Warwick, United Kingdom, DIMAP
-
University of Warwick, United Kingdom, Department of Computer Science
|
| Michal Pilipczuk |
-
University of Warsaw, Poland, Institute of Informatics
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
|
| DBLP Key: |
conf/soda/BliznetsCKMP16
|
| Author Comments: |
|