The following pages link to Stefan Szeider (Q261393):
Displaying 50 items.
- Backdoors to q-Horn (Q261394) (← links)
- Quantifier reordering for QBF (Q287386) (← links)
- Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value'' (Q385510) (← links)
- Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
- On graph contractions and induced minors (Q415282) (← links)
- Parameterized proof complexity (Q451111) (← links)
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- On finding optimal polytrees (Q500966) (← links)
- Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable (Q557836) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- A probabilistic approach to problems parameterized above or below tight bounds (Q632807) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- Algorithms and complexity results for persuasive argumentation (Q646518) (← links)
- Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
- Backdoor sets for DLL subsolvers (Q862400) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
- Soundness of \(\mathcal{Q}\)-resolution with dependency schemes (Q896919) (← links)
- Fixed-parameter complexity of minimum profile problems (Q958202) (← links)
- Covering graphs with few complete bipartite subgraphs (Q1019181) (← links)
- Backdoor sets of quantified Boolean formulas (Q1040783) (← links)
- Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
- Polynomial-time validation of QCDCL certificates (Q1656583) (← links)
- Backdoor treewidth for SAT (Q1680239) (← links)
- New width parameters for model counting (Q1680240) (← links)
- Dependency learning for QBF (Q1680261) (← links)
- SAT-based local improvement for finding tree decompositions of small width (Q1680268) (← links)
- SAT-encodings for special treewidth and pathwidth (Q1680270) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- On the parameterized complexity of \((k,s)\)-SAT (Q1711421) (← links)
- Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming (Q1759676) (← links)
- Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- The complexity of resolution with generalized symmetry rules (Q1771316) (← links)
- Generalizations of matched CNF formulas (Q1777405) (← links)
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) (← links)
- Finding paths in graphs avoiding forbidden transitions (Q1861577) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Certified DQBF solving by definition extraction (Q2118343) (← links)
- Combining resolution-path dependencies with dependency learning (Q2181941) (← links)
- Proof complexity of fragments of long-distance Q-resolution (Q2181942) (← links)
- Induction with generalization in superposition reasoning (Q2219385) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- Algorithms for propositional model counting (Q2266937) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
