Magnus Wahlström

ORCID

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 87

Top Venues

CoRR

SODA

J. Comput. Syst. Sci.

ACM Trans. Algorithms

Linköping University, Sweden (PHD)

Education History

Linköping University, Sweden

PHD

Publications

Eun Jung Kim, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström
On Weighted Graph Separation Problems and Flow Augmentation. SIAM J. Discret. Math. 38 (1) (2024)
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
Flow-augmentation II: Undirected Graphs. ACM Trans. Algorithms 20 (2) (2024)
Eduard Eiben, Tomohiro Koana, Magnus Wahlström
Determinantal Sieving. SODA (2024)
Tomohiro Koana, Magnus Wahlström
Faster algorithms on linear delta-matroids. CoRR (2024)
Magnus Wahlström
Representative set statements for delta-matroids and the Mader delta-matroid. SODA (2024)
Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström
-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms. J. Comput. Syst. Sci. 133 (2023)
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. SODA (2023)
Eduard Eiben, Tomohiro Koana, Magnus Wahlström
Determinantal Sieving. CoRR (2023)
Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
Preference swaps for the stable matching problem. Theor. Comput. Sci. 940 (Part) (2023)
Magnus Wahlström
Representative set statements for delta-matroids and the Mader delta-matroid. CoRR (2023)
George Osipov, Magnus Wahlström
Parameterized Complexity of Equality MinCSP. ESA (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
Almost Consistent Systems of Linear Equations. SODA (2023)
George Osipov, Magnus Wahlström
Parameterized Complexity of Equality MinCSP. CoRR (2023)
Magnus Wahlström
Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems. ACM Trans. Algorithms 18 (2) (2022)
Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
Many-visits TSP revisited. J. Comput. Syst. Sci. 124 (2022)
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. CoRR (2022)
Eduard Eiben, Clément Rambaud, Magnus Wahlström
On the Parameterized Complexity of Symmetric Directed Multicut. IPEC (2022)
Eun Jung Kim, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström
On weighted graph separation problems and flow-augmentation. CoRR (2022)
Eduard Eiben, Clément Rambaud, Magnus Wahlström
On the parameterized complexity of symmetric directed multicut. CoRR (2022)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
Almost Consistent Systems of Linear Equations. CoRR (2022)
Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Component Order Connectivity in Directed Graphs. Algorithmica 84 (9) (2022)
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
Directed flow-augmentation. STOC (2022)
Victor Lagerkvist, Magnus Wahlström
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems. ACM Trans. Comput. Theory 14 (1) (2022)
Zhiyang He, Jason Li, Magnus Wahlström
Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs. ESA (2021)
Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
Preference Swaps for the Stable Matching Problem. CoRR (2021)
Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh, Magnus Wahlström
Randomized Contractions Meet Lean Decompositions. ACM Trans. Algorithms 17 (1) (2021)
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
Directed flow-augmentation. CoRR (2021)
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
Solving hard cut problems via flow-augmentation. SODA (2021)
Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi
. ACM Trans. Algorithms 17 (1) (2021)
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
Parameterized Pre-Coloring Extension and List Coloring Problems. SIAM J. Discret. Math. 35 (1) (2021)
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
Solving hard cut problems via flow-augmentation. CoRR (2020)
Magnus Wahlström
On Quasipolynomial Multicut-Mimicking Networks and Kernelization of Multiway Cut Problems. ICALP (2020)
Victor Lagerkvist, Magnus Wahlström
Sparsification of SAT and CSP Problems via Tractable Extensions. ACM Trans. Comput. Theory 12 (2) (2020)
Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
Many Visits TSP Revisited. ESA (2020)
Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
Alternative parameterizations of Metric Dimension. Theor. Comput. Sci. 806 (2020)
Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Component Order Connectivity in Directed Graphs. CoRR (2020)
Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
Many visits TSP revisited. CoRR (2020)
Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
Multi-budgeted Directed Cuts. Algorithmica 82 (8) (2020)
Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Component Order Connectivity in Directed Graphs. IPEC (2020)
Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström
p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms. CoRR (2020)
Magnus Wahlström
On quasipolynomial multicut-mimicking networks and kernelization of multiway cut problems. CoRR (2020)
Stefan Kratsch, Magnus Wahlström
Representative Sets and Irrelevant Vertices: New Tools for Kernelization. J. ACM 67 (3) (2020)
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
Parameterized Pre-Coloring Extension and List Coloring Problems. STACS (2020)
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
Parameterized Pre-coloring Extension and List Coloring Problems. CoRR (2019)
Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
Path-contractions, edge deletions and connectivity preservation. J. Comput. Syst. Sci. 101 (2019)
Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi
On r-Simple k-Path and Related Problems Parameterized by k/r. SODA (2019)
Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi
On r-Simple k-Path and Related Problems Parameterized by k/r. CoRR (2018)
Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
Multi-Budgeted Directed Cuts. IPEC (2018)
Marcin Pilipczuk, Magnus Wahlström
Directed Multicut is W[1]-hard, Even for Four Terminal Pairs. ACM Trans. Comput. Theory 10 (3) (2018)
Gregory Z. Gutin, Felix Reidl, Magnus Wahlström
-distinct in- and out-branchings in digraphs. J. Comput. Syst. Sci. 95 (2018)
Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
Multi-budgeted directed cuts. CoRR (2018)
Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
Alternative parameterizations of Metric Dimension. CoRR (2018)
Victor Lagerkvist, Magnus Wahlström
Which NP-Hard SAT and CSP Problems Admit Exponentially Improved Algorithms? CoRR (2018)
Felix Reidl, Magnus Wahlström
Parameterized Algorithms for Zero Extension and Metric Labelling Problems. ICALP (2018)
Felix Reidl, Magnus Wahlström
Parameterized Algorithms for Zero Extension and Metric Labelling Problems. CoRR (2018)
Gregory Z. Gutin, Felix Reidl, Magnus Wahlström, Meirav Zehavi
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials. J. Comput. Syst. Sci. 95 (2018)
Victor Lagerkvist, Magnus Wahlström
Kernelization of Constraint Satisfaction Problems: A Study Through Universal Algebra. CP (2017)
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
Acyclicity in edge-colored graphs. Discret. Math. 340 (2) (2017)
Victor Lagerkvist, Magnus Wahlström
Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra. CoRR (2017)
Gregory Z. Gutin, Felix Reidl, Magnus Wahlström
k-Distinct In- and Out-Branchings in Digraphs. ICALP (2017)
Marek Cygan, Fedor V. Fomin, Danny Hermelin, Magnus Wahlström
Randomization in Parameterized Complexity (Dagstuhl Seminar 17041). Dagstuhl Reports 7 (1) (2017)
Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
Path-Contractions, Edge Deletions and Connectivity Preservation. ESA (2017)
Victor Lagerkvist, Magnus Wahlström
The power of primitive positive definitions with polynomially many variables. J. Log. Comput. 27 (5) (2017)
Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Rural postman parameterized by the number of components of required edges. J. Comput. Syst. Sci. 83 (1) (2017)
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
Chinese Postman Problem on edge-colored multigraphs. Discret. Appl. Math. 217 (2017)
Gregory Z. Gutin, Bin Sheng, Magnus Wahlström
Odd properly colored cycles in edge-colored graphs. Discret. Math. 340 (4) (2017)
Magnus Wahlström
LP-branching algorithms based on biased graphs. SODA (2017)
Gregory Z. Gutin, Felix Reidl, Magnus Wahlström, Meirav Zehavi
Kirchoff Matrices and Pfaffians to Design Deterministic Polynomial-Space Parameterized Algorithms. CoRR (2017)
Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
Path-contractions, edge deletions and connectivity preservation. CoRR (2017)
Gregory Z. Gutin, Magnus Wahlström
Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis. Inf. Process. Lett. 116 (3) (2016)
Magnus Wahlström
LP-branching algorithms based on biased graphs. CoRR (2016)
Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
On Problems as Hard as CNF-SAT. ACM Trans. Algorithms 12 (3) (2016)
Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. Algorithmica 75 (2) (2016)
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
Acyclicity in Edge-Colored Graphs. CoRR (2016)
Stefan Kratsch, Dániel Marx, Magnus Wahlström
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. ACM Trans. Comput. Theory 8 (1) (2016)
Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones, Magnus Wahlström
On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations. ACM Trans. Priv. Secur. 19 (3) (2016)
Marcin Pilipczuk, Magnus Wahlström
[1]-hard, even for four terminal pairs. SODA (2016)
Gregory Z. Gutin, Felix Reidl, Magnus Wahlström
$k$-Distinct In- and Out-Branchings in Digraphs. CoRR (2016)
Gregory Z. Gutin, Mark Jones, Magnus Wahlström
The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth. SIAM J. Discret. Math. 30 (4) (2016)
Yoichi Iwata, Magnus Wahlström, Yuichi Yoshida
Half-integrality, LP-branching, and FPT Algorithms. SIAM J. Comput. 45 (4) (2016)
Gregory Z. Gutin, Mark Jones, Magnus Wahlström
Structural Parameterizations of the Mixed Chinese Postman Problem. ESA (2015)
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
Chinese Postman Problem on Edge-Colored Multigraphs. CoRR (2015)
Gregory Z. Gutin, Magnus Wahlström
Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis. CoRR (2015)
Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. SIAM J. Discret. Math. 29 (1) (2015)
Marcin Pilipczuk, Magnus Wahlström
Directed multicut is W[1]-hard, even for four terminal pairs. CoRR (2015)
Victor Lagerkvist, Magnus Wahlström, Bruno Zanuttini
Bounded Bases of Strong Partial Clones. ISMVL (2015)
Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu
A Completeness Theory for Polynomial (Turing) Kernelization. Algorithmica 71 (3) (2015)
Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström
Clique Cover and Graph Separation: New Incompressibility Results. ACM Trans. Comput. Theory 6 (2) (2014)
Stefan Kratsch, Magnus Wahlström
Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal. ACM Trans. Algorithms 10 (4) (2014)
Gregory Z. Gutin, Mark Jones, Magnus Wahlström
Structural Parameterizations of the Mixed Chinese Postman Problem. CoRR (2014)
Magnus Wahlström
Half-integrality, LP-branching and FPT Algorithms. SODA (2014)
Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. IPEC (2014)
Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. CoRR (2014)
Victor Lagerkvist, Magnus Wahlström
Polynomially Closed Co-clones. ISMVL (2014)
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström
Parameterized Directed $k$-Chinese Postman Problem and $k$ Arc-Disjoint Cycles Problem on Euler Digraphs. CoRR (2014)
Benjamin Doerr, Magnus Wahlström
Randomized Rounding in the Presence of a Cardinality Constraint. ACM J. Exp. Algorithmics 19 (1) (2014)
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström
Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs. WG (2014)
Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström
Parameterized Two-Player Nash Equilibrium. Algorithmica 65 (4) (2013)
Stefan Kratsch, Magnus Wahlström
Two edge modification problems without polynomial kernels. Discret. Optim. 10 (3) (2013)
Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Parameterized Rural Postman and Conjoining Bipartite Matching Problems. CoRR (2013)

Magnus Wahlström.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Magnus Wahlström