팔로우
Magnus Wahlström
Magnus Wahlström
rhul.ac.uk의 이메일 확인됨 - 홈페이지
제목
인용
인용
연도
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
2262016
Algorithms, measures and upper bounds for satisfiability and related problems
M Wahlström
Department of Computer and Information Science, Linköpings universitet, 2007
1332007
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
1232014
Representative sets and irrelevant vertices: New tools for kernelization
S Kratsch, M Wahlström
FOCS, 450-459, 2011
1172011
Counting models for 2SAT and 3SAT formulae
V Dahllöf, P Jonsson, M Wahlström
Theoretical Computer Science 332 (1-3), 265-291, 2005
1012005
Two edge modification problems without polynomial kernels
S Kratsch, M Wahlström
Parameterized and Exact Computation, 264-275, 2009
95*2009
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
722015
Half-integrality, LP-branching, and FPT algorithms
Y Iwata, M Wahlstrom, Y Yoshida
SIAM Journal on Computing 45 (4), 1377-1411, 2016
712016
Calculation of discrepancy measures and applications
C Doerr, M Gnewuch, M Wahlström
A panorama of discrepancy theory, 621-678, 2014
622014
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
582014
A tighter bound for counting max-weight solutions to 2SAT instances
M Wahlström
Parameterized and Exact Computation, 202-213, 2008
582008
Representative sets and irrelevant vertices: New tools for kernelization
S Kratsch, M Wahlström
Journal of the ACM (JACM) 67 (3), 1-50, 2020
482020
Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
M Wahlström
STACS, 341-352, 2013
482013
Half-integrality, LP-branching and FPT algorithms
M Wahlström
Proceedings of the Twenty-fifth Annual ACM-SIAM symposium on Discrete …, 2014
422014
A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
M Gnewuch, M Wahlström, C Winzen
Preprint Math. Archive, 2011
392011
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
382018
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
372002
Preprocessing of min ones problems: A dichotomy
S Kratsch, M Wahlström
International Colloquium on Automata, Languages, and Programming, 653-665, 2010
352010
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
M Wahlström
Journal of Algorithms 51 (2), 107-121, 2004
352004
Subexponential parameterized odd cycle transversal on planar graphs
D Lokshtanov, S Saurabh, M Wahlström
IARCS Annual Conference on Foundations of Software Technology and …, 2012
342012
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20