Thore Husfeldt

87 papers A* 14A 4B 9Journal 45Unranked 10

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture. SODA Andreas Björklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt
2025	—	`conf`	Finding longer cycles via shortest colourful cycle. SOSA Andreas Björklund, Thore Husfeldt
2024	J	`jnl`	Chromatic number in 1.9999 CoRR Andreas Björklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt
2024	J	`jnl`	Finding longer cycles via shortest colourful cycle. CoRR Andreas Björklund, Thore Husfeldt
2022	A*	`conf`	The shortest even cycle problem is tractable. STOC Andreas Björklund, Thore Husfeldt, Petteri Kaski
2021	A	`conf`	Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. ESA Radu Curticapean, Holger Dell, Thore Husfeldt
2021	J	`jnl`	Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths. CoRR Radu Curticapean, Holger Dell, Thore Husfeldt
2021	J	`jnl`	The Presburger Award 2021 - Laudatio for Shayan Oveis Gharan. Bull. EATCS Thore Husfeldt
2021	J	`jnl`	The Shortest Even Cycle Problem is Tractable. CoRR Andreas Björklund, Thore Husfeldt, Petteri Kaski
2020	B	`conf`	Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk). CPM Thore Husfeldt
2020	J	`jnl`	Multivariate Analysis of Orthogonal Range Searching and Graph Distances. Algorithmica Karl Bringmann, Thore Husfeldt, Måns Magnusson
2020	J	`jnl`	The Presburger Award for Young Scientists 2021 - Call for Nominations. Bull. EATCS Thore Husfeldt, Meena Mahajan, Mikolaj Bojanczyk
2019	J	`jnl`	Shortest Two Disjoint Paths in Polynomial Time. SIAM J. Comput. Andreas Björklund, Thore Husfeldt
2019	J	`jnl`	The Presburger Award for Young Scientists 2020 - Call for Nominations. Bull. EATCS Thore Husfeldt, Meena Mahajan, Anca Muscholl
2018	B	`conf`	Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. ISAAC Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2018	B	`conf`	Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm. ISAAC Andreas Björklund, Thore Husfeldt
2018	J	`jnl`	Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm. CoRR Andreas Björklund, Thore Husfeldt
2018	J	`jnl`	Extensor-Coding. CoRR Cornelius Brand, Holger Dell, Thore Husfeldt
2018	A*	`conf`	Extensor-coding. STOC Cornelius Brand, Holger Dell, Thore Husfeldt
2018	J	`jnl`	Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth. CoRR Karl Bringmann, Thore Husfeldt, Måns Magnusson
2018	B	`conf`	Multivariate Analysis of Orthogonal Range Searching and Graph Distances. IPEC Karl Bringmann, Thore Husfeldt, Måns Magnusson
2017	J	`jnl`	Computing the permanent modulo a prime power. Inf. Process. Lett. Andreas Björklund, Thore Husfeldt, Isak Lyckberg
2017	J	`jnl`	Guest Editorial: Special Issue on Parameterized and Exact Computation. Algorithmica Thore Husfeldt, Iyad A. Kanj
2017	J	`jnl`	Narrow sieves for parameterized paths and packings. J. Comput. Syst. Sci. Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2016	B	`conf`	Computing Graph Distances Parameterized by Treewidth and Diameter. IPEC Thore Husfeldt
2016	—	`ch.`	Exact Graph Coloring Using Inclusion-Exclusion. Encyclopedia of Algorithms Andreas Björklund, Thore Husfeldt
2016	J	`jnl`	Fast Zeta Transforms for Lattices with Few Irreducibles. ACM Trans. Algorithms Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto, Jesper Nederlof, Pekka Parviainen
2016	B	`conf`	The First Parameterized Algorithms and Computational Experiments Challenge. IPEC Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond
2015	B	`ed.`	10th International Symposium on Parameterized and Exact Computation, IPEC 2015, Patras, Greece, September 16-18, 2015 IPEC Thore Husfeldt, Iyad A. Kanj
2015	J	`jnl`	Graph colouring algorithms. CoRR Thore Husfeldt
2015	—	`conf`	The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems. ICALP (1) Andreas Björklund, Holger Dell, Thore Husfeldt
2014	—	`ed.`	Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I ICALP (1) Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias
2014	—	`ed.`	Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II ICALP (2) Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias
2014	J	`jnl`	Exponential Time Complexity of the Permanent and the Tutte Polynomial. ACM Trans. Algorithms Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen
2014	—	`conf`	Shortest Two Disjoint Paths in Polynomial Time. ICALP (1) Andreas Björklund, Thore Husfeldt
2013	J	`jnl`	Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331). Dagstuhl Reports Thore Husfeldt, Ramamohan Paturi, Gregory B. Sorkin, Ryan Williams
2013	J	`jnl`	The Parity of Directed Hamiltonian Cycles CoRR Andreas Björklund, Thore Husfeldt
2013	A*	`conf`	The Parity of Directed Hamiltonian Cycles. FOCS Andreas Björklund, Thore Husfeldt
2012	J	`jnl`	Exponential Time Complexity of the Permanent and the Tutte Polynomial CoRR Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen
2012	A*	`conf`	Fast zeta transforms for lattices with few irreducibles. SODA Andreas Björklund, Mikko Koivisto, Thore Husfeldt, Jesper Nederlof, Petteri Kaski, Pekka Parviainen
2012	A*	`conf`	Shortest cycle through specified elements. SODA Andreas Björklund, Thore Husfeldt, Nina Taslaman
2012	J	`jnl`	The traveling salesman problem in bounded degree graphs. ACM Trans. Algorithms Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2011	J	`jnl`	Covering and packing in linear space. Inf. Process. Lett. Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2011	J	`jnl`	Invitation to Algorithmic Uses of Inclusion-Exclusion CoRR Thore Husfeldt
2011	—	`conf`	Invitation to Algorithmic Uses of Inclusion-Exclusion. ICALP (2) Thore Husfeldt
2010	—	`conf`	10441 Abstracts Collection - Exact Complexity of NP-hard Problems. Exact Complexity of NP-hard Problems Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin
2010	—	`conf`	Covering and Packing in Linear Space. ICALP (1) Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2010	J	`jnl`	Evaluation of permanents in rings and semirings. Inf. Process. Lett. Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2010	—	`ed.`	Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010 Exact Complexity of NP-hard Problems Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin
2010	—	`conf`	Exponential Time Complexity of the Permanent and the Tutte Polynomial. ICALP (1) Holger Dell, Thore Husfeldt, Martin Wahlen
2010	J	`jnl`	Exponential Time Complexity of the Permanent and the Tutte Polynomial. Electron. Colloquium Comput. Complex. Holger Dell, Thore Husfeldt, Martin Wahlen
2010	J	`jnl`	Narrow sieves for parameterized paths and packings CoRR Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2010	B	`conf`	The Exponential Time Complexity of Computing the Probability That a Graph Is Connected. IPEC Thore Husfeldt, Nina Taslaman
2010	J	`jnl`	The Exponential Time Complexity of Computing the Probability That a Graph is Connected CoRR Thore Husfeldt, Nina Taslaman
2010	J	`jnl`	Trimmed Moebius Inversion and Graphs of Bounded Degree. Theory Comput. Syst. Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2009	J	`jnl`	Counting Paths and Packings in Halves CoRR Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2009	A	`conf`	Counting Paths and Packings in Halves. ESA Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2009	J	`jnl`	On evaluation of permanents CoRR Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2009	J	`jnl`	Set Partitioning via Inclusion-Exclusion. SIAM J. Comput. Andreas Björklund, Thore Husfeldt, Mikko Koivisto
2008	A*	`conf`	Computing the Tutte Polynomial in Vertex-Exponential Time. FOCS Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2008	J	`jnl`	Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. Algorithmica Andreas Björklund, Thore Husfeldt
2008	—	`ch.`	Exact Graph Coloring Using Inclusion-Exclusion. Encyclopedia of Algorithms Andreas Björklund, Thore Husfeldt
2008	—	`conf`	The Travelling Salesman Problem in Bounded Degree Graphs. ICALP (1) Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2008	J	`jnl`	The fast intersection transform with applications to counting paths CoRR Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2008	J	`jnl`	Trimmed Moebius Inversion and Graphs of Bounded Degree CoRR Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2008	A	`conf`	Trimmed Moebius Inversion and Graphs of Bounded Degree. STACS Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2007	J	`jnl`	Computing the Tutte polynomial in vertex-exponential time CoRR Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2007	A*	`conf`	Fourier meets möbius: fast subset convolution. STOC Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2006	—	`conf`	Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. ICALP (1) Andreas Björklund, Thore Husfeldt
2006	J	`jnl`	Fourier meets Möbius: fast subset convolution CoRR Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
2006	A*	`conf`	Inclusion--Exclusion Algorithms for Counting Set Partitions. FOCS Andreas Björklund, Thore Husfeldt
2006	J	`jnl`	Inclusion-Exclusion Based Algorithms for Graph Colouring. Electron. Colloquium Comput. Complex. Andreas Björklund, Thore Husfeldt
2005	J	`jnl`	Black box for constant-time insertion in priority queues (note). ACM Trans. Algorithms Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup
2004	A*	`conf`	Approximating Longest Directed Paths and Cycles. ICALP Andreas Björklund, Thore Husfeldt, Sanjeev Khanna
2004	J	`jnl`	Dynamic nested brackets. Inf. Comput. Stephen Alstrup, Thore Husfeldt, Theis Rauhe
2003	J	`jnl`	Approximating Longest Directed Path Electron. Colloquium Comput. Complex. Andreas Björklund, Thore Husfeldt, Sanjeev Khanna
2003	J	`jnl`	Finding a Path of Superlogarithmic Length. SIAM J. Comput. Andreas Björklund, Thore Husfeldt
2003	J	`jnl`	New Lower Bound Techniques for Dynamic Partial Sums and Related Problems. SIAM J. Comput. Thore Husfeldt, Theis Rauhe
2002	A*	`conf`	Finding a Path of Superlogarithmic Length. ICALP Andreas Björklund, Thore Husfeldt
2002	J	`jnl`	Lower bounds for approximate polygon decomposition and minimum gap. Inf. Process. Lett. Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos
2001	A*	`conf`	A cell probe lower bound for dynamic nearest-neighbor searching. SODA Stephen Alstrup, Thore Husfeldt, Theis Rauhe
1998	A*	`conf`	Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method. ICALP Thore Husfeldt, Theis Rauhe
1998	A*	`conf`	Marked Ancestor Problems. FOCS Stephen Alstrup, Thore Husfeldt, Theis Rauhe
1996	J	`jnl`	Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching. Nord. J. Comput. Thore Husfeldt, Theis Rauhe, Søren Skyum
1996	—	`conf`	Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching. SWAT Thore Husfeldt, Theis Rauhe, Søren Skyum
1995	B	`conf`	Dynamic Algorithms for the Dyck Languages. WADS Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum
1995	A	`conf`	Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink. ESA Thore Husfeldt