default search action
Thore Husfeldt
Person information
- affiliation: Lund University, Sweden
- affiliation: IT University of Copenhagen, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i24]Andreas Björklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt:
Chromatic number in 1.9999n time? Fast deterministic set partitioning under the asymptotic rank conjecture. CoRR abs/2404.04987 (2024) - [i23]Andreas Björklund, Thore Husfeldt:
Finding longer cycles via shortest colourful cycle. CoRR abs/2408.03699 (2024) - 2022
- [c33]Andreas Björklund, Thore Husfeldt, Petteri Kaski:
The shortest even cycle problem is tractable. STOC 2022: 117-130 - 2021
- [j22]Thore Husfeldt:
The Presburger Award 2021 - Laudatio for Shayan Oveis Gharan. Bull. EATCS 134 (2021) - [c32]Radu Curticapean, Holger Dell, Thore Husfeldt:
Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. ESA 2021: 34:1-34:17 - [i22]Radu Curticapean, Holger Dell, Thore Husfeldt:
Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths. CoRR abs/2107.00629 (2021) - [i21]Andreas Björklund, Thore Husfeldt, Petteri Kaski:
The Shortest Even Cycle Problem is Tractable. CoRR abs/2111.02992 (2021) - 2020
- [j21]Karl Bringmann, Thore Husfeldt
, Måns Magnusson:
Multivariate Analysis of Orthogonal Range Searching and Graph Distances. Algorithmica 82(8): 2292-2315 (2020) - [j20]Thore Husfeldt, Meena Mahajan, Mikolaj Bojanczyk:
The Presburger Award for Young Scientists 2021 - Call for Nominations. Bull. EATCS 132 (2020) - [c31]Thore Husfeldt
Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk). CPM 2020: 1:1-1:1
2010 – 2019
- 2019
- [j19]Thore Husfeldt, Meena Mahajan, Anca Muscholl:
The Presburger Award for Young Scientists 2020 - Call for Nominations. Bull. EATCS 129 (2019) - [j18]Andreas Björklund, Thore Husfeldt
Shortest Two Disjoint Paths in Polynomial Time. SIAM J. Comput. 48(6): 1698-1710 (2019) - 2018
- [c30]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. ISAAC 2018: 17:1-17:12 - [c29]Andreas Björklund, Thore Husfeldt:
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm. ISAAC 2018: 19:1-19:13 - [c28]Karl Bringmann, Thore Husfeldt, Måns Magnusson:
Multivariate Analysis of Orthogonal Range Searching and Graph Distances. IPEC 2018: 4:1-4:13 - [c27]Cornelius Brand
Extensor-coding. STOC 2018: 151-164 - [i20]Cornelius Brand, Holger Dell, Thore Husfeldt:
Extensor-Coding. CoRR abs/1804.09448 (2018) - [i19]Karl Bringmann, Thore Husfeldt, Måns Magnusson:
Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth. CoRR abs/1805.07135 (2018) - [i18]Andreas Björklund, Thore Husfeldt:
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm. CoRR abs/1806.07586 (2018) - 2017
- [j17]Thore Husfeldt, Iyad A. Kanj:
Guest Editorial: Special Issue on Parameterized and Exact Computation. Algorithmica 79(1): 1-2 (2017) - [j16]Andreas Björklund, Thore Husfeldt, Isak Lyckberg:
Computing the permanent modulo a prime power. Inf. Process. Lett. 125: 20-25 (2017) - [j15]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Narrow sieves for parameterized paths and packings. J. Comput. Syst. Sci. 87: 119-139 (2017) - 2016
- [j14]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Fast Zeta Transforms for Lattices with Few Irreducibles. ACM Trans. Algorithms 12(1): 4:1-4:19 (2016) - [c26]Thore Husfeldt:
Computing Graph Distances Parameterized by Treewidth and Diameter. IPEC 2016: 16:1-16:11 - [c25]Holger Dell
The First Parameterized Algorithms and Computational Experiments Challenge. IPEC 2016: 30:1-30:9 - [r2]Andreas Björklund, Thore Husfeldt:
Exact Graph Coloring Using Inclusion-Exclusion. Encyclopedia of Algorithms 2016: 694-695 - 2015
- [c24]Andreas Björklund, Holger Dell, Thore Husfeldt:
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems. ICALP (1) 2015: 231-242 - [e4]Thore Husfeldt, Iyad A. Kanj:
10th International Symposium on Parameterized and Exact Computation, IPEC 2015, September 16-18, 2015, Patras, Greece. LIPIcs 43, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-92-7 [contents] - [i17]Thore Husfeldt:
Graph colouring algorithms. CoRR abs/1505.05825 (2015) - 2014
- [j13]Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen:
Exponential Time Complexity of the Permanent and the Tutte Polynomial. ACM Trans. Algorithms 10(4): 21:1-21:32 (2014) - [c23]Andreas Björklund, Thore Husfeldt:
Shortest Two Disjoint Paths in Polynomial Time. ICALP (1) 2014: 211-222 - [e3]Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias:
Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. Lecture Notes in Computer Science 8572, Springer 2014, ISBN 978-3-662-43947-0 [contents] - [e2]Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias:
Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II. Lecture Notes in Computer Science 8573, Springer 2014, ISBN 978-3-662-43950-0 [contents] - 2013
- [c22]Andreas Björklund, Thore Husfeldt:
The Parity of Directed Hamiltonian Cycles. FOCS 2013: 727-735 - [i16]Andreas Björklund, Thore Husfeldt:
The Parity of Directed Hamiltonian Cycles. CoRR abs/1301.7250 (2013) - [i15]Thore Husfeldt, Ramamohan Paturi, Gregory B. Sorkin, Ryan Williams:
Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331). Dagstuhl Reports 3(8): 40-72 (2013) - 2012
- [j12]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
The traveling salesman problem in bounded degree graphs. ACM Trans. Algorithms 8(2): 18:1-18:13 (2012) - [c21]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 - [c20]Andreas Björklund, Thore Husfeldt, Nina Taslaman:
Shortest cycle through specified elements. SODA 2012: 1747-1753 - [i14]Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen:
Exponential Time Complexity of the Permanent and the Tutte Polynomial. CoRR abs/1206.1775 (2012) - 2011
- [j11]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Covering and packing in linear space. Inf. Process. Lett. 111(21-22): 1033-1036 (2011) - [c19]Thore Husfeldt:
Invitation to Algorithmic Uses of Inclusion-Exclusion. ICALP (2) 2011: 42-59 - [i13]Thore Husfeldt:
Invitation to Algorithmic Uses of Inclusion-Exclusion. CoRR abs/1105.2942 (2011) - 2010
- [j10]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Evaluation of permanents in rings and semirings. Inf. Process. Lett. 110(20): 867-870 (2010) - [j9]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) - [c18]Holger Dell, Thore Husfeldt, Martin Wahlen:
Exponential Time Complexity of the Permanent and the Tutte Polynomial. ICALP (1) 2010: 426-437 - [c17]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Covering and Packing in Linear Space. ICALP (1) 2010: 727-737 - [c16]Thore Husfeldt, Nina Taslaman:
The Exponential Time Complexity of Computing the Probability That a Graph Is Connected. IPEC 2010: 192-203 - [e1]Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin:
Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010. Dagstuhl Seminar Proceedings 10441, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i12]Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin:
10441 Abstracts Collection - Exact Complexity of NP-hard Problems. Exact Complexity of NP-hard Problems 2010 - [i11]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Narrow sieves for parameterized paths and packings. CoRR abs/1007.1161 (2010) - [i10]Thore Husfeldt, Nina Taslaman:
The Exponential Time Complexity of Computing the Probability That a Graph is Connected. CoRR abs/1009.2363 (2010) - [i9]Holger Dell, Thore Husfeldt, Martin Wahlen:
Exponential Time Complexity of the Permanent and the Tutte Polynomial. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j8]Andreas Björklund, Thore Husfeldt, Mikko Koivisto
Set Partitioning via Inclusion-Exclusion. SIAM J. Comput. 39(2): 546-563 (2009) - [c15]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Counting Paths and Packings in Halves. ESA 2009: 578-586 - [i8]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Counting Paths and Packings in Halves. CoRR abs/0904.3093 (2009) - [i7]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
On evaluation of permanents. CoRR abs/0904.3251 (2009) - 2008
- [j7]Andreas Björklund, Thore Husfeldt:
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. Algorithmica 52(2): 226-249 (2008) - [c14]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Computing the Tutte Polynomial in Vertex-Exponential Time. FOCS 2008: 677-686 - [c13]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
The Travelling Salesman Problem in Bounded Degree Graphs. ICALP (1) 2008: 198-209 - [c12]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Trimmed Moebius Inversion and Graphs of Bounded Degree. STACS 2008: 85-96 - [r1]Andreas Björklund, Thore Husfeldt:
Exact Graph Coloring Using Inclusion-Exclusion. Encyclopedia of Algorithms 2008 - [i6]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Trimmed Moebius Inversion and Graphs of Bounded Degree. CoRR abs/0802.2834 (2008) - [i5]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
The fast intersection transform with applications to counting paths. CoRR abs/0809.2489 (2008) - 2007
- [c11]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Fourier meets möbius: fast subset convolution. STOC 2007: 67-74 - [i4]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Computing the Tutte polynomial in vertex-exponential time. CoRR abs/0711.2585 (2007) - 2006
- [c10]Andreas Björklund, Thore Husfeldt:
Inclusion--Exclusion Algorithms for Counting Set Partitions. FOCS 2006: 575-582 - [c9]Andreas Björklund, Thore Husfeldt:
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. ICALP (1) 2006: 548-559 - [i3]Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Fourier meets Möbius: fast subset convolution. CoRR abs/cs/0611101 (2006) - [i2]Andreas Björklund, Thore Husfeldt:
Inclusion-Exclusion Based Algorithms for Graph Colouring. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j6]Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup:
Black box for constant-time insertion in priority queues (note). ACM Trans. Algorithms 1(1): 102-106 (2005) - 2004
- [j5]Stephen Alstrup, Thore Husfeldt, Theis Rauhe:
Dynamic nested brackets. Inf. Comput. 193(2): 75-83 (2004) - [c8]Andreas Björklund, Thore Husfeldt, Sanjeev Khanna:
Approximating Longest Directed Paths and Cycles. ICALP 2004: 222-233 - 2003
- [j4]Thore Husfeldt, Theis Rauhe:
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems. SIAM J. Comput. 32(3): 736-753 (2003) - [j3]Andreas Björklund, Thore Husfeldt:
Finding a Path of Superlogarithmic Length. SIAM J. Comput. 32(6): 1395-1402 (2003) - [i1]Andreas Björklund, Thore Husfeldt, Sanjeev Khanna:
Approximating Longest Directed Path. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j2]Joachim Gudmundsson
Lower bounds for approximate polygon decomposition and minimum gap. Inf. Process. Lett. 81(3): 137-141 (2002) - [c7]Andreas Björklund, Thore Husfeldt:
Finding a Path of Superlogarithmic Length. ICALP 2002: 985-992 - 2001
- [c6]Stephen Alstrup, Thore Husfeldt, Theis Rauhe:
A cell probe lower bound for dynamic nearest-neighbor searching. SODA 2001: 779-780
1990 – 1999
- 1998
- [c5]Stephen Alstrup, Thore Husfeldt, Theis Rauhe:
Marked Ancestor Problems. FOCS 1998: 534-544 - [c4]Thore Husfeldt, Theis Rauhe:
Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method. ICALP 1998: 67-78 - 1996
- [j1]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) - [c3]Thore Husfeldt, Theis Rauhe, Søren Skyum:
Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching. SWAT 1996: 198-211 - 1995
- [c2]Thore Husfeldt:
Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink. ESA 1995: 199-212 - [c1]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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-15 00:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: