The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Magnus Wahlström: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]

  6. Randomized Rounding in the Presence of a Cardinality Constraint. [Citation Graph (, )][DBLP]


  7. New Plain-Exponential Time Classes for Graph Homomorphism. [Citation Graph (, )][DBLP]


  8. BBOB: Nelder-Mead with resize and halfruns. [Citation Graph (, )][DBLP]


  9. Preprocessing of Min Ones Problems: A Dichotomy. [Citation Graph (, )][DBLP]


  10. A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances. [Citation Graph (, )][DBLP]


  11. Two Edge Modification Problems without Polynomial Kernels. [Citation Graph (, )][DBLP]


  12. A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams. [Citation Graph (, )][DBLP]


  13. Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. [Citation Graph (, )][DBLP]


  14. Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences. [Citation Graph (, )][DBLP]


  15. Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. [Citation Graph (, )][DBLP]


  16. Preprocessing of Min Ones Problems: A Dichotomy [Citation Graph (, )][DBLP]


  17. Parameterized Two-Player Nash Equilibrium [Citation Graph (, )][DBLP]


  18. Randomized Rounding for Routing and Covering Problems: Experiments and Improvements [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002