Thore Husfeldt

According to our database1, Thore Husfeldt authored at least 52 papers between 1995 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Shortest Two Disjoint Paths in Polynomial Time.
SIAM J. Comput., 2019

2018
Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth.
CoRR, 2018

Extensor-coding.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Multivariate Analysis of Orthogonal Range Searching and Graph Distances.
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Counting Connected Subgraphs with Maximum-Degree-Aware Sieving.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
Narrow sieves for parameterized paths and packings.
J. Comput. Syst. Sci., 2017

Computing the permanent modulo a prime power.
Inf. Process. Lett., 2017

Guest Editorial: Special Issue on Parameterized and Exact Computation.
Algorithmica, 2017

2016
Exact Graph Coloring Using Inclusion-Exclusion.
Encyclopedia of Algorithms, 2016

Fast Zeta Transforms for Lattices with Few Irreducibles.
ACM Trans. Algorithms, 2016

Computing Graph Distances Parameterized by Treewidth and Diameter.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

The First Parameterized Algorithms and Computational Experiments Challenge.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015
Graph colouring algorithms.
CoRR, 2015

The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Exponential Time Complexity of the Permanent and the Tutte Polynomial.
ACM Trans. Algorithms, 2014

2013
Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331).
Dagstuhl Reports, 2013

The Parity of Directed Hamiltonian Cycles.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
The traveling salesman problem in bounded degree graphs.
ACM Trans. Algorithms, 2012

Shortest cycle through specified elements.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Covering and packing in linear space.
Inf. Process. Lett., 2011

Invitation to Algorithmic Uses of Inclusion-Exclusion.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Trimmed Moebius Inversion and Graphs of Bounded Degree.
Theory Comput. Syst., 2010

Evaluation of permanents in rings and semirings.
Inf. Process. Lett., 2010

Exponential Time Complexity of the Permanent and the Tutte Polynomial.
Electronic Colloquium on Computational Complexity (ECCC), 2010

The Exponential Time Complexity of Computing the Probability That a Graph Is Connected.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

10441 Abstracts Collection - Exact Complexity of NP-hard Problems.
Proceedings of the Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010, 2010

2009
Set Partitioning via Inclusion-Exclusion.
SIAM J. Comput., 2009

On evaluation of permanents
CoRR, 2009

Counting Paths and Packings in Halves.
Proceedings of the Algorithms, 2009

2008
Exact Graph Coloring Using Inclusion-Exclusion.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

The fast intersection transform with applications to counting paths
CoRR, 2008

Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings.
Algorithmica, 2008

The Travelling Salesman Problem in Bounded Degree Graphs.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Computing the Tutte Polynomial in Vertex-Exponential Time.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
Fourier meets möbius: fast subset convolution.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006
Inclusion-Exclusion Based Algorithms for Graph Colouring.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Inclusion--Exclusion Algorithms for Counting Set Partitions.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
Black box for constant-time insertion in priority queues (note).
ACM Trans. Algorithms, 2005

2004
Dynamic nested brackets.
Inf. Comput., 2004

Approximating Longest Directed Paths and Cycles.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems.
SIAM J. Comput., 2003

Finding a Path of Superlogarithmic Length.
SIAM J. Comput., 2003

Approximating Longest Directed Path
Electronic Colloquium on Computational Complexity (ECCC), 2003

2002
Lower bounds for approximate polygon decomposition and minimum gap.
Inf. Process. Lett., 2002

2001
A cell probe lower bound for dynamic nearest-neighbor searching.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

1998
Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Marked Ancestor Problems.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1996
Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching.
Nord. J. Comput., 1996

Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching.
Proceedings of the Algorithm Theory, 1996

1995
Dynamic Algorithms for the Dyck Languages.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink.
Proceedings of the Algorithms, 1995


  Loading...