Thore Husfeldt

Professor
More filtering options
  1. Article
  2. Computing the permanent modulo a prime power

    Andreas Björklund, Thore Husfeldt & Lyckberg, I., 2017 Sep 1, In : Information Processing Letters. 125, p. 20-25 6 p.

    Research output: Contribution to journalArticle

  3. Guest Editorial: Special Issue on Parameterized and Exact Computation

    Thore Husfeldt & Kanj, I., 2017 Sep 1, In : Algorithmica. 79, 1, p. 1-2 2 p.

    Research output: Contribution to journalArticle

  4. Narrow sieves for parameterized paths and packings

    Andreas Björklund, Thore Husfeldt, Kaski, P. & Koivisto, M., 2017 Aug, In : Journal of Computer and System Sciences. 87, p. 119-139

    Research output: Contribution to journalArticle

  5. Exponential Time Complexity of the Permanent and the Tutte Polynomial

    Dell, H., Thore Husfeldt, Marx, D., Taslaman, N. & Wahlén, M., 2014, In : ACM Transactions on Algorithms. 10, 4, p. 21

    Research output: Contribution to journalArticle

  6. Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time

    Thore Husfeldt, Paturi, R., Sorkin, G. B. & Williams, R., 2013, In : Dagstuhl Reports. 3, 8, p. 40-72

    Research output: Contribution to journalArticle

  7. The Traveling Salesman Problem in Bounded Degree Graphs

    Andreas Björklund, Thore Husfeldt, Kaski, P. & Koivisto, M., 2012, In : ACM Transactions on Algorithms. 8, 2, p. 18

    Research output: Contribution to journalArticle

  8. Covering and packing in linear space

    Andreas Björklund, Thore Husfeldt, Petteri, K. & Mikko, K., 2011, In : Information Processing Letters. 111, 21–22, p. 1033-1036

    Research output: Contribution to journalArticle

  9. Evaluation of permanents in rings and semirings

    Andreas Björklund, Thore Husfeldt, Kaski, P. & Koiviso, M., 2010, In : Information Processing Letters. 110, 20, p. 867-870

    Research output: Contribution to journalArticle

  10. Trimmed moebius inversion and graphs of bounded degree

    Andreas Björklund, Thore Husfeldt, Kaski, P. & Koivisto, M., 2010, In : Theory of Computing Systems. 47, p. 637-654

    Research output: Contribution to journalArticle

  11. Narrow sieves for parameterized paths and packings

    Andreas Björklund, Thore Husfeldt, Petteri, K. & Mikko, K., 2010, (Unpublished) In : Computing Research Repository. abs/1007.1161

    Research output: Contribution to journalArticle

  12. Set partitioning via inclusion-exclusion

    Andreas Björklund, Thore Husfeldt & Koivisto, M., 2009, In : SIAM Journal on Computing. 39, 2, p. 546-563

    Research output: Contribution to journalArticle

  13. Exact algorithms for exact satisfiability and number of perfect matchings

    Andreas Björklund & Thore Husfeldt, 2008, In : Algorithmica. 52, 2, p. 226-249

    Research output: Contribution to journalArticle

  14. Black box for constant-time insertion in priority queues

    Alstrup, S., Thore Husfeldt, Rauhe, T. & Thorup, M., 2005, In : ACM Transactions on Algorithms. 1, 1, p. 102-106

    Research output: Contribution to journalArticle

  15. Dynamic nested brackets

    Alstrup, S., Thore Husfeldt & Rauhe, T., 2004, In : Information and Computation. 193, 2, p. 75-83

    Research output: Contribution to journalArticle

  16. Approximating longest directed paths and cycles

    Andreas Björklund, Thore Husfeldt & Khanna, S., 2004, In : Lecture Notes in Computer Science. 3142, p. 222-233

    Research output: Contribution to journalArticle

  17. New lower bound techniques for dynamic partial sums and related problems

    Thore Husfeldt & Rauhe, T., 2003, In : SIAM Journal on Computing. 32, 3, p. 736-753

    Research output: Contribution to journalArticle

  18. Finding a path of superlogarithmic length

    Andreas Björklund & Thore Husfeldt, 2003, In : SIAM Journal on Computing. 32, 6, p. 1395-1402

    Research output: Contribution to journalArticle

  19. Lower bounds for approximate polygon decomposition and minimum gap

    Gudmundsson, J., Thore Husfeldt & Christos Levcopoulos, 2002, In : Information Processing Letters. 81, 3, p. 137-141

    Research output: Contribution to journalArticle

  20. Book chapter
  21. Graph colouring algorithms

    Thore Husfeldt, 2015, Topics in Chromatic Graph Theory. Lowell B., B. & Robin J., W. (eds.). Cambridge University Press, p. 277-303

    Research output: Chapter in Book/Report/Conference proceedingBook chapter

  22. Exact graph coloring using inclusion–exclusion

    Andreas Björklund & Thore Husfeldt, 2008, Encyclopedia of Algorithms. Kao, M-Y. (ed.). Springer, p. 289-290

    Research output: Chapter in Book/Report/Conference proceedingBook chapter

  23. Paper in conference proceeding
  24. Multivariate Analysis of Orthogonal Range Searching and Graph Distances

    Bringmann, K., Thore Husfeldt & Magnusson, M., 2019 Feb 6, 13th International Symposium on Parameterized and Exact Computation, IPEC 2018: August 20-24, 2018, Helsinki, Finland. Paul, C. & Philipczuk, M. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 115. p. 1–13 13 p. 4. (LIPIcs; vol. 115).

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  25. Extensor-Coding

    Brand, C., Dell, H. & Thore Husfeldt, 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery (ACM), p. 535-544 10 p.

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  26. Counting Connected Subgraphs with Maximum-Degree-Aware Sieving

    Andreas Björklund, Thore Husfeldt, Kaski, P. & Koivisto, M., 2018, 29th International Symposium on Algorithms and Computation (ISAAC 2018). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 17:1-17:12

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  27. Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm

    Andreas Björklund & Thore Husfeldt, 2018, 29th International Symposium on Algorithms and Computation (ISAAC 2018). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 19:1-19:13

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  28. Computing Graph Distances Parameterized by Treewidth and Diameter

    Thore Husfeldt, 2017 Jan 31, 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 63. p. 1–11 11 p. 16. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 63).

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  29. The Parity of Set Systems under Random Restrictions with Applications to Exponential Time Problems

    Andreas Björklund, Holger, D. & Thore Husfeldt, 2015, Automata, Languages, and Programming (Lecture Notes in Computer Science). Springer, Vol. 9134. p. 231-242

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  30. Shortest Two Disjoint Paths in Polynomial Time

    Andreas Björklund & Thore Husfeldt, 2014, Lecture Notes in Computer Science. Javier, E., Pierre, F., Thore, H. & Elias, K. (eds.). Springer, Vol. 8572. p. 211-222 12 p.

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  31. The Parity of Directed Hamiltonian Cycles

    Andreas Björklund & Thore Husfeldt, 2013, Annual IEEE Symposium on Foundations of Computer Science. IEEE - Institute of Electrical and Electronics Engineers Inc., p. 727-735 8 p.

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  32. Fast zeta transforms for point lattices

    Andreas Björklund, Thore Husfeldt, Petteri, K., Mikko, K., Jesper, N. & Pekka, P., 2012, SODA '12 Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms. SIAM, p. 1436-1444

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  33. Shortest cycle through specified elements

    Andreas Björklund, Thore Husfeldt & Nina, T., 2012, Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms. ACM, p. 1747

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  34. Invitation to algorithmic uses of inclusion–exclusion

    Thore Husfeldt, 2010, Autmata, languages and programming / Lecture Notes in Computer Science. Jiri, S. (ed.). Springer, Vol. 6756. p. 42-59 17 p.

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  35. Exponential time complexity of the permanent and the Tutte polynomial

    Dell, H., Thore Husfeldt & Wahlén, M., 2010, Automata, Languages and Programming. Springer, Vol. 6198. p. 426-437 11 p. (Lecture Notes in Computer Science; vol. 6198).

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  36. The exponential time complexity of computing the probability that a graph is connected

    Thore Husfeldt & Taslaman, N., 2010, Lecture Notes in Computer Science. Springer, Vol. 6198. p. 192-203 11 p.

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  37. Covering and packing in linear space

    Andreas Björklund, Thore Husfeldt, Kaski, P. & Koivisto, M., 2010, Automata, Languages and Programming /Lecture Notes in Computer Science. Springer, Vol. 6198. p. 727-737 10 p.

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  38. Counting paths and packings in halves

    Andreas Björklund, Thore Husfeldt, Kaski, P. & Koivisto, M., 2009, Algorithms - ESA 2009, Proceedings/Lecture notes in computer science. Springer, Vol. 5757. p. 578-586

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  39. The travelling salesman problem in bounded degree graphs

    Andreas Björklund, Thore Husfeldt, Kaski, P. & Koivisto, M., 2008, Automata, Languages and Programming, part 1, Proceedings/Lecture Notes in Computer Science. Springer, Vol. 5125. p. 198-209

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  40. Computing the Tutte polynomial in vertex-exponential time

    Andreas Björklund, Thore Husfeldt, Kaski, P. & Koivisto, M., 2008, Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science. IEEE - Institute of Electrical and Electronics Engineers Inc., p. 677-686

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  41. Trimmed moebius inversion and graphs of bounded degree

    Andreas Björklund, Thore Husfeldt, Kaski, P. & Koivisto, M., 2008, STACS 2008: Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science. LABRI - Laboratoire Bordelais de Recherche en Informatique, p. 85-96

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  42. Fourier meets Möbius: fast subset convolution

    Andreas Björklund, Thore Husfeldt, Kaski, P. & Koivisto, M., 2007, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. p. 67-74

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  43. Exact algorithms for exact satisfiability and number of perfect matchings

    Andreas Björklund & Thore Husfeldt, 2006, Lecture Notes in Computer Science (Automata, Languages and Programming. Proceedings, Part I). Springer, Vol. 4051. p. 548-559

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  44. Inclusion-exclusion algorithms for counting set partitions

    Andreas Björklund & Thore Husfeldt, 2006, 2006 47th Annual IEEE Conference on Foundations of Computer Science. IEEE - Institute of Electrical and Electronics Engineers Inc., p. 575-582 8 p.

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  45. Finding a path of superlogarithmic length

    Andreas Björklund & Thore Husfeldt, 2002, Automata, languages and programming : 29th international colloquium, ICALP 2002, Málaga, Spain, July 8-13, 2002 : proceedings. Springer, Vol. LNCS 2380. p. 985-992

    Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

  46. Specialist publication article
  47. Monstret i Turings bibliotek

    Thore Husfeldt, 2015, Filosofisk tidskrift, 36, 4, p. 44 53 p.

    Research output: Contribution to specialist publication or newspaperSpecialist publication article

  48. Conference proceeding (editor)
  49. Automata, Languages, and Programming

    Javier, E. (ed.), Pierre, F. (ed.), Thore Husfeldt (ed.) & Elias, K. (ed.), 2014, Springer. 624 p. (Lecture Notes in Computer Science; vol. 8573)

    Research output: Book/ReportConference proceeding (editor)