Algorithmica, 0178-4617

Journal

More filtering options
  1. 2018
  2. 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

  3. 3D Rectangulations and Geometric Matrix Multiplication

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

    Research output: Contribution to journalArticle

  4. Extreme Witnesses and Their Applications

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

    Research output: Contribution to journalArticle

  5. 2017
  6. Efficiently Correcting Matrix Products

    Gasieniec, L., Christos Levcopoulos, Andrzej Lingas, Pagh, R. & Tokuyama, T., 2017 Oct, In : Algorithmica. 79, 2, p. 428-443

    Research output: Contribution to journalArticle

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

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

    Research output: Contribution to journalArticle

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

  10. 2015
  11. A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows

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

    Research output: Contribution to journalArticle

  12. 2011
  13. A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication

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

    Research output: Contribution to journalArticle

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

  16. Max-stretch reduction for tree spanners

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

    Research output: Contribution to journalArticle

  17. 2007
  18. Polynomial-time algorithms for the ordered maximum agreement subtree problem

    Dessmark, A., Jansson, J., Andrzej Lingas & Lundell, E-M., 2007, In : Algorithmica. 48, 3, p. 233-248

    Research output: Contribution to journalArticle

  19. 2004
  20. Online and offline algorithms for the time-dependent TSP with time zones

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

    Research output: Contribution to journalArticle

  21. 2002
  22. Improved algorithms for constructing fault-tolerant spanners

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

    Research output: Contribution to journalArticle