| Title: |
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Bart M. P. Jansen |
-
University of Bergen, Norway
|
| Dániel Marx |
-
Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary, Institute for Computer Science and Control
|
| 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/JansenM15
|
| Author Comments: |
|