Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time.

Andreas BjörklundPetteri KaskiLukasz Kowalik
Published in: SODA (2014)