| Backdoor dnfs S Ordyniak, A Schidler, S Szeider Journal of Computer and System Sciences 144, 103547, 2024 | 9 | 2024 |
| Explaining Decisions in ML Models: a Parameterized Complexity Analysis S Ordyniak, G Paesani, M Rychlicki, S Szeider arXiv preprint arXiv:2407.15780, 2024 | | 2024 |
| From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem E Eiben, R Ganian, I Kanj, S Ordyniak, S Szeider arXiv preprint arXiv:2407.10699, 2024 | | 2024 |
| SAT-based decision tree learning for large data sets A Schidler, S Szeider Journal of Artificial Intelligence Research 80, 875-918, 2024 | 47 | 2024 |
| Small unsatisfiable -CNFs with bounded literal occurrence T Zhang, T Peitl, S Szeider arXiv preprint arXiv:2405.16149, 2024 | 1 | 2024 |
| SAT-Based Tree Decomposition with Iterative Cascading Policy Selection H Xia, S Szeider Proceedings of the AAAI Conference on Artificial Intelligence 38 (8), 8191-8199, 2024 | | 2024 |
| Hardness of Random Reordered Encodings of Parity for Resolution and CDCL L Chew, A de Colnet, F Slivovsky, S Szeider Proceedings of the AAAI Conference on Artificial Intelligence 38 (8), 7978-7986, 2024 | | 2024 |
| 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 |
| Learning Small Decision Trees for Data of Low Rank-Width KK Dabrowski, E Eiben, S Ordyniak, G Paesani, S Szeider Proceedings of the AAAI Conference on Artificial Intelligence 38 (9), 10476 …, 2024 | 1 | 2024 |
| SAT Modulo Symmetries for Graph Generation and Enumeration M Kirchweger, S Szeider ACM Transactions on Computational Logic, 2024 | 1 | 2024 |
| Improved Circuit Minimization with Exact Synthesis FX Reichl, F Slivovsky, S Szeider | | 2024 |
| SAT Encodings and Beyond (Dagstuhl Seminar 23261) MJH Heule, I Lynce, S Szeider, A Schidler Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2024 | | 2024 |
| Finding a cluster in incomplete data E Eiben, R Ganian, I Kanj, S Ordyniak, S Szeider arXiv preprint arXiv:2312.07628, 2023 | 3 | 2023 |
| Computing optimal hypertree decompositions with SAT A Schidler, S Szeider Artificial Intelligence 325, 104015, 2023 | 26 | 2023 |
| Are hitting formulas hard for resolution? T Peitl, S Szeider Discrete Applied Mathematics 337, 173-184, 2023 | 3 | 2023 |
| Proven Optimally-Balanced Latin Rectangles with SAT VP Ramaswamy, S Szeider # PLACEHOLDER_PARENT_METADATA_VALUE# 280, 2023 | | 2023 |
| Computing Twin-width with SAT and Branch & Bound. A Schidler, S Szeider IJCAI, 2013-2021, 2023 | 3 | 2023 |
| Learning Small Decision Trees with Large Domain. E Eiben, S Ordyniak, G Paesani, S Szeider IJCAI, 3184-3192, 2023 | 7 | 2023 |
| The Parameterized Complexity of Finding Concise Local Explanations. S Ordyniak, G Paesani, S Szeider IJCAI, 3312-3320, 2023 | 3 | 2023 |
| SAT-boosted Tabu Search for Coloring Massive Graphs A Schidler, S Szeider ACM Journal of Experimental Algorithmics 28, 1-19, 2023 | 3 | 2023 |
Serge GaspersProfessor, UNSW Sydney, AustraliaVerified email at cse.unsw.edu.au