Articles with public access mandates - Magnus WahlströmLearn more
Not available anywhere: 1
How to generate randomized roundings with dependencies and how to derandomize them
B Doerr, M Wahlström
Algorithm Engineering: Selected Results and Surveys, 159-184, 2016
Mandates: German Research Foundation
Available somewhere: 32
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
Mandates: US National Science Foundation, Netherlands Organisation for Scientific …
Calculation of discrepancy measures and applications
C Doerr, M Gnewuch, M Wahlström
A panorama of discrepancy theory, 621-678, 2014
Mandates: Australian Research Council, German Research Foundation
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
Mandates: European Commission
A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
M Gnewuch, M Wahlström, C Winzen
Preprint Math. Archive, 2011
Mandates: German Research Foundation
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
Mandates: European Commission
Hardness of discrepancy computation and ε-net verification in high dimension
P Giannopoulos, C Knauer, M Wahlström, D Werner
Journal of Complexity 28 (2), 162-176, 2012
Mandates: German Research Foundation
Randomized contractions meet lean decompositions
M Cygan, P Komosa, D Lokshtanov, M Pilipczuk, M Pilipczuk, S Saurabh, ...
ACM Transactions on Algorithms (TALG) 17 (1), 1-30, 2020
Mandates: US National Science Foundation, European Commission
On the workflow satisfiability problem with class-independent constraints for hierarchical organizations
J Crampton, A Gagarin, G Gutin, M Jones, M Wahlström
ACM Transactions on Privacy and Security (TOPS) 19 (3), 1-29, 2016
Mandates: UK Engineering and Physical Sciences Research Council
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
B Doerr, M Gnewuch, M Wahlström
Journal of Complexity 26 (5), 490-507, 2010
Mandates: German Research Foundation
Directed flow-augmentation
EJ Kim, S Kratsch, M Pilipczuk, M Wahlström
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
Mandates: European Commission, Agence Nationale de la Recherche
Solving hard cut problems via flow-augmentation
EJ Kim, S Kratsch, M Pilipczuk, M Wahlström
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
Mandates: European Commission, Agence Nationale de la Recherche
Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis
G Gutin, M Wahlström
Information Processing Letters 116 (3), 223-226, 2016
Mandates: UK Engineering and Physical Sciences Research Council
Polynomial kernels and user reductions for the workflow satisfiability problem
G Gutin, S Kratsch, M Wahlström
Algorithmica 75 (2), 383-402, 2016
Mandates: UK Engineering and Physical Sciences Research Council
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
G Gutin, F Reidl, M Wahlström, M Zehavi
Journal of Computer and System Sciences 95, 69-85, 2018
Mandates: UK Engineering and Physical Sciences Research Council, European Commission …
Randomized rounding in the presence of a cardinality constraint
B Doerr, M Wahlström
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and …, 2009
Mandates: German Research Foundation
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
EJ Kim, S Kratsch, M Pilipczuk, M Wahlström
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
Mandates: European Commission, Agence Nationale de la Recherche
Multi-budgeted directed cuts
S Kratsch, S Li, D Marx, M Pilipczuk, M Wahlström
Algorithmica 82, 2135-2155, 2020
Mandates: UK Engineering and Physical Sciences Research Council, European Commission
Kernelization of constraint satisfaction problems: A study through universal algebra
V Lagerkvist, M Wahlström
International Conference on Principles and Practice of Constraint …, 2017
Mandates: German Research Foundation
Parameterized complexity and kernelizability of max ones and exact ones problems
S Kratsch, D Marx, M Wahlström
ACM Transactions on Computation Theory (TOCT) 8 (1), 1-28, 2016
Mandates: Hungarian Academy of Sciences, Hungarian Scientific Research Fund, European …
Publication and funding information is determined automatically by a computer program