Magnus Wahlström

160 papers A* 15A 18B 10Misc 2Journal 101Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Applications of flow-augmentation. Comput. Sci. Rev. Stefan Kratsch, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström
2025	J	`jnl`	Almost Consistent Systems of Linear Equations. ACM Trans. Algorithms Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2025	J	`jnl`	Determinantal Sieving. TheoretiCS Eduard Eiben, Tomohiro Koana, Magnus Wahlström
2025	J	`jnl`	FPT algorithms over linear delta-matroids with applications. CoRR Eduard Eiben, Tomohiro Koana, Magnus Wahlström
2025	A	`conf`	Faster Algorithms on Linear Delta-Matroids. STACS Tomohiro Koana, Magnus Wahlström
2025	J	`jnl`	Flow-Augmentation III: Complexity Dichotomy for Boolean CSPs Parameterized by the Number of Unsatisfied Constraints. SIAM J. Comput. Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2025	J	`jnl`	Flow-augmentation I: Directed graphs. J. ACM Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2025	J	`jnl`	Going Beyond Twin-width? CSPs with Unbounded Domain and Few Variables. CoRR Peter Jonsson, Victor Lagerkvist, Jorke M. de Vlas, Magnus Wahlström
2025	J	`jnl`	Kernelization for list CoRR Marta Piecyk, Astrid Pieterse, Pawel Rzazewski, Magnus Wahlström
2025	A	`conf`	Parameterized Approximability for Modular Linear Equations. ESA Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2025	J	`jnl`	Parameterized Approximability for Modular Linear Equations. CoRR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2025	A	`conf`	Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion. STACS Séhane Bel Houari-Durand, Eduard Eiben, Magnus Wahlström
2025	J	`jnl`	Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion. CoRR Séhane Bel Houari-Durand, Eduard Eiben, Magnus Wahlström
2025	J	`jnl`	The Richness of CSP Non-redundancy. CoRR Joshua Brakensiek, Venkatesan Guruswami, Bart M. P. Jansen, Victor Lagerkvist, Magnus Wahlström
2024	A*	`conf`	Determinantal Sieving. SODA Eduard Eiben, Tomohiro Koana, Magnus Wahlström
2024	J	`jnl`	Faster algorithms on linear delta-matroids. CoRR Tomohiro Koana, Magnus Wahlström
2024	J	`jnl`	Flow-augmentation II: Undirected Graphs. ACM Trans. Algorithms Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2024	J	`jnl`	On Weighted Graph Separation Problems and Flow Augmentation. SIAM J. Discret. Math. Eun Jung Kim, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström
2024	A	`conf`	Parameterized Complexity of MinCSP over the Point Algebra. ESA George Osipov, Marcin Pilipczuk, Magnus Wahlström
2024	A*	`conf`	Representative set statements for delta-matroids and the Mader delta-matroid. SODA Magnus Wahlström
2024	J	`jnl`	Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings. CoRR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2023	B	`ed.`	18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Amsterdam, The Netherlands, September 6-8, 2023 IPEC Neeldhara Misra, Magnus Wahlström
2023	A*	`conf`	Almost Consistent Systems of Linear Equations. SODA Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2023	J	`jnl`	Determinantal Sieving. CoRR Eduard Eiben, Tomohiro Koana, Magnus Wahlström
2023	A*	`conf`	Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. SODA Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2023	A	`conf`	Parameterized Complexity of Equality MinCSP. ESA George Osipov, Magnus Wahlström
2023	J	`jnl`	Parameterized Complexity of Equality MinCSP. CoRR George Osipov, Magnus Wahlström
2023	J	`jnl`	Preference swaps for the stable matching problem. Theor. Comput. Sci. Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
2023	J	`jnl`	Representative set statements for delta-matroids and the Mader delta-matroid. CoRR Magnus Wahlström
2022	J	`jnl`	Almost Consistent Systems of Linear Equations. CoRR Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2022	J	`jnl`	Component Order Connectivity in Directed Graphs. Algorithmica Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2022	A*	`conf`	Directed flow-augmentation. STOC Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2022	J	`jnl`	Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. CoRR Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2022	J	`jnl`	Many-visits TSP revisited. J. Comput. Syst. Sci. Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
2022	B	`conf`	On the Parameterized Complexity of Symmetric Directed Multicut. IPEC Eduard Eiben, Clément Rambaud, Magnus Wahlström
2022	J	`jnl`	On the parameterized complexity of symmetric directed multicut. CoRR Eduard Eiben, Clément Rambaud, Magnus Wahlström
2022	J	`jnl`	On weighted graph separation problems and flow-augmentation. CoRR Eun Jung Kim, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström
2022	J	`jnl`	Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems. ACM Trans. Algorithms Magnus Wahlström
2022	J	`jnl`	The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems. ACM Trans. Comput. Theory Victor Lagerkvist, Magnus Wahlström
2021	J	`jnl`	Directed flow-augmentation. CoRR Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2021	A	`conf`	Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs. ESA Zhiyang He, Jason Li, Magnus Wahlström
2021	J	`jnl`	Parameterized Pre-Coloring Extension and List Coloring Problems. SIAM J. Discret. Math. Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
2021	J	`jnl`	Preference Swaps for the Stable Matching Problem. CoRR Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
2021	J	`jnl`	Randomized Contractions Meet Lean Decompositions. ACM Trans. Algorithms Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh, Magnus Wahlström
2021	A*	`conf`	Solving hard cut problems via flow-augmentation. SODA Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2020	J	`jnl`	Alternative parameterizations of Metric Dimension. Theor. Comput. Sci. Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
2020	B	`conf`	Component Order Connectivity in Directed Graphs. IPEC Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2020	J	`jnl`	Component Order Connectivity in Directed Graphs. CoRR Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2020	A	`conf`	Many Visits TSP Revisited. ESA Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
2020	J	`jnl`	Many visits TSP revisited. CoRR Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström
2020	J	`jnl`	Multi-budgeted Directed Cuts. Algorithmica Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
2020	A*	`conf`	On Quasipolynomial Multicut-Mimicking Networks and Kernelization of Multiway Cut Problems. ICALP Magnus Wahlström
2020	J	`jnl`	On quasipolynomial multicut-mimicking networks and kernelization of multiway cut problems. CoRR Magnus Wahlström
2020	A	`conf`	Parameterized Pre-Coloring Extension and List Coloring Problems. STACS Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
2020	J	`jnl`	Representative Sets and Irrelevant Vertices: New Tools for Kernelization. J. ACM Stefan Kratsch, Magnus Wahlström
2020	J	`jnl`	Solving hard cut problems via flow-augmentation. CoRR Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
2020	J	`jnl`	Sparsification of SAT and CSP Problems via Tractable Extensions. ACM Trans. Comput. Theory Victor Lagerkvist, Magnus Wahlström
2020	J	`jnl`	p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms. CoRR Carl Einarson, Gregory Z. Gutin, Bart M. P. Jansen, Diptapriyo Majumdar, Magnus Wahlström
2019	A*	`conf`	On r-Simple k-Path and Related Problems Parameterized by k/r. SODA Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi
2019	J	`jnl`	Parameterized Pre-coloring Extension and List Coloring Problems. CoRR Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
2019	J	`jnl`	Path-contractions, edge deletions and connectivity preservation. J. Comput. Syst. Sci. Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
2018	J	`jnl`	Alternative parameterizations of Metric Dimension. CoRR Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
2018	J	`jnl`	Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials. J. Comput. Syst. Sci. Gregory Z. Gutin, Felix Reidl, Magnus Wahlström, Meirav Zehavi
2018	J	`jnl`	Directed Multicut is W[1]-hard, Even for Four Terminal Pairs. ACM Trans. Comput. Theory Marcin Pilipczuk, Magnus Wahlström
2018	—	`ch.`	Euler Digraphs. Classes of Directed Graphs Magnus Wahlström
2018	B	`conf`	Multi-Budgeted Directed Cuts. IPEC Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
2018	J	`jnl`	Multi-budgeted directed cuts. CoRR Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström
2018	J	`jnl`	On r-Simple k-Path and Related Problems Parameterized by k/r. CoRR Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi
2018	A*	`conf`	Parameterized Algorithms for Zero Extension and Metric Labelling Problems. ICALP Felix Reidl, Magnus Wahlström
2018	J	`jnl`	Parameterized Algorithms for Zero Extension and Metric Labelling Problems. CoRR Felix Reidl, Magnus Wahlström
2018	J	`jnl`	Which NP-Hard SAT and CSP Problems Admit Exponentially Improved Algorithms? CoRR Victor Lagerkvist, Magnus Wahlström
2017	J	`jnl`	Acyclicity in edge-colored graphs. Discret. Math. Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
2017	J	`jnl`	Chinese Postman Problem on edge-colored multigraphs. Discret. Appl. Math. Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
2017	A	`conf`	Kernelization of Constraint Satisfaction Problems: A Study Through Universal Algebra. CP Victor Lagerkvist, Magnus Wahlström
2017	J	`jnl`	Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra. CoRR Victor Lagerkvist, Magnus Wahlström
2017	J	`jnl`	Kirchoff Matrices and Pfaffians to Design Deterministic Polynomial-Space Parameterized Algorithms. CoRR Gregory Z. Gutin, Felix Reidl, Magnus Wahlström, Meirav Zehavi
2017	A*	`conf`	LP-branching algorithms based on biased graphs. SODA Magnus Wahlström
2017	J	`jnl`	Odd properly colored cycles in edge-colored graphs. Discret. Math. Gregory Z. Gutin, Bin Sheng, Magnus Wahlström
2017	A	`conf`	Path-Contractions, Edge Deletions and Connectivity Preservation. ESA Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
2017	J	`jnl`	Path-contractions, edge deletions and connectivity preservation. CoRR Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
2017	J	`jnl`	Randomization in Parameterized Complexity (Dagstuhl Seminar 17041). Dagstuhl Reports Marek Cygan, Fedor V. Fomin, Danny Hermelin, Magnus Wahlström
2017	J	`jnl`	Rural postman parameterized by the number of components of required edges. J. Comput. Syst. Sci. Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2017	J	`jnl`	The power of primitive positive definitions with polynomially many variables. J. Log. Comput. Victor Lagerkvist, Magnus Wahlström
2017	A*	`conf`	k-Distinct In- and Out-Branchings in Digraphs. ICALP Gregory Z. Gutin, Felix Reidl, Magnus Wahlström
2016	J	`jnl`	$k$-Distinct In- and Out-Branchings in Digraphs. CoRR Gregory Z. Gutin, Felix Reidl, Magnus Wahlström
2016	J	`jnl`	Acyclicity in Edge-Colored Graphs. CoRR Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
2016	A*	`conf`	Directed multicut is SODA Marcin Pilipczuk, Magnus Wahlström
2016	J	`jnl`	Half-integrality, LP-branching, and FPT Algorithms. SIAM J. Comput. Yoichi Iwata, Magnus Wahlström, Yuichi Yoshida
2016	—	`ch.`	How to Generate Randomized Roundings with Dependencies and How to Derandomize Them. Algorithm Engineering Benjamin Doerr, Magnus Wahlström
2016	—	`ch.`	Kernelization, Matroid Methods. Encyclopedia of Algorithms Magnus Wahlström
2016	J	`jnl`	LP-branching algorithms based on biased graphs. CoRR Magnus Wahlström
2016	J	`jnl`	On Problems as Hard as CNF-SAT. ACM Trans. Algorithms Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2016	J	`jnl`	On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations. ACM Trans. Priv. Secur. Jason Crampton, Andrei Gagarin, Gregory Z. Gutin, Mark Jones, Magnus Wahlström
2016	J	`jnl`	Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. ACM Trans. Comput. Theory Stefan Kratsch, Dániel Marx, Magnus Wahlström
2016	J	`jnl`	Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. Algorithmica Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström
2016	J	`jnl`	The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth. SIAM J. Discret. Math. Gregory Z. Gutin, Mark Jones, Magnus Wahlström
2016	J	`jnl`	Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis. Inf. Process. Lett. Gregory Z. Gutin, Magnus Wahlström
2015	J	`jnl`	A Completeness Theory for Polynomial (Turing) Kernelization. Algorithmica Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu
2015	—	`conf`	Bounded Bases of Strong Partial Clones. ISMVL Victor Lagerkvist, Magnus Wahlström, Bruno Zanuttini
2015	J	`jnl`	Chinese Postman Problem on Edge-Colored Multigraphs. CoRR Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
2015	J	`jnl`	Directed multicut is W[1]-hard, even for four terminal pairs. CoRR Marcin Pilipczuk, Magnus Wahlström
2015	J	`jnl`	Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. SIAM J. Discret. Math. Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström
2015	A	`conf`	Structural Parameterizations of the Mixed Chinese Postman Problem. ESA Gregory Z. Gutin, Mark Jones, Magnus Wahlström
2015	J	`jnl`	Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis. CoRR Gregory Z. Gutin, Magnus Wahlström
2014	J	`jnl`	Clique Cover and Graph Separation: New Incompressibility Results. ACM Trans. Comput. Theory Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström
2014	J	`jnl`	Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal. ACM Trans. Algorithms Stefan Kratsch, Magnus Wahlström
2014	A*	`conf`	Half-integrality, LP-branching and FPT Algorithms. SODA Magnus Wahlström
2014	J	`jnl`	Parameterized Directed $k$-Chinese Postman Problem and $k$ Arc-Disjoint Cycles Problem on Euler Digraphs. CoRR Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström
2014	B	`conf`	Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs. WG Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström
2014	B	`conf`	Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. IPEC Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström
2014	J	`jnl`	Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. CoRR Gregory Z. Gutin, Stefan Kratsch, Magnus Wahlström
2014	—	`conf`	Polynomially Closed Co-clones. ISMVL Victor Lagerkvist, Magnus Wahlström
2014	J	`jnl`	Randomized Rounding in the Presence of a Cardinality Constraint. ACM J. Exp. Algorithmics Benjamin Doerr, Magnus Wahlström
2014	J	`jnl`	Structural Parameterizations of the Mixed Chinese Postman Problem. CoRR Gregory Z. Gutin, Mark Jones, Magnus Wahlström
2013	B	`conf`	A Completeness Theory for Polynomial (Turing) Kernelization. IPEC Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu
2013	J	`jnl`	Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem CoRR Magnus Wahlström
2013	A	`conf`	Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem. STACS Magnus Wahlström
2013	J	`jnl`	Half-integrality, LP-branching and FPT Algorithms. CoRR Magnus Wahlström
2013	J	`jnl`	Parameterized Rural Postman and Conjoining Bipartite Matching Problems. CoRR Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2013	J	`jnl`	Parameterized Two-Player Nash Equilibrium. Algorithmica Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström
2013	J	`jnl`	Two edge modification problems without polynomial kernels. Discret. Optim. Stefan Kratsch, Magnus Wahlström
2012	J	`jnl`	A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting. SIAM J. Numer. Anal. Michael Gnewuch, Magnus Wahlström, Carola Winzen
2012	—	`conf`	Clique Cover and Graph Separation: New Incompressibility Results. ICALP (1) Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström
2012	A*	`conf`	Compression via matroids: a randomized polynomial kernel for odd cycle transversal. SODA Stefan Kratsch, Magnus Wahlström
2012	—	`conf`	Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. ICALP (1) Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström
2012	J	`jnl`	Fixed-parameter tractability of multicut in directed acyclic graphs CoRR Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström
2012	J	`jnl`	Hardness of discrepancy computation and ε-net verification in high dimension. J. Complex. Panos Giannopoulos, Christian Knauer, Magnus Wahlström, Daniel Werner
2012	A	`conf`	On Problems as Hard as CNF-SAT. CCC Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2012	A*	`conf`	Representative Sets and Irrelevant Vertices: New Tools for Kernelization. FOCS Stefan Kratsch, Magnus Wahlström
2012	—	`conf`	Subexponential Parameterized Odd Cycle Transversal on Planar Graphs. FSTTCS Daniel Lokshtanov, Saket Saurabh, Magnus Wahlström
2011	J	`jnl`	A Randomized Algorithm Based on Threshold Accepting to Approximate the Star Discrepancy CoRR Michael Gnewuch, Magnus Wahlström, Carola Winzen
2011	J	`jnl`	Clique cover and graph separation: New incompressibility results CoRR Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström
2011	J	`jnl`	Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal CoRR Stefan Kratsch, Magnus Wahlström
2011	A	`conf`	Dependent Randomized Rounding: The Bipartite Case. ALENEX Benjamin Doerr, Marvin Künnemann, Magnus Wahlström
2011	J	`jnl`	Hardness of discrepancy computation and epsilon-net verification in high dimension CoRR Panos Giannopoulos, Christian Knauer, Magnus Wahlström, Daniel Werner
2011	J	`jnl`	Hierarchies of Inefficient Kernelizability CoRR Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu
2011	J	`jnl`	New Plain-Exponential Time Classes for Graph Homomorphism. Theory Comput. Syst. Magnus Wahlström
2011	J	`jnl`	On Problems as Hard as CNFSAT CoRR Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström
2011	B	`conf`	Parameterized Two-Player Nash Equilibrium. WG Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström
2011	J	`jnl`	Representative sets and irrelevant vertices: New tools for kernelization CoRR Stefan Kratsch, Magnus Wahlström
2010	J	`jnl`	Algorithmic construction of low-discrepancy point sets via dependent randomized rounding. J. Complex. Benjamin Doerr, Michael Gnewuch, Magnus Wahlström
2010	B	`conf`	Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. MFCS Stefan Kratsch, Dániel Marx, Magnus Wahlström
2010	J	`jnl`	Parameterized Two-Player Nash Equilibrium CoRR Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström
2010	—	`conf`	Preprocessing of Min Ones Problems: A Dichotomy. ICALP (1) Stefan Kratsch, Magnus Wahlström
2010	J	`jnl`	Randomized Rounding for Routing and Covering Problems: Experiments and Improvements CoRR Benjamin Doerr, Marvin Künnemann, Magnus Wahlström
2010	B	`conf`	Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. SEA Benjamin Doerr, Marvin Künnemann, Magnus Wahlström
2009	—	`conf`	A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams. IWPEC Sebastian Böcker, Falk Hüffner, Anke Truß, Magnus Wahlström
2009	—	`conf`	BBOB: Nelder-Mead with resize and halfruns. GECCO (Companion) Benjamin Doerr, Mahmoud Fouz, Martin Schmidt, Magnus Wahlström
2009	Misc	`conf`	New Plain-Exponential Time Classes for Graph Homomorphism. CSR Magnus Wahlström
2009	J	`jnl`	Preprocessing of Min Ones Problems: A Dichotomy CoRR Stefan Kratsch, Magnus Wahlström
2009	A	`conf`	Randomized Rounding in the Presence of a Cardinality Constraint. ALENEX Benjamin Doerr, Magnus Wahlström
2009	A	`conf`	Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. SAT Daniel Johannsen, Igor Razgon, Magnus Wahlström
2009	—	`conf`	Two Edge Modification Problems without Polynomial Kernels. IWPEC Stefan Kratsch, Magnus Wahlström
2008	—	`conf`	A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances. IWPEC Magnus Wahlström
2007	—	`—`	Algorithms, measures and upper bounds for satisfiability and related problems. Magnus Wahlström
2005	A	`conf`	An Algorithm for the SAT Problem for Formulae of Linear Length. ESA Magnus Wahlström
2005	J	`jnl`	Counting models for 2SAT and 3SAT formulae. Theor. Comput. Sci. Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström
2005	A	`conf`	Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable. SAT Magnus Wahlström
2004	J	`jnl`	Exact algorithms for finding minimum transversals in rank-3 hypergraphs. J. Algorithms Magnus Wahlström
2002	Misc	`conf`	Counting Satisfying Assignments in 2-SAT and 3-SAT. COCOON Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström