Travelled to:1 × Finland
1 × France
1 × Iceland
1 × Italy
1 × Japan
1 × Spain
1 × Switzerland
1 × USA
2 × Denmark
Collaborated with:A.Björklund P.Kaski M.Koivisto H.Dell ∅ T.Rauhe M.Wahlen S.Khanna
Talks about:problem (3) time (3) path (3) exponenti (2) algorithm (2) polynomi (2) exact (2) superlogarithm (1) chronogram (1) shortest (1)
Person: Thore Husfeldt
DBLP: Husfeldt:Thore
Facilitated 2 volumes:
EdEdContributed to:
20152014201120102008
20072006200420021998Wrote 11 papers:
- ICALP-v1-2015-BjorklundDH #exponential #problem #random #set #strict
- The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (AB, HD, TH), pp. 231–242.
- ICALP-v1-2014-BjorklundH #polynomial
- Shortest Two Disjoint Paths in Polynomial Time (AB, TH), pp. 211–222.
- ICALP-v2-2011-Husfeldt #algorithm
- Invitation to Algorithmic Uses of Inclusion-Exclusion (TH), pp. 42–59.
- ICALP-v1-2010-BjorklundHKK #linear
- Covering and Packing in Linear Space (AB, TH, PK, MK), pp. 727–737.
- ICALP-v1-2010-DellHW #complexity #exponential #polynomial
- Exponential Time Complexity of the Permanent and the Tutte Polynomial (HD, TH, MW), pp. 426–437.
- ICALP-A-2008-BjorklundHKK #bound #graph #problem
- The Travelling Salesman Problem in Bounded Degree Graphs (AB, TH, PK, MK), pp. 198–209.
- STOC-2007-BjorklundHKK #fourier #performance #set
- Fourier meets möbius: fast subset convolution (AB, TH, PK, MK), pp. 67–74.
- ICALP-v1-2006-BjorklundH #algorithm #satisfiability
- Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings (AB, TH), pp. 548–559.
- ICALP-2004-BjorklundHK #approximate
- Approximating Longest Directed Paths and Cycles (AB, TH, SK), pp. 222–233.
- ICALP-2002-BjorklundH
- Finding a Path of Superlogarithmic Length (AB, TH), pp. 985–992.
- ICALP-1998-HusfeldtR #problem
- Hardness Results for Dynamic Problems by Extensions of Fredman and Saks’ Chronogram Method (TH, TR), pp. 67–78.