The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Stefan Szeider" ( http://dblp.L3S.de/Authors/Stefan_Szeider )

URL (Homepage):  https://www.ac.tuwien.ac.at/people/szeider/  Author page on DBLP  Author page in RDF  Community of Stefan Szeider in ASPL-2

Publication years (Num. hits)
2000-2005 (23) 2006-2007 (20) 2008-2009 (19) 2010-2011 (39) 2012 (23) 2013 (32) 2014 (18) 2015 (19) 2016 (17) 2017 (18) 2018-2019 (17)
Publication types (Num. hits)
article(130) incollection(4) inproceedings(106) proceedings(5)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 17 occurrences of 15 keywords

Results
Found 246 publication records. Showing 245 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Daniël Paulusma, Stefan Szeider On the parameterized complexity of (k, s)-SAT. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Neha Lodha, Sebastian Ordyniak, Stefan Szeider A SAT Approach to Branchwidth. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Dependency Learning for QBF. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, Stefan Szeider A Join-Based Hybrid Parameter for Constraint Satisfaction. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Long-Distance Q-Resolution with Dependency Schemes. Search on Bibsonomy J. Autom. Reasoning The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Proof Complexity of Fragments of Long-Distance Q-Resolution. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Combining Resolution-Path Dependencies with Dependency Learning. Search on Bibsonomy SAT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider SAT-Encodings for Treecut Width and Treedepth. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Sebastian Ordyniak, Stefan Szeider A Join-Based Hybrid Parameter for Constraint Satisfaction. Search on Bibsonomy CP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Stefan Szeider Solving Problems on Graphs of High Rank-Width. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider Parameterized Algorithms for the Matrix Completion Problem. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Stefan Szeider Meta-kernelization using well-structured modulators. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Polynomial-Time Validation of QCDCL Certificates. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Eun Jung Kim 0002, Friedrich Slivovsky, Stefan Szeider Sum-of-Products with Default Values: Algorithms and Complexity Results. Search on Bibsonomy ICTAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider An SMT Approach to Fractional Hypertree Width. Search on Bibsonomy CP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Holger H. Hoos, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Portfolio-Based Algorithm Selection for Circuit QBFs. Search on Bibsonomy CP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider Parameterized Algorithms for the Matrix Completion Problem. Search on Bibsonomy ICML The full citation details ... 2018 DBLP  BibTeX  RDF
1Ronald de Haan, Iyad A. Kanj, Stefan Szeider On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Adnan Darwiche, Pierre Marquis, Dan Suciu, Stefan Szeider Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny Backdoors into heterogeneous classes of SAT and CSP. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ronald de Haan, Stefan Szeider Parameterized complexity classes beyond para-NP. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Simone Bova, Stefan Szeider Circuit Treewidth, Sentential Decision, and Query Compilation. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Moritz Müller, Stefan Szeider The treewidth of proofs. Search on Bibsonomy Inf. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Sebastian Ordyniak, Stefan Szeider Backdoor Sets for CSP. Search on Bibsonomy The Constraint Satisfaction Problem The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Johannes Klaus Fichte, Stefan Szeider Backdoor Trees for Answer Set Programming. Search on Bibsonomy ASPOCP@LPNMR The full citation details ... 2017 DBLP  BibTeX  RDF
1Simone Bova, Stefan Szeider Circuit Treewidth, Sentential Decision, and Query Compilation. Search on Bibsonomy PODS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1M. S. Ramanujan, Stefan Szeider Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable. Search on Bibsonomy AAAI The full citation details ... 2017 DBLP  BibTeX  RDF
1Robert Ganian, Stefan Szeider New Width Parameters for Model Counting. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Neha Lodha, Sebastian Ordyniak, Stefan Szeider SAT-Encodings for Special Treewidth and Pathwidth. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Dependency Learning for QBF. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Johannes Klaus Fichte, Neha Lodha, Stefan Szeider SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Backdoor Treewidth for SAT. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Combining Treewidth and Backdoors for CSP. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Neha Lodha, Sebastian Ordyniak, Stefan Szeider A SAT Approach to Branchwidth. Search on Bibsonomy IJCAI The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Stefan Szeider Parameterized SAT. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Simone Bova, Robert Ganian, Stefan Szeider Model Checking Existential Logic on Partially Ordered Sets. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh 0001, Stefan Szeider Backdoors to q-Horn. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider Model Counting for CNF Formulas of Bounded Modular Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Friedrich Slivovsky, Stefan Szeider Soundness of Q-resolution with dependency schemes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Simone Bova, Robert Ganian, Stefan Szeider Quantified conjunctive queries on partially ordered sets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Friedrich Slivovsky, Stefan Szeider Meta-kernelization with structural parameters. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Backdoors to Tractable Valued CSP. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Combining Treewidth and Backdoors for CSP. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Friedrich Slivovsky, Stefan Szeider Quantifier Reordering for QBF. Search on Bibsonomy J. Autom. Reasoning The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. Search on Bibsonomy SODA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider On Existential MSO and its Relation to ETH. Search on Bibsonomy MFCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff Polynomial-Time Construction of Optimal MPI Derived Datatype Trees. Search on Bibsonomy IPDPS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tomás Peitl, Friedrich Slivovsky, Stefan Szeider Long Distance Q-Resolution with Dependency Schemes. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Neha Lodha, Sebastian Ordyniak, Stefan Szeider A SAT Approach to Branchwidth. Search on Bibsonomy SAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Backdoors to Tractable Valued CSP. Search on Bibsonomy CP The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ronald de Haan, Stefan Szeider Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics. Search on Bibsonomy KR The full citation details ... 2016 DBLP  BibTeX  RDF
1Johannes Klaus Fichte, Stefan Szeider Backdoors to Normality for Disjunctive Logic Programs. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Marijn Heule, Stefan Szeider A SAT Approach to Clique-Width. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Johannes Klaus Fichte, Stefan Szeider Backdoors to tractable answer set programming. Search on Bibsonomy Artif. Intell. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Gregory Z. Gutin, Stefan Szeider Guest Editorial: Special Issue on Parameterized and Exact Computation. Search on Bibsonomy Algorithmica The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Stefan Szeider Parameterized and subexponential-time complexity of satisfiability problems and applications. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider On finding optimal polytrees. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider A complete parameterized complexity analysis of bounded planning. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ronald de Haan, Iyad A. Kanj, Stefan Szeider On the Subexponential-Time Complexity of CSP. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Stefan Szeider Solving Problems on Graphs of High Rank-Width. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny Backdoors into Heterogeneous Classes of SAT and CSP. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan, Stefan Szeider Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Stefan Szeider Meta-Kernelization using Well-Structured Modulators. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Robert Ganian, Eun Jung Kim 0002, Stefan Szeider Algorithmic Applications of Tree-Cut Width. Search on Bibsonomy MFCS (2) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Stefan Szeider Community Structure Inspired Algorithms for SAT and #SAT. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Stefan Szeider Solving Problems on Graphs of High Rank-Width. Search on Bibsonomy WADS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ronald de Haan, Stefan Szeider Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP. Search on Bibsonomy SOFSEM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ulle Endriss, Ronald de Haan, Stefan Szeider Parameterized Complexity Results for Agenda Safety in Judgment Aggregation. Search on Bibsonomy AAMAS The full citation details ... 2015 DBLP  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Stefan Szeider Meta-kernelization using Well-structured Modulators. Search on Bibsonomy IPEC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Stefan Szeider Guarantees and limits of preprocessing in constraint satisfaction and reasoning. Search on Bibsonomy Artif. Intell. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ronald de Haan, Stefan Szeider Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2014 DBLP  BibTeX  RDF
1Simone Bova, Robert Ganian, Stefan Szeider Quantified Conjunctive Queries on Partially Ordered Sets. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Friedrich Slivovsky, Stefan Szeider Model Counting for Formulas of Bounded Clique-Width. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Sebastian Ordyniak, Stefan Szeider Parameterized Complexity Results for Exact Bayesian Network Structure Learning. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Serge Gaspers, Stefan Szeider Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Simone Bova, Robert Ganian, Stefan Szeider Model Checking Existential Logic on Partially Ordered Sets. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Eun Jung Kim 0002, Sebastian Ordyniak, Stefan Szeider The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran Tractable answer-set programming with weight constraints: bounded treewidth is not enough. Search on Bibsonomy TPLP The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny Backdoors into Heterogeneous Classes of SAT and CSP. Search on Bibsonomy AAAI The full citation details ... 2014 DBLP  BibTeX  RDF
1Friedrich Slivovsky, Stefan Szeider Variable Dependencies and Q-Resolution. Search on Bibsonomy SAT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ronald de Haan, Stefan Szeider Fixed-Parameter Tractable Reductions to SAT. Search on Bibsonomy SAT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ronald de Haan, Iyad A. Kanj, Stefan Szeider Small Unsatisfiable Subsets in Constraint Satisfaction. Search on Bibsonomy ICTAI The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ronald de Haan, Iyad A. Kanj, Stefan Szeider Subexponential Time Complexity of CSP with Global Constraints. Search on Bibsonomy CP The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Stefan Szeider Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications. Search on Bibsonomy COCOA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ronald de Haan, Stefan Szeider The Parameterized Complexity of Reasoning Problems Beyond NP. Search on Bibsonomy KR The full citation details ... 2014 DBLP  BibTeX  RDF
1Simone Bova, Robert Ganian, Stefan Szeider Model checking existential logic on partially ordered sets. Search on Bibsonomy CSL-LICS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Simone Bova, Robert Ganian, Stefan Szeider Quantified Conjunctive Queries on Partially Ordered Sets. Search on Bibsonomy IPEC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Agata Ciabattoni, Rusins Freivalds, Antonín Kucera 0001, Igor Potapov, Stefan Szeider Preface. Search on Bibsonomy Fundam. Inform. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider Satisfiability of acyclic and almost acyclic CNF formulas. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Sebastian Ordyniak, Stefan Szeider Parameterized Complexity Results for Exact Bayesian Network Structure Learning. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Moritz Müller, Stefan Szeider Revisiting Space in Proof Complexity: Treewidth and Pathwidth. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2013 DBLP  BibTeX  RDF
1Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Johannes Klaus Fichte, Stefan Szeider Backdoors to Normality for Disjunctive Logic Programs Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Andreas Pfandler, Stefan Rümmele, Stefan Szeider Backdoors to Abduction Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Marijn Heule, Stefan Szeider A SAT Approach to Clique-Width Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Robert Ganian, Friedrich Slivovsky, Stefan Szeider Meta-Kernelization with Structural Parameters Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Ronald de Haan, Stefan Szeider The Parameterized Complexity of Reasoning Problems Beyond NP. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Ronald de Haan, Anna Roubícková, Stefan Szeider Parameterized Complexity Results for Plan Reuse. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
Displaying result #1 - #100 of 245 (100 per page; Change: )
Pages: [1][2][3][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license