Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDStefan Szeider
Person information
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j76]Robert Ganian, Jan Kratochvíl, Stefan Szeider:
Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria. Discret. Appl. Math. 312: 1-2 (2022)- [j75]Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider:
Sum-of-Products with Default Values: Algorithms and Complexity Results. J. Artif. Intell. Res. 73: 535-552 (2022) - [c129]André Schidler, Stefan Szeider:
A SAT Approach to Twin-Width. ALENEX 2022: 67-77 - [i71]Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
SAT Backdoors: Depth Beats Size. CoRR abs/2202.08326 (2022) - [i70]Robert Ganian, Eun Jung Kim, Stefan Szeider:
Algorithmic Applications of Tree-Cut Width. CoRR abs/2206.00752 (2022) - [i69]Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider:
Weighted Model Counting with Twin-Width. CoRR abs/2206.01706 (2022) - 2021
- [j74]Robert Ganian
, Stefan Szeider:
New width parameters for SAT and #SAT. Artif. Intell. 295: 103460 (2021) - [j73]Tomás Peitl, Stefan Szeider:
Finding the Hardest Formulas for Resolution. J. Artif. Intell. Res. 72: 69-97 (2021) - [c128]Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider:
Turbocharging Treewidth-Bounded Bayesian Network Structure Learning. AAAI 2021: 3895-3903 - [c127]André Schidler, Stefan Szeider:
SAT-based Decision Tree Learning for Large Data Sets. AAAI 2021: 3904-3912 - [c126]Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity of Small Decision Tree Learning. AAAI 2021: 6454-6462 - [c125]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
The Parameterized Complexity of Clustering Incomplete Data. AAAI 2021: 7296-7304 - [c124]Markus Kirchweger, Stefan Szeider:
SAT Modulo Symmetries for Graph Generation. CP 2021: 34:1-34:16 - [c123]Sebastian Ordyniak, André Schidler, Stefan Szeider:
Backdoor DNFs. IJCAI 2021: 1403-1409 - [c122]André Schidler, Stefan Szeider:
Computing Optimal Hypertree Decompositions with SAT. IJCAI 2021: 1418-1424 - [c121]Tomás Peitl, Stefan Szeider:
Finding the Hardest Formulas for Resolution (Extended Abstract). IJCAI 2021: 4814-4818 - [c120]Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider:
Learning Fast-Inference Bayesian Networks. NeurIPS 2021: 17852-17863 - [c119]Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider:
Certified DQBF Solving by Definition Extraction. SAT 2021: 499-517 - [p3]Marko Samer, Stefan Szeider:
Fixed-Parameter Tractability. Handbook of Satisfiability 2021: 693-736 - [i68]Laura Kovács, Hanna Lachnitt, Stefan Szeider:
Formalizing Graph Trail Properties in Isabelle/HOL. CoRR abs/2103.03607 (2021) - [i67]Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider:
Certified DQBF Solving by Definition Extraction. CoRR abs/2106.02550 (2021) - [i66]André Schidler, Stefan Szeider:
A SAT Approach to Twin-Width. CoRR abs/2110.06146 (2021) - 2020
- [j72]Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider:
On Existential MSO and Its Relation to ETH. ACM Trans. Comput. Theory 12(4): 22:1-22:32 (2020) - [c118]Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. AAAI 2020: 3906-3913 - [c117]André Schidler, Stefan Szeider:
Computing Optimal Hypertree Decompositions. ALENEX 2020: 1-11 - [c116]Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
A Time Leap Challenge for SAT-Solving. CP 2020: 267-285 - [c115]Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
Breaking Symmetries with RootClique and LexTopSort. CP 2020: 286-303 - [c114]Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider:
MaxSAT-Based Postprocessing for Treedepth. CP 2020: 478-495 - [c113]Tomás Peitl, Stefan Szeider:
Finding the Hardest Formulas for Resolution. CP 2020: 514-530 - [c112]Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider:
Threshold Treewidth and Hypertree Width. IJCAI 2020: 1898-1904 - [c111]Robert Ganian, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. KR 2020: 392-402 - [c110]Laura Kovács, Hanna Lachnitt, Stefan Szeider:
Formalizing Graph Trail Properties in Isabelle/HOL. CICM 2020: 190-205 - [c109]Friedrich Slivovsky, Stefan Szeider:
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth. SAT 2020: 267-276 - [c108]Ankit Shukla, Friedrich Slivovsky, Stefan Szeider:
Short Q-Resolution Proofs with Homomorphisms. SAT 2020: 412-428 - [i65]P. R. Vaidyanathan, Stefan Szeider:
Turbocharging Treewidth-Bounded Bayesian Network Structure Learning. CoRR abs/2006.13843 (2020) - [i64]Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
A Time Leap Challenge for SAT Solving. CoRR abs/2008.02215 (2020)
2010 – 2019
- 2019
- [j71]Ronald de Haan, Stefan Szeider:
A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy. Algorithms 12(9): 188 (2019) - [j70]Daniël Paulusma, Stefan Szeider:
On the parameterized complexity of (k, s)-SAT. Inf. Process. Lett. 143: 34-36 (2019) - [j69]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Dependency Learning for QBF. J. Artif. Intell. Res. 65: 180-208 (2019) - [j68]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Long-Distance Q-Resolution with Dependency Schemes. J. Autom. Reason. 63(1): 127-155 (2019) - [j67]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Qute in the QBF Evaluation 2018. J. Satisf. Boolean Model. Comput. 11(1): 261-272 (2019) - [j66]Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
A SAT Approach to Branchwidth. ACM Trans. Comput. Log. 20(3): 15:1-15:24 (2019) - [c107]Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
SAT-Encodings for Treecut Width and Treedepth. ALENEX 2019: 117-129 - [c106]Robert Ganian, Sebastian Ordyniak, Stefan Szeider:
A Join-Based Hybrid Parameter for Constraint Satisfaction. CP 2019: 195-212 - [c105]Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider:
The Parameterized Complexity of Cascading Portfolio Scheduling. NeurIPS 2019: 7666-7676 - [c104]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Combining Resolution-Path Dependencies with Dependency Learning. SAT 2019: 306-318 - [c103]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Proof Complexity of Fragments of Long-Distance Q-Resolution. SAT 2019: 319-335 - [i63]Robert Ganian, Sebastian Ordyniak, Stefan Szeider:
A Join-Based Hybrid Parameter for Constraint Satisfaction. CoRR abs/1907.12335 (2019) - [i62]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
On Clustering Incomplete Data. CoRR abs/1911.01465 (2019) - [i61]Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
SAT-Encodings for Treecut Width and Treedepth. CoRR abs/1911.12995 (2019) - 2018
- [j65]Eduard Eiben, Robert Ganian, Stefan Szeider:
Solving Problems on Graphs of High Rank-Width. Algorithmica 80(2): 742-771 (2018) - [j64]Eduard Eiben, Robert Ganian, Stefan Szeider:
Meta-kernelization using well-structured modulators. Discret. Appl. Math. 248: 153-167 (2018) - [c102]Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider:
An SMT Approach to Fractional Hypertree Width. CP 2018: 109-127 - [c101]Holger H. Hoos, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Portfolio-Based Algorithm Selection for Circuit QBFs. CP 2018: 195-209 - [c100]Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider:
Parameterized Algorithms for the Matrix Completion Problem. ICML 2018: 1642-1651 - [c99]Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider:
Sum-of-Products with Default Values: Algorithms and Complexity Results. ICTAI 2018: 733-737 - [c98]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Polynomial-Time Validation of QCDCL Certificates. SAT 2018: 253-269 - [i60]Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider:
Parameterized Algorithms for the Matrix Completion Problem. CoRR abs/1804.03423 (2018) - 2017
- [j63]Moritz Müller, Stefan Szeider:
The treewidth of proofs. Inf. Comput. 255: 147-164 (2017) - [j62]Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný:
Backdoors into heterogeneous classes of SAT and CSP. J. Comput. Syst. Sci. 85: 38-56 (2017) - [j61]Ronald de Haan, Stefan Szeider:
Parameterized complexity classes beyond para-NP. J. Comput. Syst. Sci. 87: 16-57 (2017) - [j60]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. ACM Trans. Algorithms 13(2): 29:1-29:32 (2017) - [j59]Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances. ACM Trans. Comput. Log. 18(3): 21:1-21:46 (2017) - [c97]M. S. Ramanujan, Stefan Szeider:
Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable. AAAI 2017: 3929-3935 - [c96]Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
A SAT Approach to Branchwidth. IJCAI 2017: 4894-4898 - [c95]Johannes Klaus Fichte, Stefan Szeider:
Backdoor Trees for Answer Set Programming. ASPOCP@LPNMR 2017 - [c94]Simone Bova, Stefan Szeider:
Circuit Treewidth, Sentential Decision, and Query Compilation. PODS 2017: 233-246 - [c93]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Backdoor Treewidth for SAT. SAT 2017: 20-37 - [c92]Robert Ganian, Stefan Szeider:
New Width Parameters for Model Counting. SAT 2017: 38-52 - [c91]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Dependency Learning for QBF. SAT 2017: 298-313 - [c90]Johannes Klaus Fichte, Neha Lodha, Stefan Szeider:
SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. SAT 2017: 401-411 - [c89]Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
SAT-Encodings for Special Treewidth and Pathwidth. SAT 2017: 429-445 - [c88]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Combining Treewidth and Backdoors for CSP. STACS 2017: 36:1-36:17 - [p2]Serge Gaspers, Sebastian Ordyniak, Stefan Szeider:
Backdoor Sets for CSP. The Constraint Satisfaction Problem 2017: 137-157 - [i59]Simone Bova, Stefan Szeider:
Circuit Treewidth, Sentential Decision, and Query Compilation. CoRR abs/1701.04626 (2017) - [i58]Adnan Darwiche, Pierre Marquis, Dan Suciu, Stefan Szeider:
Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381). Dagstuhl Reports 7(9): 62-85 (2017) - 2016
- [j58]Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider:
Backdoors to q-Horn. Algorithmica 74(1): 540-557 (2016) - [j57]Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider:
Model Counting for CNF Formulas of Bounded Modular Treewidth. Algorithmica 76(1): 168-194 (2016) - [j56]Friedrich Slivovsky, Stefan Szeider:
Quantifier Reordering for QBF. J. Autom. Reason. 56(4): 459-477 (2016) - [j55]Robert Ganian, Friedrich Slivovsky, Stefan Szeider:
Meta-kernelization with structural parameters. J. Comput. Syst. Sci. 82(2): 333-346 (2016) - [j54]Friedrich Slivovsky, Stefan Szeider:
Soundness of Q-resolution with dependency schemes. Theor. Comput. Sci. 612: 83-101 (2016) - [j53]Simone Bova, Robert Ganian, Stefan Szeider:
Quantified conjunctive queries on partially ordered sets. Theor. Comput. Sci. 618: 72-84 (2016) - [j52]Simone Bova, Robert Ganian, Stefan Szeider:
Model Checking Existential Logic on Partially Ordered Sets. ACM Trans. Comput. Log. 17(2): 10 (2016) - [c87]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Backdoors to Tractable Valued CSP. CP 2016: 233-250 - [c86]Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff:
Polynomial-Time Construction of Optimal MPI Derived Datatype Trees. IPDPS 2016: 638-647 - [c85]Ronald de Haan, Stefan Szeider:
Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics. KR 2016: 453-462 - [c84]Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
On Existential MSO and its Relation to ETH. MFCS 2016: 42:1-42:14 - [c83]Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
A SAT Approach to Branchwidth. SAT 2016: 179-195 - [c82]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Long Distance Q-Resolution with Dependency Schemes. SAT 2016: 500-518 - [c81]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. SODA 2016: 1670-1681 - [r2]Stefan Szeider:
Parameterized SAT. Encyclopedia of Algorithms 2016: 1530-1532 - [i57]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Combining Treewidth and Backdoors for CSP. CoRR abs/1610.03298 (2016) - [i56]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Backdoors to Tractable Valued CSP. CoRR abs/1612.05733 (2016) - 2015
- [j51]Johannes Klaus Fichte, Stefan Szeider:
Backdoors to tractable answer set programming. Artif. Intell. 220: 64-103 (2015) - [j50]Gregory Z. Gutin, Stefan Szeider:
Guest Editorial: Special Issue on Parameterized and Exact Computation. Algorithmica 71(3): 539-540 (2015) - [j49]Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
On the Subexponential-Time Complexity of CSP. J. Artif. Intell. Res. 52: 203-234 (2015) - [j48]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
A complete parameterized complexity analysis of bounded planning. J. Comput. Syst. Sci. 81(7): 1311-1332 (2015) - [j47]Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider:
On finding optimal polytrees. Theor. Comput. Sci. 592: 49-58 (2015) - [j46]Iyad A. Kanj, Stefan Szeider:
Parameterized and subexponential-time complexity of satisfiability problems and applications. Theor. Comput. Sci. 607: 282-295 (2015) - [j45]Marijn Heule, Stefan Szeider:
A SAT Approach to Clique-Width. ACM Trans. Comput. Log. 16(3): 24:1-24:27 (2015) - [j44]Johannes Klaus Fichte, Stefan Szeider:
Backdoors to Normality for Disjunctive Logic Programs. ACM Trans. Comput. Log. 17(1): 7 (2015) - [c80]Ulle Endriss, Ronald de Haan, Stefan Szeider:
Parameterized Complexity Results for Agenda Safety in Judgment Aggregation. AAMAS 2015: 127-136 - [c79]Eduard Eiben, Robert Ganian, Stefan Szeider:
Meta-kernelization using Well-structured Modulators. IPEC 2015: 114-126 - [c78]Robert Ganian, Eun Jung Kim, Stefan Szeider:
Algorithmic Applications of Tree-Cut Width. MFCS (2) 2015: 348-360 - [c77]Robert Ganian, Stefan Szeider:
Community Structure Inspired Algorithms for SAT and #SAT. SAT 2015: 223-237 - [c76]Ronald de Haan, Stefan Szeider:
Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP. SOFSEM 2015: 217-229 - [c75]Eduard Eiben, Robert Ganian, Stefan Szeider:
Solving Problems on Graphs of High Rank-Width. WADS 2015: 314-326 - [i55]Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff:
Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions. CoRR abs/1506.09100 (2015) - [i54]Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. CoRR abs/1507.02479 (2015) - [i53]Eduard Eiben, Robert Ganian, Stefan Szeider:
Solving Problems on Graphs of High Rank-Width. CoRR abs/1507.05463 (2015) - [i52]Eduard Eiben, Robert Ganian, Stefan Szeider:
Meta-Kernelization using Well-Structured Modulators. CoRR abs/1507.05544 (2015) - [i51]Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný:
Backdoors into Heterogeneous Classes of SAT and CSP. CoRR abs/1509.05725 (2015) - 2014
- [j43]Serge Gaspers, Stefan Szeider:
Guarantees and limits of preprocessing in constraint satisfaction and reasoning. Artif. Intell. 216: 1-19 (2014) - [j42]Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran:
Tractable answer-set programming with weight constraints: bounded treewidth is not enough. Theory Pract. Log. Program. 14(2): 141-164 (2014) - [c74]Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný:
Backdoors into Heterogeneous Classes of SAT and CSP. AAAI 2014: 2652-2658 - [c73]Iyad A. Kanj, Stefan Szeider:
Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications. COCOA 2014: 637-651 - [c72]Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
Subexponential Time Complexity of CSP with Global Constraints. CP 2014: 272-288 - [c71]Simone Bova, Robert Ganian, Stefan Szeider:
Model checking existential logic on partially ordered sets. CSL-LICS 2014: 21:1-21:10 - [c70]Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
Small Unsatisfiable Subsets in Constraint Satisfaction. ICTAI 2014: 429-436 - [c69]Simone Bova, Robert Ganian, Stefan Szeider:
Quantified Conjunctive Queries on Partially Ordered Sets. IPEC 2014: 122-134 - [c68]Ronald de Haan, Stefan Szeider:
The Parameterized Complexity of Reasoning Problems Beyond NP. KR 2014 - [c67]Ronald de Haan, Stefan Szeider:
Fixed-Parameter Tractable Reductions to SAT. SAT 2014: 85-102 - [c66]Friedrich Slivovsky, Stefan Szeider:
Variable Dependencies and Q-Resolution. SAT 2014: 269-284 - [i50]Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity Results for Exact Bayesian Network Structure Learning. CoRR abs/1402.0558 (2014) - [i49]Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. CoRR abs/1402.6109 (2014) - [i48]Simone Bova, Robert Ganian, Stefan Szeider:
Model Checking Existential Logic on Partially Ordered Sets. CoRR abs/1405.2891 (2014) - [i47]Serge Gaspers, Stefan Szeider:
Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning. CoRR abs/1406.3124 (2014) - [i46]Simone Bova, Robert Ganian, Stefan Szeider:
Quantified Conjunctive Queries on Partially Ordered Sets. CoRR abs/1408.4263 (2014) - [i45]Friedrich Slivovsky, Stefan Szeider:
Model Counting for Formulas of Bounded Clique-Width. CoRR abs/1409.8464 (2014) - [i44]Ronald de Haan, Stefan Szeider:
Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy. Electron. Colloquium Comput. Complex. 21: 143 (2014) - 2013
- [j41]Agata Ciabattoni, Rusins Freivalds, Antonín Kucera, Igor Potapov, Stefan Szeider:
Preface. Fundam. Informaticae 123(1) (2013) - [j40]Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity Results for Exact Bayesian Network Structure Learning. J. Artif. Intell. Res. 46: 263-302 (2013) - [j39]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst.