• Publications
  • Influence
Editing graphs to satisfy degree constraints: A parameterized approach
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, orExpand
  • 57
  • 16
Open Access
Algorithms for propositional model counting
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 considerExpand
  • 106
  • 13
Open Access
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)}. AExpand
  • 66
  • 13
Open Access
Clique-Width is NP-Complete
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-orderExpand
  • 103
  • 9
Open Access
Detecting Backdoor Sets with Respect to Horn and Binary Clauses
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. AExpand
  • 84
  • 8
Backdoors to Satisfaction
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. IfExpand
  • 74
  • 8
Open Access
Soundness of Q-resolution with dependency schemes
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 ) -termExpand
  • 28
  • 8
Open Access
Backdoor Trees
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 ofExpand
  • 26
  • 7
Open Access
Circuit Treewidth, Sentential Decision, and Query Compilation
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 queryExpand
  • 18
  • 7
Open Access
Solving MAX-r-SAT Above a Tight Lower Bound
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 leastExpand
  • 116
  • 6
Open Access