| * | 2009 |
|---|
| 11 | EE | Benjamin Doerr,
Magnus Wahlström:
Randomized Rounding in the Presence of a Cardinality Constraint.
ALENEX 2009: 162-174 |
| 10 | EE | Magnus Wahlström:
New Plain-Exponential Time Classes for Graph Homomorphism.
CSR 2009: 346-355 |
| 9 | EE | Benjamin Doerr,
Mahmoud Fouz,
Martin Schmidt,
Magnus Wahlström:
BBOB: Nelder-Mead with resize and halfruns.
GECCO (Companion) 2009: 2239-2246 |
| 8 | EE | Daniel Johannsen,
Igor Razgon,
Magnus Wahlström:
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences.
SAT 2009: 80-85 |
| 7 | EE | Stefan Kratsch,
Magnus Wahlström:
Preprocessing of Min Ones Problems: A Dichotomy
CoRR abs/0910.4518: (2009) |
| 2008 |
|---|
| 6 | EE | Magnus Wahlström:
A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances.
IWPEC 2008: 202-213 |
| 2005 |
|---|
| 5 | EE | Magnus Wahlström:
An Algorithm for the SAT Problem for Formulae of Linear Length.
ESA 2005: 107-118 |
| 4 | EE | Magnus Wahlström:
Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable.
SAT 2005: 309-323 |
| 3 | EE | Vilhelm Dahllöf,
Peter Jonsson,
Magnus Wahlström:
Counting models for 2SAT and 3SAT formulae.
Theor. Comput. Sci. 332(1-3): 265-291 (2005) |
| 2004 |
|---|
| 2 | EE | Magnus Wahlström:
Exact algorithms for finding minimum transversals in rank-3 hypergraphs.
J. Algorithms 51(2): 107-121 (2004) |
| 2002 |
|---|
| 1 | EE | Vilhelm Dahllöf,
Peter Jonsson,
Magnus Wahlström:
Counting Satisfying Assignments in 2-SAT and 3-SAT.
COCOON 2002: 535-543 |
