Magnus Wahlstr\"om

Identifiers

No identifiers captured yet.

Papers (22)

1. Optimal FPT-Approximability for Modular Linear Equations cs.DS · 2026 · author #5
2. Multi-budgeted directed cuts cs.DS · 2018 · author #5
3. Alternative parameterizations of Metric Dimension cs.DS · 2018 · author #4
4. Parameterized Algorithms for Zero Extension and Metric Labelling Problems cs.DS · 2018 · author #2
5. Which NP-Hard SAT and CSP Problems Admit Exponentially Improved Algorithms? cs.DS · 2018 · author #2
6. Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra cs.CC · 2017 · author #2
7. Designing Deterministic Polynomial-Space Algorithms by Color-Coding Multivariate Polynomials cs.DS · 2017 · author #3
8. Path-contractions, edge deletions and connectivity preservation cs.DS · 2017 · author #4
9. $k$-Distinct In- and Out-Branchings in Digraphs cs.DS · 2016 · author #3
10. Odd Properly Colored Cycles in Edge-Colored Graphs math.CO · 2016 · author #3
11. Chinese Postman Problem on Edge-Colored Multigraphs cs.DS · 2015 · author #4
12. Directed multicut is W[1]-hard, even for four terminal pairs cs.DS · 2015 · author #2
13. Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem cs.CC · 2014 · author #3
14. Half-integrality, LP-branching and FPT Algorithms cs.DS · 2013 · author #2
15. Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem cs.DS · 2013 · author #1
16. Fixed-parameter tractability of multicut in directed acyclic graphs cs.DS · 2012 · author #4
17. Representative sets and irrelevant vertices: New tools for kernelization cs.DS · 2011 · author #2
18. Clique cover and graph separation: New incompressibility results cs.DS · 2011 · author #5
19. Hierarchies of Inefficient Kernelizability cs.CC · 2011 · author #4
20. Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal cs.DS · 2011 · author #2
21. Hardness of discrepancy computation and epsilon-net verification in high dimension cs.CG · 2011 · author #3
22. Randomized Rounding for Routing and Covering Problems: Experiments and Improvements cs.DS · 2010 · author #3

Mentions

No mention provenance yet.

Frequent Coauthors

• Gregory Gutin 7 shared papers
• Stefan Kratsch 7 shared papers
• Felix Reidl 5 shared papers
• Marcin Pilipczuk 4 shared papers
• Bin Sheng 2 shared papers
• Micha{\l} Pilipczuk 2 shared papers
• M. S. Ramanujan 2 shared papers
• Victor Lagerkvist 2 shared papers
• Anders Yeo 1 shared papers
• Benjamin Doerr 1 shared papers
• Christian Knauer 1 shared papers
• D\'aniel Marx 1 shared papers
• Daniel Werner 1 shared papers
• Danny Hermelin 1 shared papers
• George Osipov 1 shared papers
• Karolina So{\l}tys 1 shared papers
• Konrad K. Dabrowski 1 shared papers
• Marek Cygan 1 shared papers
• Mark Jones 1 shared papers
• Marvin K\"unnemann 1 shared papers