Thore Husfeldt
1 – 10 of 43
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2018
- Counting Connected Subgraphs with Maximum-Degree-Aware Sieving (
- Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm (
- Extensor-Coding (
- 2017
- Computing Graph Distances Parameterized by Treewidth and Diameter (
- Narrow sieves for parameterized paths and packings (
- Guest Editorial : Special Issue on Parameterized and Exact Computation (
- Computing the permanent modulo a prime power (
- 2015
- Monstret i Turings bibliotek (
- Graph colouring algorithms (
- The Parity of Set Systems under Random Restrictions with Applications to Exponential Time Problems (