| 2026 | ESA | FPT Algorithms over Linear Delta-Matroids with Applications. | Eduard Eiben, Tomohiro Koana, Magnus Wahlstrm |
| 2026 | ICALP | Going Beyond Twin-Width? CSPs with Unbounded Domain and Few Variables. | Peter Jonsson, Victor Lagerkvist, Jorke M. de Vlas, Magnus Wahlstrm |
| 2025 | ESA | Parameterized Approximability for Modular Linear Equations. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlstrm |
| 2025 | STACS | Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion. | Shane Bel Houari-Durand, Eduard Eiben, Magnus Wahlstrm |
| 2025 | STACS | Faster Algorithms on Linear Delta-Matroids. | Tomohiro Koana, Magnus Wahlstrm |
| 2024 | ESA | Parameterized Complexity of MinCSP over the Point Algebra. | George Osipov, Marcin Pilipczuk, Magnus Wahlstrm |
| 2024 | SODA | Determinantal Sieving. | Eduard Eiben, Tomohiro Koana, Magnus Wahlstrm |
| 2024 | SODA | Representative set statements for delta-matroids and the Mader delta-matroid. | Magnus Wahlstrm |
| 2023 | ESA | Parameterized Complexity of Equality MinCSP. | George Osipov, Magnus Wahlstrm |
| 2023 | SODA | Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. | Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlstrm |
| 2023 | SODA | Almost Consistent Systems of Linear Equations. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlstrm |
| 2022 | STOC | Directed flow-augmentation. | Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlstrm |
| 2021 | ESA | Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs. | Zhiyang He, Jason Li, Magnus Wahlstrm |
| 2021 | SODA | Solving hard cut problems via flow-augmentation. | Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlstrm |
| 2020 | ESA | Many Visits TSP Revisited. | Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlstrm |
| 2020 | ICALP | On Quasipolynomial Multicut-Mimicking Networks and Kernelization of Multiway Cut Problems. | Magnus Wahlstrm |
| 2020 | STACS | Parameterized Pre-Coloring Extension and List Coloring Problems. | Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlstrm |
| 2019 | SODA | On r-Simple k-Path and Related Problems Parameterized by k/r. | Gregory Z. Gutin, Magnus Wahlstrm, Meirav Zehavi |
| 2018 | ICALP | Parameterized Algorithms for Zero Extension and Metric Labelling Problems. | Felix Reidl, Magnus Wahlstrm |
| 2017 | CP | Kernelization of Constraint Satisfaction Problems: A Study Through Universal Algebra. | Victor Lagerkvist, Magnus Wahlstrm |
| 2017 | ESA | Path-Contractions, Edge Deletions and Connectivity Preservation. | Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlstrm |
| 2017 | ICALP | k-Distinct In- and Out-Branchings in Digraphs. | Gregory Z. Gutin, Felix Reidl, Magnus Wahlstrm |
| 2017 | SODA | LP-branching algorithms based on biased graphs. | Magnus Wahlstrm |
| 2016 | SODA | Directed multicut is | Marcin Pilipczuk, Magnus Wahlstrm |
| 2015 | ESA | Structural Parameterizations of the Mixed Chinese Postman Problem. | Gregory Z. Gutin, Mark Jones, Magnus Wahlstrm |
| 2014 | SODA | Half-integrality, LP-branching and FPT Algorithms. | Magnus Wahlstrm |
| 2014 | WG | Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs. | Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlstrm |
| 2013 | STACS | Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem. | Magnus Wahlstrm |
| 2012 | FOCS | Representative Sets and Irrelevant Vertices: New Tools for Kernelization. | Stefan Kratsch, Magnus Wahlstrm |
| 2012 | ICALP | Clique Cover and Graph Separation: New Incompressibility Results. | Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlstrm |
| 2012 | ICALP | Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. | Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlstrm |
| 2012 | SODA | Compression via matroids: a randomized polynomial kernel for odd cycle transversal. | Stefan Kratsch, Magnus Wahlstrm |
| 2011 | ALENEX | Dependent Randomized Rounding: The Bipartite Case. | Benjamin Doerr, Marvin Knnemann, Magnus Wahlstrm |
| 2011 | WG | Parameterized Two-Player Nash Equilibrium. | Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlstrm |
| 2010 | ICALP | Preprocessing of Min Ones Problems: A Dichotomy. | Stefan Kratsch, Magnus Wahlstrm |
| 2010 | MFCS | Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. | Stefan Kratsch, Dniel Marx, Magnus Wahlstrm |
| 2009 | ALENEX | Randomized Rounding in the Presence of a Cardinality Constraint. | Benjamin Doerr, Magnus Wahlstrm |
| 2009 | CSR | New Plain-Exponential Time Classes for Graph Homomorphism. | Magnus Wahlstrm |
| 2009 | GECCO | BBOB: Nelder-Mead with resize and halfruns. | Benjamin Doerr, Mahmoud Fouz, Martin Schmidt, Magnus Wahlstrm |
| 2009 | SAT | Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. | Daniel Johannsen, Igor Razgon, Magnus Wahlstrm |
| 2005 | ESA | An Algorithm for the SAT Problem for Formulae of Linear Length. | Magnus Wahlstrm |
| 2005 | SAT | Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable. | Magnus Wahlstrm |
| 2002 | COCOON | Counting Satisfying Assignments in 2-SAT and 3-SAT. | Vilhelm Dahllf, Peter Jonsson, Magnus Wahlstrm |