Articles with public access mandates - Stefan SzeiderLearn more
Not available anywhere: 3
Polynomial-time construction of optimal MPI derived datatype trees
R Ganian, M Kalany, S Szeider, JL Träff
2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2016
Mandates: Austrian Science Fund
MaxSAT-Based Postprocessing for Treedepth
VP Ramaswamy, S Szeider
International Conference on Principles and Practice of Constraint …, 2020
Mandates: Austrian Science Fund
On the parameterized complexity of clustering problems for incomplete data
E Eiben, R Ganian, I Kanj, S Ordyniak, S Szeider
Journal of Computer and System Sciences 134, 1-19, 2023
Mandates: Austrian Science Fund, UK Engineering and Physical Sciences Research Council …
Available somewhere: 107
Constraint satisfaction with bounded treewidth revisited
M Samer, S Szeider
Journal of Computer and System Sciences 76 (2), 103-114, 2010
Mandates: Austrian Science Fund
Fixed-parameter tractability
M Samer, S Szeider
Handbook of Satisfiability, 693-736, 2021
Mandates: UK Engineering and Physical Sciences Research Council
Satisfiability of acyclic and almost acyclic CNF formulas
S Ordyniak, D Paulusma, S Szeider
Theoretical Computer Science 481, 85-99, 2013
Mandates: UK Engineering and Physical Sciences Research Council
Backdoors to tractable answer-set programming
JK Fichte, S Szeider
arXiv preprint arXiv:1104.2788, 2011
Mandates: Austrian Science Fund
Soundness of Q-resolution with dependency schemes
F Slivovsky, S Szeider
Theoretical Computer Science 612, 83-101, 2016
Mandates: European Commission
SAT-based decision tree learning for large data sets
A Schidler, S Szeider
Journal of Artificial Intelligence Research 80, 875-918, 2024
Mandates: Austrian Science Fund
A complete parameterized complexity analysis of bounded planning
C Bäckström, P Jonsson, S Ordyniak, S Szeider
Journal of Computer and System Sciences 81 (7), 1311-1332, 2015
Mandates: Austrian Science Fund, European Commission
Parameterized complexity classes beyond para-NP
R de Haan, S Szeider
Journal of Computer and System Sciences 87, 16-57, 2017
Mandates: Austrian Science Fund, European Commission
Model counting for CNF formulas of bounded modular treewidth
D Paulusma, F Slivovsky, S Szeider
Algorithmica 76, 168-194, 2016
Mandates: UK Engineering and Physical Sciences Research Council, European Commission
Backdoors to normality for disjunctive logic programs
JK Fichte, S Szeider
ACM Transactions on Computational Logic (TOCL) 17 (1), 1-23, 2015
Mandates: Austrian Science Fund, European Commission
Algorithmic applications of tree-cut width
R Ganian, EJ Kim, S Szeider
International Symposium on Mathematical Foundations of Computer Science, 348-360, 2015
Mandates: Austrian Science Fund, Vienna Science and Technology Fund, Austria
A SAT approach to clique-width
MJH Heule, S Szeider
ACM Transactions on Computational Logic (TOCL) 16 (3), 1-27, 2015
Mandates: European Commission
Backdoors into heterogeneous classes of SAT and CSP
S Gaspers, N Misra, S Ordyniak, S Szeider, S Živný
Journal of Computer and System Sciences 85, 38-56, 2017
Mandates: Austrian Science Fund, Australian Research Council, Department of Science …
Guarantees and limits of preprocessing in constraint satisfaction and reasoning
S Gaspers, S Szeider
Artificial Intelligence 216, 1-19, 2014
Mandates: Australian Research Council, European Commission
Dependency learning for QBF
T Peitl, F Slivovsky, S Szeider
Theory and Applications of Satisfiability Testing–SAT 2017: 20th …, 2017
Mandates: Austrian Science Fund
Strong backdoors to bounded treewidth SAT
S Gaspers, S Szeider
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 489-498, 2013
Mandates: Australian Research Council
Long-distance Q-resolution with dependency schemes
T Peitl, F Slivovsky, S Szeider
Journal of Automated Reasoning 63, 127-155, 2019
Mandates: Austrian Science Fund
Publication and funding information is determined automatically by a computer program