Thore Husfeldt

1 – 10 of 48

show: 10
|
sort: year (new to old)

News feed Embed this list Save this search Mark all Export

Cancel

Embed this list

copy and paste the html snippet below into your own page:

<iframe src="https://lup.lub.lu.se/search/person/cs-thu?embed=1&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

« previous
1
2
3
4
5
next »

2022
Mark The shortest even cycle problem is tractable
Björklund, Andreas ^LU ; Husfeldt, Thore ^LU and Kaski, Petteri (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
Curticapean, Radu ; Dell, Holger and Husfeldt, Thore ^LU (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
Bringmann, Karl ; Husfeldt, Thore ^LU and Magnusson, Måns (2020) In Algorithmica 82(8). p.2292-2315
- Contribution to journal › Article
2019
Mark Multivariate Analysis of Orthogonal Range Searching and Graph Distances
Bringmann, Karl ; Husfeldt, Thore ^LU and Magnusson, Måns (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
Björklund, Andreas ^LU and Husfeldt, Thore ^LU (2019) In SIAM Journal on Computing 48(6). p.1698-1710
- Contribution to journal › Article
2018
Mark Counting Connected Subgraphs with Maximum-Degree-Aware Sieving
Björklund, Andreas ^LU ; Husfeldt, Thore ^LU ; Kaski, Petteri and Koivisto, Mikko (2018) 29th International Symposium on Algorithms and Computation, ISAAC 2018

p.1-17
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm
Björklund, Andreas ^LU and Husfeldt, Thore ^LU (2018) 29th International Symposium on Algorithms and Computation, ISAAC 2018

p.1-19
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Extensor-Coding
Brand, Cornelius ; Dell, Holger and Husfeldt, Thore ^LU (2018) 50th Annual ACM Symposium on Theory of Computing, STOC 2018 p.535-544
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2017
Mark Computing the permanent modulo a prime power
Björklund, Andreas ^LU ; Husfeldt, Thore ^LU and Lyckberg, Isak (2017) In Information Processing Letters 125. p.20-25
- Contribution to journal › Article
Mark Computing Graph Distances Parameterized by Treewidth and Diameter
Husfeldt, Thore ^LU (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

« previous
1
2
3
4
5
next »