Travelled to:1 × Finland
1 × USA
Collaborated with:S.Szeider D.Paulusma N.Misra V.Raman
Talks about:acycl (2) backdoor (1) satisfi (1) formula (1) detect (1) almost (1) upper (1) lower (1) bound (1) weak (1)
Person: Sebastian Ordyniak
DBLP: Ordyniak:Sebastian
Contributed to:
20132011Wrote 2 papers:
- SAT-2013-MisraORS #bound #detection #set
- Upper and Lower Bounds for Weak Backdoor Set Detection (NM, SO, VR, SS), pp. 394–402.
- SAT-2011-OrdyniakPS #satisfiability
- Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (SO, DP, SS), pp. 47–60.