| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo |
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Stefan Szeider |
Strong Backdoors to Nested Satisfiability |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Stefan Szeider |
Strong Backdoors to Bounded Treewidth SAT |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran |
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Friedrich Slivovsky, Stefan Szeider |
Computing Resolution-Path Dependencies in Linear Time |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Sebastian Ordyniak, Stefan Szeider |
Algorithms and Complexity Results for Exact Bayesian Structure Learning |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang Dvorák, Sebastian Ordyniak, Stefan Szeider |
Augmenting tractable fragments of abstract argumentation. |
Artif. Intell. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos |
On graph contractions and induced minors. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Luke Mathieson, Stefan Szeider |
Editing graphs to satisfy degree constraints: A parameterized approach. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger |
k-Gap Interval Graphs. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Szeider |
The parameterized complexity of k-flip local search for SAT and MAX SAT. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Stefan Szeider |
The Parameterized Complexity of Local Consistency. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marko Samer, Stefan Szeider |
Tractable cases of the extended global cardinality constraint. |
Constraints |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo |
Solving MAX-r-SAT Above a Tight Lower Bound. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev, Barnaby Martin, Stefan Szeider |
Parameterized Proof Complexity. |
Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider |
Algorithms and Complexity Results for Persuasive Argumentation |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sebastian Ordyniak, Stefan Szeider |
Augmenting Tractable Fragments of Abstract Argumentation |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Johannes Klaus Fichte, Stefan Szeider |
Backdoors to Tractable Answer-Set Programming |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Stefan Szeider |
Limits of Preprocessing |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger |
k-Gap Interval Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Stefan Szeider |
Not So Easy Problems for Tree Decomposable Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Stefan Szeider |
Backdoors to Satisfaction |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Stefan Szeider |
Backdoors to Acyclic SAT |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider |
Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II) |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Stefan Szeider |
Kernels for Global Constraints |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo |
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider |
Algorithms and complexity results for persuasive argumentation. |
Artif. Intell. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo |
A probabilistic approach to problems parameterized above or below tight bounds. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Szeider |
Monadic second order logic on graphs with local cardinality constraints. |
ACM Trans. Comput. Log. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Stefan Szeider |
Kernels for Global Constraints. |
IJCAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Johannes Klaus Fichte, Stefan Szeider |
Backdoors to Tractable Answer-Set Programming. |
IJCAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sebastian Ordyniak, Stefan Szeider |
Augmenting Tractable Fragments of Abstract Argumentation. |
IJCAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider |
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Szeider |
Limits of Preprocessing. |
AAAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Stefan Szeider |
The Parameterized Complexity of Local Consistency. |
CP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marko Samer, Stefan Szeider |
Constraint satisfaction with bounded treewidth revisited. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marko Samer, Stefan Szeider |
Algorithms for propositional model counting. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider |
Editorial. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo |
Solving MAX-r-SAT Above a Tight Lower Bound. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ofer Strichman, Stefan Szeider (eds.) |
Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo |
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. |
IPEC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran |
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. |
KR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sebastian Ordyniak, Stefan Szeider |
Algorithms and Complexity Results for Exact Bayesian Structure Learning. |
UAI |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos |
On Contracting Graphs to Fixed Pattern Graphs. |
SOFSEM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider |
Satisfiability of Acyclic and Almost Acyclic CNF Formulas. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider |
Algorithms and Complexity Results for Persuasive Argumentation. |
COMMA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Dvorák, Stefan Szeider, Stefan Woltran |
Reasoning in Argumentation Frameworks of Bounded Clique-Width. |
COMMA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider |
Covering graphs with few complete bipartite subgraphs. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Szeider |
Matched Formulas and Backdoor Sets. |
JSAT |
2009 |
DBLP BibTeX RDF |
|
| 1 | Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo |
A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo |
Solving MAX-2-SAT Above a Tight Lower Bound |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Marko Samer, Stefan Szeider |
Backdoor Sets of Quantified Boolean Formulas. |
J. Autom. Reasoning |
2009 |
DBLP DOI BibTeX RDF |
Backdoor sets, Variable dependencies, Parameterized complexity, Quantified Boolean formulas |
| 1 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Clique-Width is NP-Complete. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider |
Editorial. |
J. Discrete Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Marko Samer, Stefan Szeider |
Fixed-Parameter Tractability. |
Handbook of Satisfiability |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Szeider |
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo |
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Gutin, Stefan Szeider, Anders Yeo |
Fixed-Parameter Complexity of Minimum Profile Problems. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Graph profile, Above guaranteed value, Kernel, Fixed parameter tractability |
| 1 | Georg Gottlob, Stefan Szeider |
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems. |
Comput. J. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider |
Preface. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Szeider |
Parameterized SAT. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Szeider |
Monadic Second Order Logic on Graphs with Local Cardinality Constraints. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Luke Mathieson, Stefan Szeider |
The Parameterized Complexity of Regular Subgraph Problems and Generalizations. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Marko Samer, Stefan Szeider |
Tractable Cases of the Extended Global Cardinality Constraint. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Luke Mathieson, Stefan Szeider |
Parameterized Graph Editing with Chosen Vertex Degrees. |
COCOA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Marko Samer, Stefan Szeider |
Backdoor Trees. |
AAAI |
2008 |
DBLP BibTeX RDF |
|
| 1 | Stefan S. Dantchev, Barnaby Martin, Stefan Szeider |
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
Solving #SAT using vertex covers. |
Acta Inf. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo |
The Linear Arrangement Problem Parameterized Above Guaranteed Value. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Marko Samer, Stefan Szeider |
Algorithms for Propositional Model Counting. |
LPAR |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Szeider |
Matched Formulas and Backdoor Sets. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Marko Samer, Stefan Szeider |
Backdoor Sets of Quantified Boolean Formulas. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
COCOA |
2007 |
DBLP DOI BibTeX RDF |
Topics Parameterized Complexity, Graph Coloring, Bounded Treewidth |
| 1 | Stefan S. Dantchev, Barnaby Martin, Stefan Szeider |
Parameterized Proof Complexity. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider |
Covering Graphs with Few Complete Bipartite Subgraphs. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Stefan Szeider, Graham Wrightson |
On finding short resolution refutations and small unsatisfiable subsets. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Marko Samer, Stefan Szeider |
A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Marko Samer, Stefan Szeider |
Complexity and Applications of Edge-Induced Vertex-Cuts |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Gregory Gutin, Stefan Szeider, Anders Yeo |
Fixed-Parameter Complexity of Minimum Profile Problems |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Shlomo Hoory, Stefan Szeider |
A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable. |
SIAM J. Discrete Math. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider (eds.) |
Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK |
ACiD |
2006 |
DBLP BibTeX RDF |
|
| 1 | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
Solving #SAT Using Vertex Covers. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Gutin, Stefan Szeider, Anders Yeo |
Fixed-Parameter Complexity of Minimum Profile Problems. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Clique-width minimization is NP-hard. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
absolute approximation, NP-completeness, clique-width, pathwidth |
| 1 | Marko Samer, Stefan Szeider |
Constraint Satisfaction with Bounded Treewidth Revisited. |
CP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo |
The Linear Arrangement Problem Parameterized Above Guaranteed Value. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Proving NP-hardness for clique-width II: non-approximability of clique-width |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Shlomo Hoory, Stefan Szeider |
Computing unsatisfiable k-SAT instances with few occurrences per variable. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Herbert Fleischner, Stefan Szeider |
On Edge-Colored Graphs Covered by Properly Colored Cycles. |
Graphs and Combinatorics |
2005 |
DBLP DOI BibTeX RDF |
Properly colored cycles, 1-Extendable graphs, Cycle covers, Edge-colored graphs |
| 1 | Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo |
The Linear Arrangement Problem Parameterized Above Guaranteed Value |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Stefan Szeider |
Backdoor Sets for DLL Subsolvers. |
J. Autom. Reasoning |
2005 |
DBLP DOI BibTeX RDF |
unit propagation, pure literal elimination, backdoor sets, W[P]-completeness, satisfiability, parameterized complexity |
| 1 | Stefan Szeider |
The Complexity of Resolution with Generalized Symmetry Rules. |
Theory Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Szeider |
Generalizations of matched CNF formulas. |
Ann. Math. Artif. Intell. |
2005 |
DBLP DOI BibTeX RDF |
matched formula, deficiency, biclique cover, P 2 -completeness, NP-completeness, bipartite graph, polynomial hierarchy, SAT problem |
| 1 | Hajo Broersma, Matthew Johnson 0002, Stefan Szeider (eds.) |
Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK |
ACiD |
2005 |
DBLP BibTeX RDF |
|
| 1 | Stefan Szeider |
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Szeider |
On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors. |
Ars Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
Detecting Backdoor Sets with Respect to Horn and Binary Clauses. |
SAT |
2004 |
DBLP BibTeX RDF |
|
| 1 | Shlomo Hoory, Stefan Szeider |
Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. |
SAT |
2004 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")