#### Filter Results:

- Full text PDF available (64)

#### Publication Year

2000

2019

- This year (17)
- Last 5 years (75)
- Last 10 years (154)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
- Algorithmica
- 2009

We present an exact algorithm that decides, for every fixed <i>r</i> ≥ 2 in time <i>O(m) + 2<sup>O(k2</sup>)</i> whether a given set of <i>m</i> clauses of size <i>r</i> admits a truth assignment… (More)

- Luke Mathieson, Stefan Szeider
- 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… (More)

- Marko Samer, Stefan Szeider
- Journal of Automated Reasoning
- 2008

We generalize the notion of backdoor sets from propositional formulas to quantified Boolean formulas (QBF). This allows us to obtain hierarchies of tractable classes of quantified Boolean formulas… (More)

- Stefan Szeider
- Discrete Applied Mathematics
- 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… (More)

- Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider
- FSTTCS
- 2007

Given a graph and an integer k, the biclique cover problem asks whether the edge-set of the given graph can be covered with at most k bicliques (complete bipartite subgraphs); the biclique… (More)

- Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
- 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… (More)

- Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
- SIAM J. Discrete Math.
- 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… (More)

- Marko Samer, Stefan Szeider
- J. Discrete Algorithms
- 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… (More)

- Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
- computational complexity
- 2010

We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given propositional formula… (More)

- Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
- IWPEC
- 2009

We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds. To illustrate the approach we consider three problems of this type of… (More)