Statistics
Publications
36
Citations
1.5K
H-Index
22
Active since
2004
Magnus Wahlström is an author at Royal Holloway University of London specializing in algorithms, computer science, and computing.
Publications per year
2004–2022
36
36
On Problems as Hard as CNF-SAT
Marek Cygan, Holger Dell, Daniel Lokshtanov et al. · ACM Transactions on Algorithms · 2016 · 117 citations
A Completeness Theory for Polynomial (Turing) Kernelization
Danny Hermelin, Stefan Kratsch, Karolina Sołtys et al. · Algorithmica · 2014 · 89 citations
Stefan Kratsch, Magnus Wahlström · ACM Transactions on Algorithms · 2014 · 87 citations
1–5 of 36