Stefan Szeider

Agata Ciabattoni, Rusins Freivalds, Antonín Kucera, Igor Potapov, Stefan Szeider: Preface. Fundam. Inform. 123(1) (2013)

Sebastian Ordyniak, Stefan Szeider: Parameterized Complexity Results for Exact Bayesian Network Structure Learning. J. Artif. Intell. Res. (JAIR) 46: 263-302 (2013)

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider: Satisfiability of acyclic and almost acyclic CNF formulas. Theor. Comput. Sci. 481: 85-99 (2013)

Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider: Model Counting for CNF Formulas of Bounded Modular Treewidth. STACS 2013: 55-66

Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider: Backdoors to q-Horn. STACS 2013: 67-79

Johannes Klaus Fichte, Stefan Szeider: Backdoors to Normality for Disjunctive Logic Programs. CoRR abs/1301.1391 (2013)

Robert Ganian, Friedrich Slivovsky, Stefan Szeider: Meta-Kernelization with Structural Parameters. CoRR abs/1303.1786 (2013)

Iyad A. Kanj, Stefan Szeider: On the Subexponential Time Complexity of CSP. CoRR abs/1304.1996 (2013)

Ronald de Haan, Iyad A. Kanj, Stefan Szeider: Local Backbones. CoRR abs/1304.5479 (2013)

Marijn Heule, Stefan Szeider: A SAT Approach to Clique-Width. CoRR abs/1304.5498 (2013)

Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider: Upper and Lower Bounds for Weak Backdoor Set Detection. CoRR abs/1304.5518 (2013)

Andreas Pfandler, Stefan Rümmele, Stefan Szeider: Backdoors to Abduction. CoRR abs/1304.5961 (2013)

Wolfgang Dvorák, Sebastian Ordyniak, Stefan Szeider: Augmenting tractable fragments of abstract argumentation. Artif. Intell. 186: 157-173 (2012)

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 64(1): 112-125 (2012)

Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos: On graph contractions and induced minors. Discrete Applied Mathematics 160(6): 799-809 (2012)

Luke Mathieson, Stefan Szeider: Editing graphs to satisfy degree constraints: A parameterized approach. J. Comput. Syst. Sci. 78(1): 179-191 (2012)

Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider: The Complexity of Planning Revisited - A Parameterized Analysis. AAAI 2012

Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider: On Finding Optimal Polytrees. AAAI 2012

Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider: Don't Be Strict in Local Search! AAAI 2012

Serge Gaspers, Stefan Szeider: Backdoors to Satisfaction. The Multivariate Algorithmic Revolution and Beyond 2012: 287-317

Serge Gaspers, Stefan Szeider: Backdoors to Acyclic SAT. ICALP (1) 2012: 363-374

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: 350-361

Friedrich Slivovsky, Stefan Szeider: Computing Resolution-Path Dependencies in Linear Time , . SAT 2012: 58-71

Serge Gaspers, Stefan Szeider: Strong Backdoors to Nested Satisfiability. SAT 2012: 72-85

Wolfgang Dvorák, Stefan Szeider, Stefan Woltran: Abstract Argumentation via Monadic Second Order Logic. SUM 2012: 85-98

Bart Verheij, Stefan Szeider, Stefan Woltran (Eds.): Computational Models of Argument - Proceedings of COMMA 2012, Vienna, Austria, September 10-12, 2012. Frontiers in Artificial Intelligence and Applications 245, IOS Press 2012, isbn 978-1-61499-110-6

Friedrich Slivovsky, Stefan Szeider: Computing Resolution-Path Dependencies in Linear Time. CoRR abs/1202.3097 (2012)

Serge Gaspers, Stefan Szeider: Strong Backdoors to Nested Satisfiability. CoRR abs/1202.4331 (2012)

Sebastian Ordyniak, Stefan Szeider: Algorithms and Complexity Results for Exact Bayesian Structure Learning. CoRR abs/1203.3501 (2012)

Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran: Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. CoRR abs/1204.3040 (2012)

Serge Gaspers, Stefan Szeider: Strong Backdoors to Bounded Treewidth SAT. CoRR abs/1204.6233 (2012)

Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider: Don't Be Strict in Local Search! CoRR abs/1208.1688 (2012)

Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider: On Finding Optimal Polytrees. CoRR abs/1208.1692 (2012)

Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider: The Complexity of Planning Revisited - A Parameterized Analysis. CoRR abs/1208.2566 (2012)

Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider: Parameterized Complexity and Kernel Bounds for Hard Planning Problems. CoRR abs/1211.0479 (2012)

Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider: Algorithms and complexity results for persuasive argumentation. Artif. Intell. 175(9-10): 1722-1736 (2011)

Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: Solving MAX-r-SAT Above a Tight Lower Bound. Algorithmica 61(3): 638-655 (2011)

Stefan S. Dantchev, Barnaby Martin, Stefan Szeider: Parameterized Proof Complexity. Computational Complexity 20(1): 51-85 (2011)

Marko Samer, Stefan Szeider: Tractable cases of the extended global cardinality constraint. Constraints 16(1): 1-24 (2011)

Stefan Szeider: The parameterized complexity of k-flip local search for SAT and MAX SAT. Discrete Optimization 8(1): 139-145 (2011)

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. 209(2): 143-153 (2011)

Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: A probabilistic approach to problems parameterized above or below tight bounds. J. Comput. Syst. Sci. 77(2): 422-429 (2011)

Stefan Szeider: Monadic second order logic on graphs with local cardinality constraints. ACM Trans. Comput. Log. 12(2): 12 (2011)

Stefan Szeider: Limits of Preprocessing. AAAI 2011

Serge Gaspers, Stefan Szeider: The Parameterized Complexity of Local Consistency. CP 2011: 302-316

Serge Gaspers, Stefan Szeider: Kernels for Global Constraints. IJCAI 2011: 540-545

Johannes Klaus Fichte, Stefan Szeider: Backdoors to Tractable Answer-Set Programming. IJCAI 2011: 863-868

Sebastian Ordyniak, Stefan Szeider: Augmenting Tractable Fragments of Abstract Argumentation. IJCAI 2011: 1033-1038

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider: Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). SAT 2011: 47-60

Serge Gaspers, Stefan Szeider: Kernels for Global Constraints. CoRR abs/1104.2541 (2011)

Johannes Klaus Fichte, Stefan Szeider: Backdoors to Tractable Answer-Set Programming. CoRR abs/1104.2788 (2011)

Sebastian Ordyniak, Stefan Szeider: Augmenting Tractable Fragments of Abstract Argumentation. CoRR abs/1104.2842 (2011)

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider: Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II). CoRR abs/1104.4279 (2011)

Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider: Algorithms and Complexity Results for Persuasive Argumentation. CoRR abs/1104.4290 (2011)

Stefan Szeider: Limits of Preprocessing. CoRR abs/1104.5566 (2011)

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 abs/1106.3527 (2011)

Stefan Szeider: Not So Easy Problems for Tree Decomposable Graphs. CoRR abs/1107.1177 (2011)

Serge Gaspers, Stefan Szeider: Backdoors to Acyclic SAT. CoRR abs/1110.6384 (2011)

Serge Gaspers, Stefan Szeider: Backdoors to Satisfaction. CoRR abs/1110.6387 (2011)

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 abs/1112.3244 (2011)

Serge Gaspers, Stefan Szeider: The Parameterized Complexity of Local Consistency. Electronic Colloquium on Computational Complexity (ECCC) 18: 71 (2011)

Marko Samer, Stefan Szeider: Constraint satisfaction with bounded treewidth revisited. J. Comput. Syst. Sci. 76(2): 103-114 (2010)

Marko Samer, Stefan Szeider: Algorithms for propositional model counting. J. Discrete Algorithms 8(1): 50-64 (2010)

Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Editorial. J. Discrete Algorithms 8(2): 101 (2010)

Wolfgang Dvorák, Stefan Szeider, Stefan Woltran: Reasoning in Argumentation Frameworks of Bounded Clique-Width. COMMA 2010: 219-230

Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider: Algorithms and Complexity Results for Persuasive Argumentation. COMMA 2010: 311-322

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider: Satisfiability of Acyclic and Almost Acyclic CNF Formulas. FSTTCS 2010: 84-95

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: 158-169

Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran: Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. KR 2010

Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: Solving MAX-r-SAT Above a Tight Lower Bound. SODA 2010: 511-517

Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos: On Contracting Graphs to Fixed Pattern Graphs. SOFSEM 2010: 503-514

Sebastian Ordyniak, Stefan Szeider: Algorithms and Complexity Results for Exact Bayesian Structure Learning. UAI 2010: 401-408

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. Lecture Notes in Computer Science 6175, Springer 2010, isbn 978-3-642-14185-0

Marko Samer, Stefan Szeider: Backdoor Sets of Quantified Boolean Formulas. J. Autom. Reasoning 42(1): 77-97 (2009)

Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Editorial. J. Discrete Algorithms 7(2): 147 (2009)

Stefan Szeider: Matched Formulas and Backdoor Sets. JSAT 6(1-3): 1-12 (2009)

Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Clique-Width is NP-Complete. SIAM J. Discrete Math. 23(2): 909-939 (2009)

Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider: Covering graphs with few complete bipartite subgraphs. Theor. Comput. Sci. 410(21-23): 2045-2053 (2009)

Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. IWPEC 2009: 234-245

Stefan Szeider: The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT. SAT 2009: 276-283

Marko Samer, Stefan Szeider: Fixed-Parameter Tractability. Handbook of Satisfiability 2009: 425-454

Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound. CoRR abs/0906.1356 (2009)

Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo: Solving MAX-2-SAT Above a Tight Lower Bound. CoRR abs/0907.4573 (2009)

Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica 52(2): 133-152 (2008)

Georg Gottlob, Stefan Szeider: Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems. Comput. J. 51(3): 303-325 (2008)

Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Preface. J. Discrete Algorithms 6(4): 539 (2008)

Marko Samer, Stefan Szeider: Backdoor Trees. AAAI 2008: 363-368

Marko Samer, Stefan Szeider: Tractable Cases of the Extended Global Cardinality Constraint. CATS 2008: 67-74

Luke Mathieson, Stefan Szeider: The Parameterized Complexity of Regular Subgraph Problems and Generalizations. CATS 2008: 79-86

Luke Mathieson, Stefan Szeider: Parameterized Graph Editing with Chosen Vertex Degrees. COCOA 2008: 13-22

Stefan Szeider: Monadic Second Order Logic on Graphs with Local Cardinality Constraints. MFCS 2008: 601-612

Stefan Szeider: Parameterized SAT. Encyclopedia of Algorithms 2008

Naomi Nishimura, Prabhakar Ragde, Stefan Szeider: Solving #SAT using vertex covers. Acta Inf. 44(7-8): 509-523 (2007)

Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 41(3): 521-538 (2007)

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: 366-377

Stefan S. Dantchev, Barnaby Martin, Stefan Szeider: Parameterized Proof Complexity. FOCS 2007: 150-160

Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider: Covering Graphs with Few Complete Bipartite Subgraphs. FSTTCS 2007: 340-351

Marko Samer, Stefan Szeider: Algorithms for Propositional Model Counting. LPAR 2007: 484-498

Stefan Szeider: Matched Formulas and Backdoor Sets. SAT 2007: 94-99

Marko Samer, Stefan Szeider: Backdoor Sets of Quantified Boolean Formulas. SAT 2007: 230-243

Stefan S. Dantchev, Barnaby Martin, Stefan Szeider: Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution. Electronic Colloquium on Computational Complexity (ECCC) 14(001) (2007)

Shlomo Hoory, Stefan Szeider: A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable. SIAM J. Discrete Math. 20(2): 523-528 (2006)

Michael R. Fellows, Stefan Szeider, Graham Wrightson: On finding short resolution refutations and small unsatisfiable subsets. Theor. Comput. Sci. 351(3): 351-359 (2006)

Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. CIAC 2006: 356-367

Marko Samer, Stefan Szeider: Constraint Satisfaction with Bounded Treewidth Revisited. CP 2006: 499-513

Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. IWPEC 2006: 60-71

Naomi Nishimura, Prabhakar Ragde, Stefan Szeider: Solving #SAT Using Vertex Covers. SAT 2006: 396-409

Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Clique-width minimization is NP-hard. STOC 2006: 354-362

Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider (Eds.): Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK. Texts in Algorithmics 7, King's College, London 2006, isbn 1-904987-38-9

Gregory Gutin, Stefan Szeider, Anders Yeo: Fixed-Parameter Complexity of Minimum Profile Problems. CoRR abs/cs/0604095 (2006)

Marko Samer, Stefan Szeider: Complexity and Applications of Edge-Induced Vertex-Cuts. CoRR abs/cs/0607109 (2006)

Marko Samer, Stefan Szeider: A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth. CoRR abs/cs/0610174 (2006)

Stefan Szeider: Generalizations of matched CNF formulas. Ann. Math. Artif. Intell. 43(1): 223-238 (2005)

Herbert Fleischner, Stefan Szeider: On Edge-Colored Graphs Covered by Properly Colored Cycles. Graphs and Combinatorics 21(3): 301-306 (2005)

Stefan Szeider: Backdoor Sets for DLL Subsolvers. J. Autom. Reasoning 35(1-3): 73-88 (2005)

Stefan Szeider: The Complexity of Resolution with Generalized Symmetry Rules. Theory Comput. Syst. 38(2): 171-188 (2005)

Shlomo Hoory, Stefan Szeider: Computing unsatisfiable k-SAT instances with few occurrences per variable. Theor. Comput. Sci. 337(1-3): 347-359 (2005)

Hajo Broersma, Matthew Johnson, Stefan Szeider (Eds.): Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK. Texts in Algorithmics 4, King's College, London 2005, isbn 1-904987-10-9

Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo: The Linear Arrangement Problem Parameterized Above Guaranteed Value. CoRR abs/cs/0511030 (2005)

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)(080) (2005)

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)(081) (2005)

Stefan Szeider: On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors. Ars Comb. 73 (2004)

Stefan Szeider: Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. J. Comput. Syst. Sci. 69(4): 656-674 (2004)

Michael R. Fellows, Stefan Szeider, Graham Wrightson: On Finding Short Resolution Refutations and Small Unsatisfiable Subsets. IWPEC 2004: 223-234

Shlomo Hoory, Stefan Szeider: Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. SAT 2004

Naomi Nishimura, Prabhakar Ragde, Stefan Szeider: Detecting Backdoor Sets with Respect to Horn and Binary Clauses. SAT 2004

Stefan Szeider: Finding paths in graphs avoiding forbidden transitions. Discrete Applied Mathematics 126(2-3): 261-273 (2003)

Stefan Szeider: Homomorphisms of conjunctive normal forms. Discrete Applied Mathematics 130(2): 351-365 (2003)

Stefan Szeider: Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable. COCOON 2003: 548-558

Stefan Szeider: On Fixed-Parameter Tractable Parameterizations of SAT. SAT 2003: 188-202

Stefan Szeider: The Complexity of Resolution with Generalized Symmetry Rules. STACS 2003: 475-486

Stefan Szeider: Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. Electronic Colloquium on Computational Complexity (ECCC) 10(002) (2003)

Herbert Fleischner, Oliver Kullmann, Stefan Szeider: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theor. Comput. Sci. 289(1): 503-516 (2002)

Stefan Szeider: NP-Completeness of Refutability by Literal-Once Resolution. IJCAR 2001: 168-181

Herbert Fleischner, Stefan Szeider: Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference. Electronic Colloquium on Computational Complexity (ECCC) 7(49) (2000)