Strong Accumulators from Collision-Resistant Hashing

Treewidth computation and extremal combinatorics

Colouring and characterising t-perfect graphs

Auctions for spondored search

Solving NP-Hard problems in Exponential-time

Face counting on an acyclic Birkhoff polytope

Exponential time algorithms – an overview

An Effective Upperbound on Treewidth Using Partial Fill-in of Separators

Read-Once Functions and Cographs Revisited

Tatami Tlings