Thore Husfeldt (Former)
1 – 48 of 48
- show: 250
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2022
-
Mark
The shortest even cycle problem is tractable
2022) 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022 In Proceedings of the Annual ACM Symposium on Theory of Computing p.117-130(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2021
-
Mark
Modular counting of subgraphs : Matchings, matching-splittable graphs, and paths
2021) 29th Annual European Symposium on Algorithms, ESA 2021 In Leibniz International Proceedings in Informatics, LIPIcs 204.(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2020
-
Mark
Multivariate Analysis of Orthogonal Range Searching and Graph Distances
(
- Contribution to journal › Article
- 2019
-
Mark
Multivariate Analysis of Orthogonal Range Searching and Graph Distances
2019) 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). In LIPIcs 115. p.1-13(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Shortest two disjoint paths in polynomial time
(
- Contribution to journal › Article
- 2018
-
Mark
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Extensor-Coding
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2017
-
Mark
Computing Graph Distances Parameterized by Treewidth and Diameter
2017) 11th International Symposium on Parameterized and Exact Computation In Leibniz International Proceedings in Informatics (LIPIcs) 63. p.1-11(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Computing the permanent modulo a prime power
(
- Contribution to journal › Article
-
Mark
Guest Editorial : Special Issue on Parameterized and Exact Computation
(
- Contribution to journal › Article
-
Mark
Narrow sieves for parameterized paths and packings
(
- Contribution to journal › Article
- 2015
-
Mark
Monstret i Turings bibliotek
(
- Contribution to specialist publication or newspaper › Specialist publication article
-
Mark
The Parity of Set Systems under Random Restrictions with Applications to Exponential Time Problems
2015) The 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) 9134. p.231-242(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Graph colouring algorithms
2015) p.277-303(
- Chapter in Book/Report/Conference proceeding › Book chapter
- 2014
-
Mark
Shortest Two Disjoint Paths in Polynomial Time
2014) Automata, Languages, and Programming : 41st International Colloquium, ICALP 2014 8572. p.211-222(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exponential Time Complexity of the Permanent and the Tutte Polynomial
(
- Contribution to journal › Article
-
Mark
Automata, Languages, and Programming
- Book/Report › Conference proceeding (editor)
- 2013
-
Mark
Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time
(
- Contribution to journal › Article
-
Mark
The Parity of Directed Hamiltonian Cycles
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2012
-
Mark
The Traveling Salesman Problem in Bounded Degree Graphs
(
- Contribution to journal › Article
-
Mark
Shortest cycle through specified elements
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Fast zeta transforms for point lattices
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2011
-
Mark
Covering and packing in linear space
(
- Contribution to journal › Article
- 2010
-
Mark
Invitation to algorithmic uses of inclusion–exclusion
2010) 38th International Colloquium on Automata, Languages and Programming (ICALP 2011) 6756. p.42-59(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exponential time complexity of the permanent and the Tutte polynomial
2010) 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) In Lecture Notes in Computer Science 6198. p.426-437(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
The exponential time complexity of computing the probability that a graph is connected
2010) 5th International Symposium on Parameterized and Exact Computation (IPEC 2010) 6198. p.192-203(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Trimmed moebius inversion and graphs of bounded degree
(
- Contribution to journal › Article
-
Mark
Evaluation of permanents in rings and semirings
(
- Contribution to journal › Article
-
Mark
Covering and packing in linear space
2010) 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) 6198. p.727-737(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Narrow sieves for parameterized paths and packings
(
- Contribution to journal › Article
- 2009
-
Mark
Set partitioning via inclusion-exclusion
(
- Contribution to journal › Article
-
Mark
Counting paths and packings in halves
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2008
-
Mark
Computing the Tutte polynomial in vertex-exponential time
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exact algorithms for exact satisfiability and number of perfect matchings
(
- Contribution to journal › Article
-
Mark
The travelling salesman problem in bounded degree graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exact graph coloring using inclusion–exclusion
2008) p.289-290(
- Chapter in Book/Report/Conference proceeding › Book chapter
-
Mark
Trimmed moebius inversion and graphs of bounded degree
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2007
-
Mark
Fourier meets Möbius: fast subset convolution
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2006
-
Mark
Exact algorithms for exact satisfiability and number of perfect matchings
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Inclusion-exclusion algorithms for counting set partitions
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2005
-
Mark
Black box for constant-time insertion in priority queues
(
- Contribution to journal › Article
- 2004
-
Mark
Dynamic nested brackets
(
- Contribution to journal › Article
-
Mark
Approximating longest directed paths and cycles
(
- Contribution to journal › Article
- 2003
-
Mark
New lower bound techniques for dynamic partial sums and related problems
(
- Contribution to journal › Article
-
Mark
Finding a path of superlogarithmic length
(
- Contribution to journal › Article
- 2002
-
Mark
Finding a path of superlogarithmic length
2002) Proceedings of 29th International Colloquium on Automata, Languages and Programming LNCS 2380. p.985-992(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Lower bounds for approximate polygon decomposition and minimum gap
(
- Contribution to journal › Article