| " Offizielle" elektronische Version der Publikation (entsprechend ihrem Digital Object Identifier-DOI) D Paulusma, F Slivovsky, S Szeider | | |
| 103 Constraint satisfaction with bounded treewidth revisited M Samer, S Szeider, R Clifford, K Efremenko, E Porat, A Rothschild, ... | | |
| 3.27 Structural Parameterizations of Language Restricted Constraint Satisfaction Problems S Szeider The Constraint Satisfaction Problem: Complexity and Approximability, 17, 2013 | | 2013 |
| 47th International Symposium on Mathematical Foundations of Computer Science S Szeider, R Ganian, A Silva | | 2022 |
| A compendium of parameterized problems at higher levels of the polynomial hierarchy R de Haan, S Szeider Algorithms 12 (9), 188, 2019 | 17 | 2019 |
| 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 | 45* | 2015 |
| A faster algorithm for propositional model counting parameterized by incidence treewidth F Slivovsky, S Szeider International Conference on Theory and Applications of Satisfiability …, 2020 | 7 | 2020 |
| A fixed-parameter algorithm for# sat with parameter incidence treewidth M Samer, S Szeider arXiv preprint cs/0610174, 2006 | 5 | 2006 |
| A General Theoretical Framework for Learning Smallest Interpretable Models S Ordyniak, G Paesani, M Rychlicki, S Szeider Proceedings of the AAAI Conference on Artificial Intelligence 38 (9), 10662 …, 2024 | 1 | 2024 |
| A join-based hybrid parameter for constraint satisfaction R Ganian, S Ordyniak, S Szeider Principles and Practice of Constraint Programming: 25th International …, 2019 | 4 | 2019 |
| A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable S Hoory, S Szeider SIAM Journal on Discrete Mathematics 20 (2), 523-528, 2006 | 38* | 2006 |
| A probabilistic approach to problems parameterized above or below tight bounds G Gutin, EJ Kim, S Szeider, A Yeo Journal of Computer and System Sciences 77 (2), 422-429, 2011 | 50 | 2011 |
| A Probabilistic Approach to Problems Parameterized Above or Below Tight Lower Bounds G Gutin, EJ Kim, S Szeider, A Yeo | | |
| A SAT approach to branchwidth N Lodha, S Ordyniak, S Szeider ACM Transactions on Computational Logic (TOCL) 20 (3), 1-24, 2019 | 29 | 2019 |
| A SAT approach to clique-width MJH Heule, S Szeider ACM Transactions on Computational Logic (TOCL) 16 (3), 1-27, 2015 | 42 | 2015 |
| A SAT approach to twin-width A Schidler, S Szeider 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2022 | 27 | 2022 |
| A SAT attack on Rota’s basis conjecture M Kirchweger, M Scheucher, S Szeider 25th International Conference on Theory and Applications of Satisfiability …, 2022 | 9 | 2022 |
| A SAT Solver’s Opinion on the Erdős-Faber-Lovász Conjecture M Kirchweger, T Peitl, S Szeider 26th International Conference on Theory and Applications of Satisfiability …, 2023 | 3 | 2023 |
| A Survey on Parameterized Complexity and SAT S Szeider | | 2015 |
| A time leap challenge for SAT-solving JK Fichte, M Hecher, S Szeider International Conference on Principles and Practice of Constraint …, 2020 | 31 | 2020 |
Serge GaspersProfessor, UNSW Sydney, AustraliaVerified email at cse.unsw.edu.au