Algorithmica, ‎0178-4617

Journal

More filtering options
  1. 2020
  2. Multivariate Analysis of Orthogonal Range Searching and Graph Distances

    Karl Bringmann, Thore Husfeldt & Måns Magnusson, 2020 Aug, In: Algorithmica. 82, 8, p. 2292-2315 24 p.

    Research output: Contribution to journalArticle

  3. 2019
  4. Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants

    Andreas Björklund, Petteri Kaski & Ryan Williams, 2019 Oct, In: Algorithmica. 81, 10, p. 4010-4028 19 p.

    Research output: Contribution to journalArticle

  5. 2018
  6. 3D Rectangulations and Geometric Matrix Multiplication

    PETER SAVONEN FLODERUS, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas & DZMITRY SLEDNEU, 2018 Jan, In: Algorithmica. 80, 1, p. 136-154

    Research output: Contribution to journalArticle

  7. Extreme Witnesses and Their Applications

    Andrzej Lingas & Mia Persson, 2018, In: Algorithmica. 80, 12, p. 3943-3957

    Research output: Contribution to journalArticle

  8. 2017
  9. Efficiently Correcting Matrix Products

    Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh & Takeshi Tokuyama, 2017 Oct, In: Algorithmica. 79, 2, p. 428-443

    Research output: Contribution to journalArticle

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

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

    Research output: Contribution to journalArticle

  11. 2016
  12. Constrained Multilinear Detection and Generalized Graph Motifs

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

    Research output: Contribution to journalArticle

  13. 2015
  14. A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows

    Andrzej Lingas & Mia Persson, 2015, In: Algorithmica. 72, 2, p. 607-619

    Research output: Contribution to journalArticle

  15. 2011
  16. A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication

    Andrzej Lingas, 2011, In: Algorithmica. 61, 1, p. 36-50

    Research output: Contribution to journalArticle

  17. 2008
  18. 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

  19. Max-stretch reduction for tree spanners

    Kazuo Iwama, Andrzej Lingas & Masaki Okita, 2008, In: Algorithmica. 50, 2, p. 223-235

    Research output: Contribution to journalArticle

  20. 2007
  21. Polynomial-time algorithms for the ordered maximum agreement subtree problem

    Anders Dessmark, Jesper Jansson, Andrzej Lingas & Eva-Marta Lundell, 2007, In: Algorithmica. 48, 3, p. 233-248

    Research output: Contribution to journalArticle

  22. 2004
  23. Online and offline algorithms for the time-dependent TSP with time zones

    Björn Brodén, M Hammar & BJ Nilsson, 2004, In: Algorithmica. 39, 4, p. 299-319

    Research output: Contribution to journalArticle

  24. 2002
  25. Improved algorithms for constructing fault-tolerant spanners

    Christos Levcopoulos, G Narasimhan & M Smid, 2002, In: Algorithmica. 32, 1, p. 144-156

    Research output: Contribution to journalArticle