Compression of transfer matrices. - Per Håkan Lundow (Discret. Math., 2001)

Broken-Cycle-Free Subgraphs and the Log-Concavity Conjecture for Chromatic Polynomials. - Per Håkan Lundow; Klas Markström (Exp. Math., 2006)

Exact and Approximate Compression of Transfer Matrices for Graph Homomorphisms. - Per Håkan Lundow; Klas Markström (LMS J. Comput. Math., 2008)

The 1-vertex transfer matrix and accurate estimation of channel capacity. - Shmuel Friedland; Per Håkan Lundow; Klas Markström (IEEE Trans. Inf. Theory, 2010)

A Counterexample to a Conjecture by Błocki-Zwonek. - Per Åhag; R. Czyz; Per Håkan Lundow (Exp. Math., 2018)

Are We Ready for the Agenda 2030 for Sustainable Development? - Per Åhag; Lisa Hed; Per Håkan Lundow; Leif Olsson (IEEM, 2019)

Efficient computation of permanents, with applications to Boson sampling and random matrices. - Per Håkan Lundow; Klas Markström (J. Comput. Phys., 2022)

On a generalised Lambert W branch transition function arising from p,q-binomial coefficients. - Per Åhag; R. Czyz; Per Håkan Lundow (Appl. Math. Comput., 2024)