| |
| 2009 | ||
|---|---|---|
| 7 | EE | Benjamin Doerr, Magnus Wahlström: Randomized Rounding in the Presence of a Cardinality Constraint. ALENEX 2009: 162-174 |
| 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 |
| 1 | Vilhelm Dahllöf | [1] [3] |
| 2 | Benjamin Doerr | [7] |
| 3 | Peter Jonsson | [1] [3] |