Thore Husfeldt

Professor
Fler filtreringsmöjligheter
  1. 2019
  2. 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. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 115. s. 1–13 13 s. 4. (LIPIcs; vol. 115).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  3. 2018
  4. 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, s. 17:1-17:12

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  5. 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, s. 19:1-19:13

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  6. 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), s. 535-544 10 s.

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  7. 2017
  8. Computing the permanent modulo a prime power

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

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

    Thore Husfeldt & Kanj, I., 2017 sep 1, I : Algorithmica. 79, 1, s. 1-2 2 s.

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  10. Narrow sieves for parameterized paths and packings

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  11. 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. s. 1–11 11 s. 16. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 63).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  12. 2015
  13. Graph colouring algorithms

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

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKapitel samlingsverk

  14. Monstret i Turings bibliotek

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

    Forskningsoutput: Bidrag till övrig tidskrift/dags- eller nyhetstidningArtikel i facktidskrift eller populärpress

  15. 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. s. 231-242

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  16. 2014
  17. Automata, Languages, and Programming

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

    Forskningsoutput: Bok/rapportKonferensproceeding (redaktör)

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

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  19. 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. (red.). Springer, Vol. 8572. s. 211-222 12 s.

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  20. 2013
  21. Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  22. 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., s. 727-735 8 s.

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  23. 2012
  24. 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, s. 1436-1444

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  25. 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, s. 1747

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  26. The Traveling Salesman Problem in Bounded Degree Graphs

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  27. 2011
  28. Covering and packing in linear space

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  29. 2010
  30. 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. s. 727-737 10 s.

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  31. Evaluation of permanents in rings and semirings

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  32. 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. s. 426-437 11 s. (Lecture Notes in Computer Science; vol. 6198).

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  33. Invitation to algorithmic uses of inclusion–exclusion

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

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  34. Narrow sieves for parameterized paths and packings

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  35. 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. s. 192-203 11 s.

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  36. Trimmed moebius inversion and graphs of bounded degree

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  37. 2009
  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. s. 578-586

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  39. Set partitioning via inclusion-exclusion

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  40. 2008
  41. 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., s. 677-686

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

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

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  43. Exact graph coloring using inclusion–exclusion

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

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKapitel samlingsverk

  44. 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. s. 198-209

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  45. 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, s. 85-96

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  46. 2007
  47. 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. s. 67-74

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  48. 2006
  49. 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. s. 548-559

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  50. 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., s. 575-582 8 s.

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  51. 2005
  52. Black box for constant-time insertion in priority queues

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  53. 2004
  54. Approximating longest directed paths and cycles

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  55. Dynamic nested brackets

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  56. 2003
  57. Finding a path of superlogarithmic length

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

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

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

  59. 2002
  60. 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. s. 985-992

    Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

  61. Lower bounds for approximate polygon decomposition and minimum gap

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

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift