BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × France
3 × United Kingdom
Collaborated with:
S.Kratsch ∅ M.Pilipczuk M.Pilipczuk D.Johannsen I.Razgon M.Cygan
Talks about:
variabl (2) formula (2) occurr (2) graph (2) solv (2) sat (2) one (2) preprocess (1) incompress (1) dichotomi (1)

Person: Magnus Wahlström

DBLP DBLP: Wahlstr=ouml=m:Magnus

Contributed to:

ICALP (1) 20122012
ICALP (1) 20102010
SAT 20092009
SAT 20052005

Wrote 5 papers:

ICALP-v1-2012-CyganKPPW #clique #graph
Clique Cover and Graph Separation: New Incompressibility Results (MC, SK, MP, MP, MW), pp. 254–265.
ICALP-v1-2012-KratschPPW #graph #multi #parametricity
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs (SK, MP, MP, MW), pp. 581–593.
ICALP-v1-2010-KratschW #preprocessor #problem
Preprocessing of Min Ones Problems: A Dichotomy (SK, MW), pp. 653–665.
SAT-2009-JohannsenRW #satisfiability #strict
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (DJ, IR, MW), pp. 80–85.
SAT-2005-Wahlstrom #performance #satisfiability
Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable (MW), pp. 309–323.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.