Information Processing Letters, 0020-0190

Journal

More filtering options
  1. 2019
  2. 2018
  3. Are unique subgraphs not easier to find?

    Kowaluk, M. & Andrzej Lingas, 2018 Jun 1, In : Information Processing Letters. 134, p. 57-61 5 p.

    Research output: Contribution to journalArticle

  4. 2017
  5. 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

  6. 2015
  7. Detecting monomials with k distinct variables

    Floderus, P., Andrzej Lingas, Persson, M. & Sledneu, D., 2015, In : Information Processing Letters. 115, 2, p. 82-86

    Research output: Contribution to journalArticle

  8. 2014
  9. 2013
  10. Counting Closed Trails

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

    Research output: Contribution to journalLetter

  11. Optimal cuts and partitions in tree metrics in polynomial time

    Karpinski, M., Andrzej Lingas & Sledneu, D., 2013, In : Information Processing Letters. 113, 12, p. 447-451

    Research output: Contribution to journalArticle

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

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

  16. 2009
  17. Efficient approximation algorithms for shortest cycles in undirected graphs

    Andrzej Lingas & Lundell, E-M., 2009, In : Information Processing Letters. 109, 10, p. 493-498

    Research output: Contribution to journalArticle

  18. Faster multi-witnesses for Boolean matrix multiplication

    Gasieniec, L., Kowaluk, M. & Andrzej Lingas, 2009, In : Information Processing Letters. 109, 4, p. 242-247

    Research output: Contribution to journalArticle

  19. 2007
  20. Note on covering monotone orthogonal polygons with star-shaped polygons

    Andrzej Lingas, Wasylewicz, A. & Zylinski, P., 2007, In : Information Processing Letters. 104, 6, p. 220-227

    Research output: Contribution to journalArticle

  21. 2005
  22. A note on maximum independent set and related problems on box graphs

    Andrzej Lingas & Wahlén, M., 2005, In : Information Processing Letters. 93, 4, p. 169-171

    Research output: Contribution to journalArticle

  23. Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth

    Czumaj, A., Halldorsson, M. M., Andrzej Lingas & Nilsson, J., 2005, In : Information Processing Letters. 94, 2, p. 49-53

    Research output: Contribution to journalArticle

  24. 2002
  25. A fast correlation attack on LILI-128

    Jönsson, F. & Thomas Johansson, 2002, In : Information Processing Letters. 81, 3, p. 127-132

    Research output: Contribution to journalArticle

  26. Approximation algorithms for time-dependent orienteering

    Fomin, F. V. & Andrzej Lingas, 2002, In : Information Processing Letters. 83, 2, p. 57-62

    Research output: Contribution to journalArticle

  27. Lower bounds for approximate polygon decomposition and minimum gap

    Gudmundsson, J., Thore Husfeldt & Christos Levcopoulos, 2002, In : Information Processing Letters. 81, 3, p. 137-141

    Research output: Contribution to journalArticle

  28. On adaptive deterministic gossiping in ad hoc radio networks

    Gasieniec, L. & Andrzej Lingas, 2002, In : Information Processing Letters. 83, 2, p. 89-93

    Research output: Contribution to journalArticle