Magnus Wahlström
Magnus Wahlström
Verified email at - Homepage
Cited by
Cited by
On problems as hard as CNF-SAT
M Cygan, H Dell, D Lokshtanov, D Marx, J Nederlof, Y Okamoto, R Paturi, ...
ACM Transactions on Algorithms (TALG) 12 (3), 1-24, 2016
Representative sets and irrelevant vertices: New tools for kernelization
S Kratsch, M Wahlström
FOCS, 450-459, 2011
Algorithms, measures and upper bounds for satisfiability and related problems
M Wahlström
Department of Computer and Information Science, Linköpings universitet, 2007
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
S Kratsch, M Wahlström
ACM Transactions on Algorithms (TALG) 10 (4), 1-15, 2014
Counting models for 2SAT and 3SAT formulae
V Dahllöf, P Jonsson, M Wahlström
Theoretical Computer Science 332 (1-3), 265-291, 2005
Two edge modification problems without polynomial kernels
S Kratsch, M Wahlström
Parameterized and Exact Computation, 264-275, 2009
Half-integrality, LP-branching, and FPT algorithms
Y Iwata, M Wahlstrom, Y Yoshida
SIAM Journal on Computing 45 (4), 1377-1411, 2016
A completeness theory for polynomial (Turing) kernelization
D Hermelin, S Kratsch, K Sołtys, M Wahlström, X Wu
Algorithmica 71 (3), 702-730, 2015
Fixed-parameter tractability of multicut in directed acyclic graphs
S Kratsch, M Pilipczuk, M Pilipczuk, M Wahlström
SIAM Journal on Discrete Mathematics 29 (1), 122-144, 2015
Clique cover and graph separation: New incompressibility results
M Cygan, S Kratsch, M Pilipczuk, M Pilipczuk, M Wahlström
ACM Transactions on Computation Theory (TOCT) 6 (2), 1-19, 2014
A tighter bound for counting max-weight solutions to 2SAT instances
M Wahlström
Parameterized and Exact Computation, 202-213, 2008
Calculation of discrepancy measures and applications
C Doerr, M Gnewuch, M Wahlström
A Panorama of Discrepancy Theory, 621-678, 2014
Half-integrality, LP-branching and FPT algorithms
M Wahlström
Proceedings of the Twenty-fifth Annual ACM-SIAM symposium on Discrete …, 2014
Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
M Wahlström
STACS, 341-352, 2013
Preprocessing of min ones problems: A dichotomy
S Kratsch, M Wahlström
International Colloquium on Automata, Languages, and Programming, 653-665, 2010
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
M Wahlström
Journal of Algorithms 51 (2), 107-121, 2004
A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
M Gnewuch, M Wahlström, C Winzen
Preprint Math. Archive, 2011
Counting satisfying assignments in 2-SAT and 3-SAT
V Dahllöf, P Jonsson, M Wahlström
International Computing and Combinatorics Conference, 535-543, 2002
A faster fixed-parameter approach to drawing binary tanglegrams
S Böcker, F Hüffner, A Truss, M Wahlström
Parameterized and Exact Computation, 38-49, 2009
Directed multicut is W [1]-hard, even for four terminal pairs
M Pilipczuk, M Wahlström
ACM Transactions on Computation Theory (TOCT) 10 (3), 1-18, 2018
The system can't perform the operation now. Try again later.
Articles 1–20