2009

Johannsen, D. and Razgon, Igor and Wahlström, M. (2009) Solving SAT for CNF formulas with a one-sided restriction on variable occurrences. In: Kullmann, O. (ed.) Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science 5584. Berlin, Germany: Springer Verlag, pp. 80-85. ISBN 9783642027765.

6 March 2018

Gutin, G.Z. and Reidl, Felix and Wahlström, M. (2018) k-distinct in- and out-branchings in digraphs. Journal of Computer and System Sciences 95 , pp. 86-97. ISSN 0022-0000.

30 April 2018

Gutin, G.Z. and Reidl, Felix and Wahlström, M. and Zehavi, M. (2018) Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials. Journal of Computer and System Sciences 95 , pp. 69-85. ISSN 0022-0000.