10 papers:
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.
CHI-2011-HuotCD #named- TorusDesktop: pointing via the backdoor is sometimes shorter (SH, OC, PD), pp. 829–838.
- SAT-2009-DilkinaGS #learning
- Backdoors in the Context of Learning (BND, CPG, AS), pp. 73–79.
- SAT-2008-KottlerKS
- Computation of Renameable Horn Backdoors (SK, MK, CS), pp. 154–160.
- SAT-2008-KottlerKS08a #bound #np-hard #satisfiability #subclass #using
- A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors (SK, MK, CS), pp. 161–167.
- 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-2004-NishimuraRS #detection #set- Detecting Backdoor Sets with Respect to Horn and Binary Clauses (NN, PR, SS), pp. 96–103.
