Publikationer pr. år
Publikationer pr. år
Publikation
- 14 resultater
Søgeresultater
-
2021
Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths
Curticapean, R.-C., Dell, H. & Husfeldt, T., 2021, Proceedings of the 29th Annual European Symposium on Algorithms. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Bind 204. 17 s. 34Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
Åben adgangFil -
2018
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving
Björklund, A., Husfeldt, T., Kaski, P. & Koivisto, M., 2018, 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan.. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Bind 123. s. 17:1-17:12 12 s. 17. (Leibniz International Proceedings in Informatics).Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
Åben adgangFil -
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm
Björklund, A. & Husfeldt, T., 2018, 29th International Symposium on Algorithms and Computation (ISAAC 2018). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Bind 123. s. 19:1-19:13 13 s. (Leibniz International Proceedings in Informatics).Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
Åben adgangFil -
Extensor-coding
Brand, C., Dell, H. & Husfeldt, T., 2018, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing: STOC 2018. Association for Computing Machinery, s. 151 164 s.Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
Fil -
Valid, scalable, authentic, on-site, digital, individual assessment of programming skills
Husfeldt, T., 2018, LTHs 10:e Pedagogiska Inspirationskonferens, 6 december 2018. Lund University, s. 21 23 s.Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning
Åben adgangFil -
2015
The Parity of Set Systems under Random Restrictions with Applications to Exponential Time Problems
Björklund, A., Dell, H. & Husfeldt, T., 2015, Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, ICALP 2015, (6-10 July 2015, Kyoto, Japan). Springer, s. 231-242 12 s. (Lecture Notes in Computer Science, Bind 9134).Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
Åben adgangFil -
2014
Shortest Two Disjoint Paths in Polynomial Time
Björklund, A. & Husfeldt, T., 2014, Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. 12 s. (Lecture Notes in Computer Science, Bind 8572).Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
-
2010
Covering and packing in linear space
Björklund, A., Husfeldt, T., Kaski, P. & Koivisto, M., 2010, 37th International Colloquium on Automata, Languages and Programming (ICALP 2010), Bordeaux, France, July 6-10, 2010. Springer, Bind 6198. s. 727-737 (Lecture Notes in Computer Science).Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
-
Exponential time complexity of the permanent and the Tutte polynomial
Dell, H., Husfeldt, T. & Wahlén, M., 2010, 37th International Colloquium on Automata, Languages and Programming (ICALP 2010), Bordeaux, France, July 6-10, 2010. Springer, Bind 6198. s. 426-437 (Lecture Notest in Computer Science).Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
-
The exponential time complexity of computing the probability that a graph is connected
Husfeldt, T. & Taslaman, N. S., 2010, 5th International Symposium on Parameterized and Exact Computation (IPEC 2010), December 13–15, 2010, Chennai, India. Springer, (Lecture Notes in Computer Science).Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
-
2009
Counting paths and packings in halves
Björklund, A., Husfeldt, T., Kaski, P. & Koivisto, M., 2009, 17th Annual European Symposium on Algorithms. Fiat, A. & Sanders, P. (red.). Springer, Bind 5757. s. 578–586 (Lecture Notes in Computer Science, Bind 5757).Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
-
2008
Computing the Tutte Polynomial in Vertex-Exponential Time
Björklund, A., Husfeldt, T., Kaski, P. & Koivisto, M., 2008, 2008 IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, s. 677-686Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
-
The Travelling Salesman Problem in bounded degree graphs
Björklund, A., Husfeldt, T., Kaski, P. & Koivisto, M., 2008, LNCS Automata, Languages and Programming: 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I. Springer, s. 198–209 (Lecture Notes in Computer Science; Nr. 5125).Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review
-
Trimmed Moebius inversion and graphs of bounded degree
Björklund, A., Husfeldt, T., Kaski, P. & Koivisto, M., 2008, Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science Bordeaux, France, 2008. Albers, S. & Weil, P. (red.). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, s. 85–96Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review