Search the dblp DataBase
Magnus Wahlström :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Vilhelm Dahllöf , Peter Jonsson , Magnus Wahlström Counting Satisfying Assignments in 2-SAT and 3-SAT. [Citation Graph (0, 0)][DBLP ] COCOON, 2002, pp:535-543 [Conf ] Magnus Wahlström An Algorithm for the SAT Problem for Formulae of Linear Length. [Citation Graph (0, 0)][DBLP ] ESA, 2005, pp:107-118 [Conf ] Magnus Wahlström Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable. [Citation Graph (0, 0)][DBLP ] SAT, 2005, pp:309-323 [Conf ] Magnus Wahlström Exact algorithms for finding minimum transversals in rank-3 hypergraphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2004, v:51, n:2, pp:107-121 [Journal ] Vilhelm Dahllöf , Peter Jonsson , Magnus Wahlström Counting models for 2SAT and 3SAT formulae. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:332, n:1-3, pp:265-291 [Journal ] Randomized Rounding in the Presence of a Cardinality Constraint. [Citation Graph (, )][DBLP ] New Plain-Exponential Time Classes for Graph Homomorphism. [Citation Graph (, )][DBLP ] BBOB: Nelder-Mead with resize and halfruns. [Citation Graph (, )][DBLP ] Preprocessing of Min Ones Problems: A Dichotomy. [Citation Graph (, )][DBLP ] A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances. [Citation Graph (, )][DBLP ] Two Edge Modification Problems without Polynomial Kernels. [Citation Graph (, )][DBLP ] A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams. [Citation Graph (, )][DBLP ] Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. [Citation Graph (, )][DBLP ] Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. [Citation Graph (, )][DBLP ] Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. [Citation Graph (, )][DBLP ] Preprocessing of Min Ones Problems: A Dichotomy [Citation Graph (, )][DBLP ] Parameterized Two-Player Nash Equilibrium [Citation Graph (, )][DBLP ] Randomized Rounding for Routing and Covering Problems: Experiments and Improvements [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs