Thore Husfeldt

Set Partitioning via Inclusion-Exclusion

Given a set

Fourier meets möbius: fast subset convolution

N

Marked ancestor problems

with

Inclusion--Exclusion Algorithms for Counting Set Partitions

n

The Travelling Salesman Problem in Bounded Degree Graphs

elements and a family

Computing the Tutte Polynomial in Vertex-Exponential Time

\mathcal{F}

Approximating Longest Directed Paths and Cycles

of subsets, we show how to partition

Finding a Path of Superlogarithmic Length

N

Counting paths and packings in halves

into

Exponential Time Complexity of the Permanent and the Tutte Polynomial

k