Search the dblp DataBase
Stefan Szeider :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Stefan Szeider NP-Completeness of Refutability by Literal-Once Resolution. [Citation Graph (0, 0)][DBLP ] IJCAR, 2001, pp:168-181 [Conf ] Gregory Gutin , Arash Rafiey , Stefan Szeider , Anders Yeo The Linear Arrangement Problem Parameterized Above Guaranteed Value. [Citation Graph (0, 0)][DBLP ] CIAC, 2006, pp:356-367 [Conf ] Stefan Szeider Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:548-558 [Conf ] Marko Samer , Stefan Szeider Constraint Satisfaction with Bounded Treewidth Revisited. [Citation Graph (0, 0)][DBLP ] CP, 2006, pp:499-513 [Conf ] Michael R. Fellows , Stefan Szeider , Graham Wrightson On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. [Citation Graph (0, 0)][DBLP ] IWPEC, 2004, pp:223-234 [Conf ] Gregory Gutin , Stefan Szeider , Anders Yeo Fixed-Parameter Complexity of Minimum Profile Problems. [Citation Graph (0, 0)][DBLP ] IWPEC, 2006, pp:60-71 [Conf ] Naomi Nishimura , Prabhakar Ragde , Stefan Szeider Detecting Backdoor Sets with Respect to Horn and Binary Clauses. [Citation Graph (0, 0)][DBLP ] SAT, 2004, pp:- [Conf ] Naomi Nishimura , Prabhakar Ragde , Stefan Szeider Solving #SAT Using Vertex Covers. [Citation Graph (0, 0)][DBLP ] SAT, 2006, pp:396-409 [Conf ] Shlomo Hoory , Stefan Szeider Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. [Citation Graph (0, 0)][DBLP ] SAT, 2004, pp:- [Conf ] Stefan Szeider On Fixed-Parameter Tractable Parameterizations of SAT. [Citation Graph (0, 0)][DBLP ] SAT, 2003, pp:188-202 [Conf ] Stefan Szeider The Complexity of Resolution with Generalized Symmetry Rules. [Citation Graph (0, 0)][DBLP ] STACS, 2003, pp:475-486 [Conf ] Michael R. Fellows , Frances A. Rosamond , Udi Rotics , Stefan Szeider Clique-width minimization is NP-hard. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:354-362 [Conf ] Stefan Szeider Generalizations of matched CNF formulas. [Citation Graph (0, 0)][DBLP ] Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:223-238 [Journal ] Stefan Szeider On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors. [Citation Graph (0, 0)][DBLP ] Ars Comb., 2004, v:73, n:, pp:- [Journal ] Stefan Szeider Homomorphisms of conjunctive normal forms. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:130, n:2, pp:351-365 [Journal ] Stefan Szeider Finding paths in graphs avoiding forbidden transitions. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:261-273 [Journal ] Herbert Fleischner , Stefan Szeider Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:49, pp:- [Journal ] Stefan Szeider Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:002, pp:- [Journal ] Michael R. Fellows , Frances A. Rosamond , Udi Rotics , Stefan Szeider Proving NP-hardness for clique-width I: non-approximability of sequential clique-width [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:080, pp:- [Journal ] Michael R. Fellows , Frances A. Rosamond , Udi Rotics , Stefan Szeider Proving NP-hardness for clique-width II: non-approximability of clique-width [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:081, pp:- [Journal ] Herbert Fleischner , Stefan Szeider On Edge-Colored Graphs Covered by Properly Colored Cycles. [Citation Graph (0, 0)][DBLP ] Graphs and Combinatorics, 2005, v:21, n:3, pp:301-306 [Journal ] Stefan Szeider Backdoor Sets for DLL Subsolvers. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 2005, v:35, n:1-3, pp:73-88 [Journal ] Stefan Szeider Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2004, v:69, n:4, pp:656-674 [Journal ] Stefan Szeider The Complexity of Resolution with Generalized Symmetry Rules. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2005, v:38, n:2, pp:171-188 [Journal ] Michael R. Fellows , Stefan Szeider , Graham Wrightson On finding short resolution refutations and small unsatisfiable subsets. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:351, n:3, pp:351-359 [Journal ] Herbert Fleischner , Oliver Kullmann , Stefan Szeider Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:289, n:1, pp:503-516 [Journal ] Shlomo Hoory , Stefan Szeider Computing unsatisfiable k-SAT instances with few occurrences per variable. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:337, n:1-3, pp:347-359 [Journal ] Marko Samer , Stefan Szeider Algorithms for Propositional Model Counting. [Citation Graph (0, 0)][DBLP ] LPAR, 2007, pp:484-498 [Conf ] Stefan Szeider Matched Formulas and Backdoor Sets. [Citation Graph (0, 0)][DBLP ] SAT, 2007, pp:94-99 [Conf ] Marko Samer , Stefan Szeider Backdoor Sets of Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP ] SAT, 2007, pp:230-243 [Conf ] Michael R. Fellows , Fedor V. Fomin , Daniel Lokshtanov , Frances A. Rosamond , Saket Saurabh , Stefan Szeider , Carsten Thomassen On the Complexity of Some Colorful Problems Parameterized by Treewidth. [Citation Graph (0, 0)][DBLP ] COCOA, 2007, pp:366-377 [Conf ] Marko Samer , Stefan Szeider A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Gregory Gutin , Stefan Szeider , Anders Yeo Fixed-Parameter Complexity of Minimum Profile Problems [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Marko Samer , Stefan Szeider Complexity and Applications of Edge-Induced Vertex-Cuts [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Backdoor Trees. [Citation Graph (, )][DBLP ] Tractable Cases of the Extended Global Cardinality Constraint. [Citation Graph (, )][DBLP ] The Parameterized Complexity of Regular Subgraph Problems and Generalizations. [Citation Graph (, )][DBLP ] Parameterized Proof Complexity. [Citation Graph (, )][DBLP ] Covering Graphs with Few Complete Bipartite Subgraphs. [Citation Graph (, )][DBLP ] A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. [Citation Graph (, )][DBLP ] Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. [Citation Graph (, )][DBLP ] Monadic Second Order Logic on Graphs with Local Cardinality Constraints. [Citation Graph (, )][DBLP ] The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT. [Citation Graph (, )][DBLP ] Solving MAX-r-SAT Above a Tight Lower Bound. [Citation Graph (, )][DBLP ] On Contracting Graphs to Fixed Pattern Graphs. [Citation Graph (, )][DBLP ] Parameterized Graph Editing with Chosen Vertex Degrees. [Citation Graph (, )][DBLP ] Solving #SAT using vertex covers. [Citation Graph (, )][DBLP ] Fixed-Parameter Complexity of Minimum Profile Problems. [Citation Graph (, )][DBLP ] Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems. [Citation Graph (, )][DBLP ] The Linear Arrangement Problem Parameterized Above Guaranteed Value [Citation Graph (, )][DBLP ] A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound [Citation Graph (, )][DBLP ] Solving MAX-2-SAT Above a Tight Lower Bound [Citation Graph (, )][DBLP ] Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution. [Citation Graph (, )][DBLP ] Search in 0.029secs, Finished in 0.030secs