Andreas Björklund

Researcher
More filtering options
  1. 2019
  2. Approximate counting of K-paths: Deterministic and in polynomial space

    Andreas Björklund, Lokshtanov, D., Saurabh, S. & Zehavi, M., 2019 Jul 1, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Chatzigiannakis, I., Baier, C., Leonardi, S. & Flocchini, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 132. 24

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

  3. Solving systems of polynomial equations over GF(2) by a parity-counting self-reduction

    Andreas Björklund, Kaski, P. & Williams, R., 2019 Jul 1, 46th International Colloquium on Automata, Languages, and Programming: ICALP 2019. Chatzigiannakis, I., Baier, C., Leonardi, S. & Flocchini, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 132. p. 26:1-26:13 26. (Leibniz International Proceedings in Informatics (LIPIcs)).

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

  4. Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors

    Andreas Björklund & Williams, R., 2019 Jul, 46th International Colloquium on Automata, Languages, and Programming: ICALP 2019. Chatzigiannakis, I., Baier, C., Leonardi, S. & Flocchini, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 132. p. 25:1–25:14 14 p. 25. (Leibniz International Proceedings in Informatics (LIPIcs)).

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

  5. A faster hafnian formula for complex matrices and its benchmarking on a supercomputer

    Andreas Björklund, Gupt, B. & Quesada, N., 2019 Jun, In : ACM Journal of Experimental Algorithmics. 24, 1, 17 p., 1.11.

    Research output: Contribution to journalArticle

  6. 2018
  7. Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants

    Andreas Björklund, Kaski, P. & Williams, R., 2018 Sep 18, In : Algorithmica.

    Research output: Contribution to journalArticle

  8. Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants

    Andreas Björklund, Kaski, P. & Williams, R., 2018 Feb 1, 12th International Symposium on Parameterized and Exact Computation, IPEC 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 89.

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

  9. 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

  10. 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

  11. Exploiting Sparsity for Bipartite Hamiltonicity

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

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

  12. 2017
  13. 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

  14. Counting thin subgraphs via packings faster than meet-in-the-middle time

    Andreas Björklund, Kaski, P. & Kowalik, L., 2017 Sep 1, In : ACM Transactions on Algorithms. 13, 4, 48.

    Research output: Contribution to journalArticle

  15. 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

  16. Directed Hamiltonicity and Out-Branchings via Generalized Laplacians

    Andreas Björklund, Kaski, P. & Koutis, I., 2017 Jul 10, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). p. 91:1 - 91:14 14 p. 91

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

  17. Spotting Trees with Few Leaves

    Andreas Björklund, Kamat, V., Kowalik, L. & Zehavi, M., 2017, In : SIAM Journal on Discrete Mathematics. 31, 2, p. 687-713 27 p.

    Research output: Contribution to journalArticle

  18. 2016
  19. Below All Subsets for Some Permutational Counting Problems

    Andreas Björklund, 2016, 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016). p. 17:1-17:11 17

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

  20. Coloring Graphs Having Few Colorings Over Path Decompositions

    Andreas Björklund, 2016, 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016). p. 13:1-13:9 13

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

  21. Constrained Multilinear Detection and Generalized Graph Motifs

    Andreas Björklund, Kaski, P. & Kowalik, L., 2016, In : Algorithmica. 74, 2, p. 947-967

    Research output: Contribution to journalArticle

  22. How Proofs are Prepared at Camelot

    Andreas Björklund & Kaski, P., 2016, PODC '16 Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. ACM, p. 391-400

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

  23. 2015
  24. Engineering Motif Search for Large Graphs

    Andreas Björklund, Kaski, P., Kowalik, L. & Lauri, J., 2015, [Host publication title missing]. Brandes, U. & Eppstein, D. (eds.). p. 104-118 15 p.

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

  25. Spotting Trees with Few Leaves

    Andreas Björklund, Kamat, V., Kowalik, L. & Zehavi, M., 2015, Lecture Notes in Computer Science/Automata, Languages, and Programming. Haldorsson, M. M., Iwama, K., Kobayashi, N. & Speckmann, B. (eds.). Springer, Vol. 9134. p. 243-255

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

  26. 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

  27. 2014
  28. Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time

    Andreas Björklund, Kaski, P. & Kowalik, L., 2014, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. Chekuri, C. (ed.). SIAM, p. 594-603

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

  29. Determinant Sums for Undirected Hamiltonicity

    Andreas Björklund, 2014, In : SIAM Journal on Computing. 43, 1, p. 280-299

    Research output: Contribution to journalArticle

  30. Fast Witness Extraction using a Decision Oracle

    Andreas Björklund, Kaski, P. & Kowalik, L., 2014, Algorithms - ESA 2014/Lecture notes in computer science. Schulz, A. & Wagner, D. (eds.). Springer, Vol. 8737. p. 149-160 12 p.

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

  31. Listing Triangles

    Andreas Björklund, Pagh, R., Vassilevska Williams, V. & Zwick, U., 2014, Automata, Languages, and Programming (Lecture notes in computer science). Esparza, J., Fraigniaud, P., Husfeldt, T. & Koutsoupias, E. (eds.). Springer, Vol. 8572. p. 223-234 12 p.

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

  32. 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

  33. 2013
  34. Counting Closed Trails

    Andreas Björklund & Kaski, P., 2013, In : Information Processing Letters. 113, 1-2, p. 1-3

    Research output: Contribution to journalLetter

  35. Probably Optimal Graph Motifs

    Andreas Björklund, Kaski, P. & Kowalik, L., 2013, [Host publication title missing]. Portier, N. & Wilke, T. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 20. p. 20-31 12 p.

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

  36. 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

  37. 2012
  38. Below All Subsets for Some Permutational Counting Problems

    Andreas Björklund, 2012, (Unpublished) In : CoRR. abs/1211.0391

    Research output: Contribution to journalArticle

  39. Counting perfect matchings as fast as Ryser

    Andreas Björklund, 2012, [Host publication title missing]. SIAM, p. 914-921

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

  40. 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

  41. 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

  42. 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

  43. 2011
  44. 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

  45. 2010
  46. 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

  47. Determinant sums for undirected Hamiltonicity

    Andreas Björklund, 2010, 2010 IEEE 51st Annual Symposium On Foundations Of Computer Science. IEEE - Institute of Electrical and Electronics Engineers Inc., p. 173-182

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

  48. 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

  49. Exact covers via determinants

    Andreas Björklund, 2010, LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 5. p. 95-106 11 p.

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

  50. 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

  51. 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

  52. 2009
  53. 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

  54. 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

  55. 2008
  56. 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

  57. 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

  58. 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

  59. 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

  60. 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

  61. 2007
  62. Algorithmic Bounds for Presumably Hard Combinatorial Problems

    Andreas Björklund, 2007, Datavetenskap LTH. 71 p.

    Research output: ThesisDoctoral Thesis (compilation)

  63. 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

Previous 1 2 Next