People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Reveal
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
Friedrich Slivovsky
,
Stefan Szeider
PDF
Cite
Project
Project
Project
A Time Leap Challenge for SAT-Solving
Johannes K. Fichte
,
Markus Hecher
,
Stefan Szeider
Cite
Project
Project
Breaking Symmetries with RootClique and LexTopsort
Johannes K. Fichte
,
Markus Hecher
,
Stefan Szeider
PDF
Cite
Project
Project
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters
Robert Ganian
PDF
Cite
Project
Project
Project
Project
Formalizing Graph Trail Properties in Isabelle/HOL
Stefan Szeider
PDF
Cite
Project
Project
MaxSAT-Based Postprocessing for Treedepth
Vaidyanathan Peruvemba Ramaswamy
,
Stefan Szeider
PDF
Cite
Project
Project
DOI
Short Q-Resolution Proofs with Homomorphisms
Ankit Shukla
,
Friedrich Slivovsky
,
Stefan Szeider
PDF
Cite
Project
Project
Project
«
Cite
×