# Stefan Szeider

TU Wien

Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Editing graphs to satisfy degree constraints: A parameterized approach

- Luke Mathieson, Stefan Szeider
- Computer Science, Mathematics
- J. Comput. Syst. Sci.
- 2012

We study a wide class of graph editing problems that ask whether a given graph can be modified to satisfy certain degree constraints, using a limited number of vertex deletions, edge deletions, or… Expand

Algorithms for propositional model counting

- M. Samer, Stefan Szeider
- Computer Science, Mathematics
- J. Discrete Algorithms
- 1 March 2010

We present algorithms for the propositional model counting problem #SAT. The algorithms utilize tree decompositions of certain graphs associated with the given CNF formula; in particular we consider… Expand

Finding paths in graphs avoiding forbidden transitions

- Stefan Szeider
- Mathematics, Computer Science
- Discret. Appl. Math.
- 15 March 2003

Let v be a vertex of a graph G; a transition graph T(v) of v is a graph whose vertices are the edges incident with v. We consider graphs G with prescribed transition systems T = {T(v)|v ∈ V(G)}. A… Expand

Clique-Width is NP-Complete

- M. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
- Mathematics, Computer Science
- SIAM J. Discret. Math.
- 1 June 2009

Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard graph problems (e.g., problems expressible in monadic second-order logic with second-order… Expand

Detecting Backdoor Sets with Respect to Horn and Binary Clauses

- N. Nishimura, P. Ragde, Stefan Szeider
- Mathematics, Computer Science
- SAT
- 2004

We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes horn and 2-cnf. A… Expand

Backdoors to Satisfaction

- Serge Gaspers, Stefan Szeider
- Computer Science, Mathematics
- The Multivariate Algorithmic Revolution and…
- 28 October 2011

A backdoor set is a set of variables of a propositional formula such that fixing the truth values of the variables in the backdoor set moves the formula into some polynomial-time decidable class. If… Expand

Soundness of Q-resolution with dependency schemes

- Friedrich Slivovsky, Stefan Szeider
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 25 January 2016

Q-resolution and Q-term resolution are proof systems for quantified Boolean formulas (QBFs). We introduce generalizations of these proof systems named Q ( D ) -resolution and Q ( D ) -term… Expand

Backdoor Trees

- M. Samer, Stefan Szeider
- Computer Science
- AAAI
- 13 July 2008

The surprisingly good performance of modem satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. We introduce the notion of… Expand

Circuit Treewidth, Sentential Decision, and Query Compilation

- S. Bova, Stefan Szeider
- Mathematics, Computer Science
- PODS
- 17 January 2017

The evaluation of a query over a probabilistic database boils down to computing the probability of a suitable Boolean function, the lineage of the query over the database. The method of query… Expand

Solving MAX-r-SAT Above a Tight Lower Bound

- N. Alon, G. Gutin, E. Kim, Stefan Szeider, A. Yeo
- Computer Science, Mathematics
- SODA '10
- 27 July 2009

We present an exact algorithm that decides, for every fixed r≥2 in time $O(m)+2^{O(k^{2})}$ whether a given multiset of m clauses of size r admits a truth assignment that satisfies at least… Expand