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 × Finland
1 × Portugal
2 × Canada
2 × United Kingdom
3 × Austria
3 × Italy
5 × USA
Collaborated with:
∅ R.d.Haan F.Slivovsky S.Gaspers R.Ganian N.Nishimura P.Ragde S.Ordyniak M.Heule M.Samer S.Hoory S.Bova I.A.Kanj D.Paulusma N.Misra V.Raman R.Pichler S.Rümmele S.Woltran M.R.Fellows F.A.Rosamond U.Rotics
Talks about:
sat (10) backdoor (6) set (6) formula (4) parameter (3) tractabl (3) resolut (3) acycl (3) variabl (2) satisfi (2)

Person: Stefan Szeider

DBLP DBLP: Szeider:Stefan

Facilitated 1 volumes:

SAT 2010Ed

Contributed to:

SAT 20152015
KR 20142014
CSL-LICS 20142014
SAT 20142014
SAT 20132013
ICALP (1) 20122012
SAT 20122012
SAT 20112011
KR 20102010
SAT 20092009
SAT 20072007
SAT 20062006
STOC 20062006
SAT 20042004
SAT 20032003
SAT 20022002
IJCAR 20012001

Wrote 23 papers:

SAT-2015-GanianS #algorithm #community #satisfiability
Community Structure Inspired Algorithms for SAT and #SAT (RG, SS), pp. 223–237.
KR-2014-HaanS #complexity #problem #reasoning
The Parameterized Complexity of Reasoning Problems Beyond NP (RdH, SS).
LICS-CSL-2014-BovaGS #logic #model checking #order #set
Model checking existential logic on partially ordered sets (SB, RG, SS), p. 10.
SAT-2014-HaanS #parametricity #reduction #satisfiability
Fixed-Parameter Tractable Reductions to SAT (RdH, SS), pp. 85–102.
SAT-2014-SlivovskyS #dependence
Variable Dependencies and Q-Resolution (FS, SS), pp. 269–284.
SAT-2013-HaanKS
Local Backbones (RdH, IAK, SS), pp. 377–393.
SAT-2013-HeuleS #approach #clique #satisfiability
A SAT Approach to Clique-Width (MH, SS), pp. 318–334.
SAT-2013-MisraORS #bound #detection #set
Upper and Lower Bounds for Weak Backdoor Set Detection (NM, SO, VR, SS), pp. 394–402.
ICALP-v1-2012-GaspersS #satisfiability
Backdoors to Acyclic SAT (SG, SS), pp. 363–374.
SAT-2012-GaspersS #satisfiability
Strong Backdoors to Nested Satisfiability (SG, SS), pp. 72–85.
SAT-2012-SlivovskyS #dependence #linear
Computing Resolution-Path Dependencies in Linear Time , (FS, SS), pp. 58–71.
SAT-2011-OrdyniakPS #satisfiability
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (SO, DP, SS), pp. 47–60.
KR-2010-PichlerRSW #bound #constraints #programming
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough (RP, SR, SS, SW).
SAT-2009-Szeider #complexity #satisfiability
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (SS), pp. 276–283.
SAT-2007-SamerS #quantifier #set
Backdoor Sets of Quantified Boolean Formulas (MS, SS), pp. 230–243.
SAT-2007-Szeider #set
Matched Formulas and Backdoor Sets (SS), pp. 94–99.
SAT-2006-NishimuraRS #satisfiability #using
Solving #SAT Using Vertex Covers (NN, PR, SS), pp. 396–409.
STOC-2006-FellowsRRS #clique #np-hard
Clique-width minimization is NP-hard (MRF, FAR, UR, SS), pp. 354–362.
SAT-2004-HooryS #satisfiability
Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable (SH, SS), pp. 86–95.
SAT-2004-NishimuraRS #detection #set
Detecting Backdoor Sets with Respect to Horn and Binary Clauses (NN, PR, SS), pp. 96–103.
SAT-2003-Szeider #on the #parametricity #satisfiability
On Fixed-Parameter Tractable Parameterizations of SAT (SS), pp. 188–202.
SAT-2002-Szeider
Generalizations of matched CNF formulas (SS), p. 7.
IJCAR-2001-Szeider
NP-Completeness of Refutability by Literal-Once Resolution (SS), pp. 168–181.
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.