Stefan Szeider
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Stefan Szeider has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Anders Yeo
Department of Mathematics and Computer Science Department of Mathematics University of Southern Denmark University of Johannesburg
5 shared publications - Gregory Gutin
Department of Computer Science School of Math- ematical Sciences and LPMC Royal Holloway University of London Nankai University
5 shared publications - Arash Rafiey
Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK
3 shared publications - Barnaby Martin
Durham University, Durham, UK
1 shared publication - Georg Gottlob
University of Calabria
1 shared publication Graham Wrightson
School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan 2308 NSW, Australia
1 shared publication
Latest Publications
- 1 March 2011
- Published by Springer Nature in computational complexity
- Vol. 20 (1) , 51-85
Parameterized Proof Complexity
- 1 March 2011
- Published by Springer Nature in computational complexity
- Vol. 20 (1) , 51-85
Parameterized Proof Complexity
- 30 June 2010
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 8 (2)
Editorial
- 18 December 2008
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 42 (1) , 77-97
Backdoor Sets of Quantified Boolean Formulas
- 18 December 2008
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 42 (1) , 77-97
Backdoor Sets of Quantified Boolean Formulas
- Open Access
- 1 September 2008
- Published by SAGE Publications in Journal on Satisfiability, Boolean Modeling and Computation
- Vol. 6 (1-3) , 1-12
Matched Formulas and Backdoor Sets1
We demonstrate hardness results for the detection of small backdoor sets with respect to base classes M r of CNF formulas with maximum deficiency ⩽ r (M 0 is the class of matched formulas). One of the results applies also to a wide range of base clas
- 1 September 2008
- Published by SAGE Publications in Journal on Satisfiability, Boolean Modeling and Computation
- Vol. 6 (1-3) , 1-12
Open AccessMatched Formulas and Backdoor Sets1
We demonstrate hardness results for the detection of small backdoor sets with respect to base classes M r of CNF formulas with maximum deficiency ⩽ r (M 0 is the class of matched formulas). One of the results applies also to a wide range of base clas
- 14 December 2007
- Published by Springer Nature in Algorithmica
- Vol. 52 (2) , 133-152
Fixed-Parameter Complexity of Minimum Profile Problems
- 14 December 2007
- Published by Springer Nature in Algorithmica
- Vol. 52 (2) , 133-152
Fixed-Parameter Complexity of Minimum Profile Problems
- 1 October 2007
- Published by Springer Nature in Theory of Computing Systems
- Vol. 41 (3) , 521-538
The Linear Arrangement Problem Parameterized Above Guaranteed Value
- 1 October 2007
- Published by Springer Nature in Theory of Computing Systems
- Vol. 41 (3) , 521-538
The Linear Arrangement Problem Parameterized Above Guaranteed Value
- 5 September 2007
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 51 (3) , 303-325
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems
We survey the parameterized complexity of problems that arise in artificial intelligence, database theory and automated reasoning. In particular, we consider various parameterizations of the constraint satisfaction problem, the evaluation problem of Boolean conjunctive database queries and the propositional satisfiability problem. Furthermore, we survey parameterized algorithms for problems arising in the context of the stable model semantics of logic programs, for a number of other problems of non-monotonic reasoning, and for the computation of cores in data exchange.
- 5 September 2007
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 51 (3) , 303-325
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems
We survey the parameterized complexity of problems that arise in artificial intelligence, database theory and automated reasoning. In particular, we consider various parameterizations of the constraint satisfaction problem, the evaluation problem of Boolean conjunctive database queries and the propositional satisfiability problem. Furthermore, we survey parameterized algorithms for problems arising in the context of the stable model semantics of logic programs, for a number of other problems of non-monotonic reasoning, and for the computation of cores in data exchange.
- 3 September 2007
- Published by Springer Nature in Acta Informatica
- Vol. 44 (7-8) , 509-523
Solving #SAT using vertex covers
- 3 September 2007
- Published by Springer Nature in Acta Informatica
- Vol. 44 (7-8) , 509-523
Solving #SAT using vertex covers
- 10 August 2007
- Published by Springer Nature in Theory of Computing Systems
- Vol. 53 (4) , 690-691
Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value
- 10 August 2007
- Published by Springer Nature in Theory of Computing Systems
- Vol. 53 (4) , 690-691
Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value
- Open Access
A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth
We present an efficient fixed-parameter algorithm for #SAT parameterized by the incidence treewidth, i.e., the treewidth of the bipartite graph whose vertices are the variables and clauses of the given CNF formula; a variable and a clause are joined by an edge if and only if the variable occurs in the clause. Our algorithm runs in time O(4^k k l N), where k denotes the incidence treewidth, l denotes the size of a largest clause, and N denotes the number of nodes of the tree-decomposition.
Open AccessA Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth
We present an efficient fixed-parameter algorithm for #SAT parameterized by the incidence treewidth, i.e., the treewidth of the bipartite graph whose vertices are the variables and clauses of the given CNF formula; a variable and a clause are joined by an edge if and only if the variable occurs in the clause. Our algorithm runs in time O(4^k k l N), where k denotes the incidence treewidth, l denotes the size of a largest clause, and N denotes the number of nodes of the tree-decomposition.