Stefan Szeider

Solving MAX-r-SAT Above a Tight Lower Bound

Noga Alon, Gregory Gutin, Eun Jung Kim et al. · Algorithmica · 2010 · 125 citations

Engineering, Lower Bound, Sat Solving +4

Algorithms for propositional model counting

Marko Samer, Stefan Szeider · Journal of Discrete Algorithms · 2009 · 121 citations

Propositional Model Counting, Engineering, Automated Reasoning +6

On the complexity of some colorful problems parameterized by treewidth

Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov et al. · Information and Computation · 2010 · 118 citations

Mathematical Programming, Computational Complexity Theory, Engineering +10

Clique-Width is NP-Complete

Michael R. Fellows, Frances Rosamond, Udi Rotics et al. · SIAM Journal on Discrete Mathematics · 2009 · 113 citations

Engineering, Graph Theory, Graph Parameter +13

Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems

Georg Gottlob, Stefan Szeider · The Computer Journal · 2007 · 96 citations

Artificial Intelligence, Engineering, Evaluation Problem +16