Thore Husfeldt

2009
30	EE	Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: Counting Paths and Packings in Halves CoRR abs/0904.3093: (2009)
29	EE	Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: On evaluation of permanents CoRR abs/0904.3251: (2009)
2008
28	EE	Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: Computing the Tutte Polynomial in Vertex-Exponential Time. FOCS 2008: 677-686
27	EE	Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: The Travelling Salesman Problem in Bounded Degree Graphs. ICALP (1) 2008: 198-209
26	EE	Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: Trimmed Moebius Inversion and Graphs of Bounded Degree. STACS 2008: 85-96
25	EE	Andreas Björklund, Thore Husfeldt: Exact Graph Coloring Using Inclusion-Exclusion. Encyclopedia of Algorithms 2008
24	EE	Andreas Björklund, Thore Husfeldt: Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. Algorithmica 52(2): 226-249 (2008)
23	EE	Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: Trimmed Moebius Inversion and Graphs of Bounded Degree CoRR abs/0802.2834: (2008)
22	EE	Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: The fast intersection transform with applications to counting paths CoRR abs/0809.2489: (2008)
2007
21	EE	Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: Fourier meets möbius: fast subset convolution. STOC 2007: 67-74
20	EE	Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: Computing the Tutte polynomial in vertex-exponential time CoRR abs/0711.2585: (2007)
2006
19	EE	Andreas Björklund, Thore Husfeldt: Inclusion--Exclusion Algorithms for Counting Set Partitions. FOCS 2006: 575-582
18	EE	Andreas Björklund, Thore Husfeldt: Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. ICALP (1) 2006: 548-559
17	EE	Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto: Fourier meets Möbius: fast subset convolution CoRR abs/cs/0611101: (2006)
16	EE	Andreas Björklund, Thore Husfeldt: Inclusion-Exclusion Based Algorithms for Graph Colouring. Electronic Colloquium on Computational Complexity (ECCC) 13(044): (2006)
2005
15	EE	Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup: Black box for constant-time insertion in priority queues (note). ACM Transactions on Algorithms 1(1): 102-106 (2005)
2004
14	EE	Andreas Björklund, Thore Husfeldt, Sanjeev Khanna: Approximating Longest Directed Paths and Cycles. ICALP 2004: 222-233
13	EE	Stephen Alstrup, Thore Husfeldt, Theis Rauhe: Dynamic nested brackets. Inf. Comput. 193(2): 75-83 (2004)
2003
12	EE	Andreas Björklund, Thore Husfeldt, Sanjeev Khanna: Approximating Longest Directed Path Electronic Colloquium on Computational Complexity (ECCC) 10(032): (2003)
11	EE	Thore Husfeldt, Theis Rauhe: New Lower Bound Techniques for Dynamic Partial Sums and Related Problems. SIAM J. Comput. 32(3): 736-753 (2003)
10	EE	Andreas Björklund, Thore Husfeldt: Finding a Path of Superlogarithmic Length. SIAM J. Comput. 32(6): 1395-1402 (2003)
2002
9	EE	Andreas Björklund, Thore Husfeldt: Finding a Path of Superlogarithmic Length. ICALP 2002: 985-992
8	EE	Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos: Lower bounds for approximate polygon decomposition and minimum gap. Inf. Process. Lett. 81(3): 137-141 (2002)
2001
7	EE	Stephen Alstrup, Thore Husfeldt, Theis Rauhe: A cell probe lower bound for dynamic nearest-neighbor searching. SODA 2001: 779-780
1998
6	EE	Stephen Alstrup, Thore Husfeldt, Theis Rauhe: Marked Ancestor Problems. FOCS 1998: 534-544
5	EE	Thore Husfeldt, Theis Rauhe: Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method. ICALP 1998: 67-78
1996
4		Thore Husfeldt, Theis Rauhe, Søren Skyum: Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching. SWAT 1996: 198-211
3		Thore Husfeldt, Theis Rauhe, Søren Skyum: Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching. Nord. J. Comput. 3(4): 323-336 (1996)
1995
2		Thore Husfeldt: Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink. ESA 1995: 199-212
1		Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum: Dynamic Algorithms for the Dyck Languages. WADS 1995: 98-108

Coauthor Index

1	Stephen Alstrup	[6] [7] [13] [15]
2	Andreas Björklund	[9] [10] [12] [14] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30]
3	Gudmund Skovbjerg Frandsen	[1]
4	Joachim Gudmundsson	[8]
5	Petteri Kaski	[17] [20] [21] [22] [23] [26] [27] [28] [29] [30]
6	Sanjeev Khanna	[12] [14]
7	Mikko Koivisto	[17] [20] [21] [22] [23] [26] [27] [28] [29] [30]
8	Christos Levcopoulos	[8]
9	Peter Bro Miltersen	[1]
10	Theis Rauhe	[1] [3] [4] [5] [6] [7] [11] [13] [15]
11	Søren Skyum	[1] [3] [4]
12	Mikkel Thorup	[15]

Colors in the list of coauthors