| Title: |
Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Andreas Björklund |
-
Lund University, P.O. Box 118, 22100 Lund, Sweden, Department of Computer Science
|
| Petteri Kaski |
-
Helsinki Institute for Information Technology
-
Aalto University, P.O. Box 15400, FI-00076 Aalto, Finland, Department of Information and Computer Science
|
| Lukasz Kowalik |
-
University of Warsaw, Banacha 2, 02-097 Warszawa, 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/BjorklundKK14
|
| Author Comments: |
|