 | 2012 |
|---|
| 46 |       | Andreas Björklund,
Mikko Koivisto,
Thore Husfeldt,
Jesper Nederlof,
Petteri Kaski,
Pekka Parviainen:
Fast zeta transforms for lattices with few irreducibles.
SODA 2012: 1436-1444 |
| 45 | | Andreas Björklund,
Thore Husfeldt,
Nina Taslaman:
Shortest cycle through specified elements.
SODA 2012: 1747-1753 |
| 44 | | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
The traveling salesman problem in bounded degree graphs.
ACM Transactions on Algorithms 8(2): 18 (2012) |
| 2011 |
|---|
| 43 | | Thore Husfeldt:
Invitation to Algorithmic Uses of Inclusion-Exclusion.
ICALP (2) 2011: 42-59 |
| 42 | | Thore Husfeldt:
Invitation to Algorithmic Uses of Inclusion-Exclusion
CoRR abs/1105.2942: (2011) |
| 41 | | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Covering and packing in linear space.
Inf. Process. Lett. 111(21-22): 1033-1036 (2011) |
| 2010 |
|---|
| 40 | | Holger Dell,
Thore Husfeldt,
Martin Wahlen:
Exponential Time Complexity of the Permanent and the Tutte Polynomial.
ICALP (1) 2010: 426-437 |
| 39 | | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Covering and Packing in Linear Space.
ICALP (1) 2010: 727-737 |
| 38 | | Thore Husfeldt,
Nina Taslaman:
The Exponential Time Complexity of Computing the Probability That a Graph Is Connected.
IPEC 2010: 192-203 |
| 37 | | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Narrow sieves for parameterized paths and packings
CoRR abs/1007.1161: (2010) |
| 36 | | Thore Husfeldt,
Nina Taslaman:
The Exponential Time Complexity of Computing the Probability That a Graph is Connected
CoRR abs/1009.2363: (2010) |
| 35 | | Holger Dell,
Thore Husfeldt,
Martin Wahlen:
Exponential Time Complexity of the Permanent and the Tutte Polynomial.
Electronic Colloquium on Computational Complexity (ECCC) 17: 78 (2010) |
| 34 | | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Evaluation of permanents in rings and semirings.
Inf. Process. Lett. 110(20): 867-870 (2010) |
| 33 | | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Trimmed Moebius Inversion and Graphs of Bounded Degree.
Theory Comput. Syst. 47(3): 637-654 (2010) |
| 2009 |
|---|
| 32 | | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Counting Paths and Packings in Halves.
ESA 2009: 578-586 |
| 31 | | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Counting Paths and Packings in Halves
CoRR abs/0904.3093: (2009) |
| 30 | | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
On evaluation of permanents
CoRR abs/0904.3251: (2009) |
| 29 | | Andreas Björklund,
Thore Husfeldt,
Mikko Koivisto:
Set Partitioning via Inclusion-Exclusion.
SIAM J. Comput. 39(2): 546-563 (2009) |
| 2008 |
|---|
| 28 | | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Computing the Tutte Polynomial in Vertex-Exponential Time.
FOCS 2008: 677-686 |
| 27 | | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
The Travelling Salesman Problem in Bounded Degree Graphs.
ICALP (1) 2008: 198-209 |
| 26 | | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Trimmed Moebius Inversion and Graphs of Bounded Degree.
STACS 2008: 85-96 |
| 25 | | Andreas Björklund,
Thore Husfeldt:
Exact Graph Coloring Using Inclusion-Exclusion.
Encyclopedia of Algorithms 2008 |
| 24 | | Andreas Björklund,
Thore Husfeldt:
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings.
Algorithmica 52(2): 226-249 (2008) |
| 23 | | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Trimmed Moebius Inversion and Graphs of Bounded Degree
CoRR abs/0802.2834: (2008) |
| 22 | | 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 | | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Fourier meets möbius: fast subset convolution.
STOC 2007: 67-74 |
| 20 | | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Computing the Tutte polynomial in vertex-exponential time
CoRR abs/0711.2585: (2007) |
| 2006 |
|---|
| 19 | | Andreas Björklund,
Thore Husfeldt:
Inclusion--Exclusion Algorithms for Counting Set Partitions.
FOCS 2006: 575-582 |
| 18 | | Andreas Björklund,
Thore Husfeldt:
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings.
ICALP (1) 2006: 548-559 |
| 17 | | Andreas Björklund,
Thore Husfeldt,
Petteri Kaski,
Mikko Koivisto:
Fourier meets Möbius: fast subset convolution
CoRR abs/cs/0611101: (2006) |
| 16 | | Andreas Björklund,
Thore Husfeldt:
Inclusion-Exclusion Based Algorithms for Graph Colouring.
Electronic Colloquium on Computational Complexity (ECCC) 13(044): (2006) |
| 2005 |
|---|
| 15 | | 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 | | Andreas Björklund,
Thore Husfeldt,
Sanjeev Khanna:
Approximating Longest Directed Paths and Cycles.
ICALP 2004: 222-233 |
| 13 | | Stephen Alstrup,
Thore Husfeldt,
Theis Rauhe:
Dynamic nested brackets.
Inf. Comput. 193(2): 75-83 (2004) |
| 2003 |
|---|
| 12 | | Andreas Björklund,
Thore Husfeldt,
Sanjeev Khanna:
Approximating Longest Directed Path
Electronic Colloquium on Computational Complexity (ECCC) 10(032): (2003) |
| 11 | | Thore Husfeldt,
Theis Rauhe:
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems.
SIAM J. Comput. 32(3): 736-753 (2003) |
| 10 | | Andreas Björklund,
Thore Husfeldt:
Finding a Path of Superlogarithmic Length.
SIAM J. Comput. 32(6): 1395-1402 (2003) |
| 2002 |
|---|
| 9 | | Andreas Björklund,
Thore Husfeldt:
Finding a Path of Superlogarithmic Length.
ICALP 2002: 985-992 |
| 8 | | 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 | | Stephen Alstrup,
Thore Husfeldt,
Theis Rauhe:
A cell probe lower bound for dynamic nearest-neighbor searching.
SODA 2001: 779-780 |
| 1998 |
|---|
| 6 | | Stephen Alstrup,
Thore Husfeldt,
Theis Rauhe:
Marked Ancestor Problems.
FOCS 1998: 534-544 |
| 5 | | 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 |
Data released under the ODC-BY 1.0 license — See also our legal information page