108 results on '"Szeider, Stefan"'
Search Results
2. Chapter 17. Fixed-Parameter Tractability
3. Certified DQBF Solving by Definition Extraction
4. Finding the Hardest Formulas for Resolution
5. Computing Optimal Hypertree Decompositions
6. MaxSAT-Based Postprocessing for Treedepth
7. Short Q-Resolution Proofs with Homomorphisms
8. Formalizing Graph Trail Properties in Isabelle/HOL
9. A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
10. Breaking Symmetries with RootClique and LexTopSort
11. A Time Leap Challenge for SAT-Solving
12. Proof Complexity of Fragments of Long-Distance Q-Resolution
13. SAT-Encodings for Treecut Width and Treedepth
14. Combining Resolution-Path Dependencies with Dependency Learning
15. A Join-Based Hybrid Parameter for Constraint Satisfaction
16. Portfolio-Based Algorithm Selection for Circuit QBFs
17. Polynomial-Time Validation of QCDCL Certificates
18. Dependency Learning for QBF
19. Backdoor Treewidth for SAT
20. SAT-Based Local Improvement for Finding Tree Decompositions of Small Width
21. SAT-Encodings for Special Treewidth and Pathwidth
22. New Width Parameters for Model Counting
23. A SAT Approach to Branchwidth
24. Long Distance Q-Resolution with Dependency Schemes
25. Parameterized SAT
26. Backdoors to Tractable Valued CSP
27. Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP
28. Algorithmic Applications of Tree-Cut Width
29. Community Structure Inspired Algorithms for SAT and #SAT
30. Solving Problems on Graphs of High Rank-Width
31. Subexponential Time Complexity of CSP with Global Constraints
32. The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation
33. Fixed-Parameter Tractable Reductions to SAT
34. Variable Dependencies and Q-Resolution
35. Quantified Conjunctive Queries on Partially Ordered Sets
36. Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications
37. Model Counting for Formulas of Bounded Clique-Width
38. Meta-kernelization with Structural Parameters
39. The Parameterized Complexity of Constraint Satisfaction and Reasoning
40. Parameterized Complexity and Kernel Bounds for Hard Planning Problems
41. Upper and Lower Bounds for Weak Backdoor Set Detection
42. A SAT Approach to Clique-Width
43. Local Backbones
44. Revisiting Space in Proof Complexity: Treewidth and Pathwidth
45. The Added Value of Argumentation
46. Abstract Argumentation via Monadic Second Order Logic
47. Strong Backdoors to Nested Satisfiability
48. Backdoors to Acyclic SAT
49. Computing Resolution-Path Dependencies in Linear Time ,
50. k-Gap Interval Graphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.