Stefan Szeider
Stefan Szeider
Professor, Head of Algorithms and Complexity Group, TU Wien, Vienna, Austria
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
Algorithms for propositional model counting
M Samer, S Szeider
Journal of Discrete Algorithms 8 (1), 50-64, 2010
Clique-width is NP-complete
MR Fellows, FA Rosamond, U Rotics, S Szeider
SIAM Journal on Discrete Mathematics 23 (2), 909-939, 2009
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
H Fleischner, O Kullmann, S Szeider
Theoretical Computer Science 289 (1), 503-516, 2002
Solving MAX-r-SAT above a tight lower bound
N Alon, G Gutin, EJ Kim, S Szeider, A Yeo
Algorithmica 61 (3), 638-655, 2011
On fixed-parameter tractable parameterizations of SAT
S Szeider
International Conference on Theory and Applications of Satisfiability …, 2003
On the complexity of some colorful problems parameterized by treewidth
MR Fellows, FV Fomin, D Lokshtanov, F Rosamond, S Saurabh, ...
Information and Computation 209 (2), 143-153, 2011
Backdoor sets of quantified Boolean formulas
M Samer, S Szeider
Journal of Automated Reasoning 42 (1), 77-97, 2009
Finding paths in graphs avoiding forbidden transitions
S Szeider
Discrete Applied Mathematics 126 (2-3), 261-273, 2003
Detecting Backdoor Sets with Respect to Horn and Binary Clauses.
N Nishimura, P Ragde, S Szeider
SAT 4, 96-103, 2004
Fixed-parameter algorithms for artificial intelligence, constraint satisfaction and database problems
G Gottlob, S Szeider
The Computer Journal 51 (3), 303-325, 2008
Constraint satisfaction with bounded treewidth revisited
M Samer, S Szeider
Journal of Computer and System Sciences 76 (2), 103-114, 2010
Backdoors to satisfaction
S Gaspers, S Szeider
The Multivariate Algorithmic Revolution and Beyond, 287-317, 2012
The added value of argumentation
S Modgil, F Toni, F Bex, I Bratko, CI Chesnevar, W Dvořák, MA Falappa, ...
Agreement technologies, 357-403, 2013
Clique-width minimization is NP-hard
MR Fellows, FA Rosamond, U Rotics, S Szeider
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
Covering graphs with few complete bipartite subgraphs
H Fleischner, E Mujuni, D Paulusma, S Szeider
Theoretical Computer Science 410 (21-23), 2045-2053, 2009
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
S Szeider
Journal of Computer and System Sciences 69 (4), 656-674, 2004
Augmenting tractable fragments of abstract argumentation
W Dvořák, S Ordyniak, S Szeider
Artificial Intelligence 186, 157-173, 2012
Satisfiability of acyclic and almost acyclic CNF formulas
S Ordyniak, D Paulusma, S Szeider
Theoretical Computer Science 481, 85-99, 2013
The linear arrangement problem parameterized above guaranteed value
G Gutin, A Rafiey, S Szeider, A Yeo
Theory of Computing Systems 41 (3), 521-538, 2007
Editing graphs to satisfy degree constraints: A parameterized approach
L Mathieson, S Szeider
Journal of Computer and System Sciences 78 (1), 179-191, 2012
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20