| SAT-based decision tree learning for large data sets A Schidler, S Szeider Proceedings of the AAAI conference on artificial intelligence 35 (5), 3904-3912, 2021 | 42 | 2021 |
| A SAT approach to twin-width A Schidler, S Szeider 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2022 | 27 | 2022 |
| Computing optimal hypertree decompositions with SAT A Schidler, S Szeider Artificial Intelligence 325, 104015, 2023 | 26 | 2023 |
| Computing optimal hypertree decompositions A Schidler, S Szeider 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and …, 2020 | 19 | 2020 |
| Towards faster reasoners by using transparent huge pages JK Fichte, N Manthey, J Stecklina, A Schidler International Conference on Principles and Practice of Constraint …, 2020 | 12 | 2020 |
| Weighted model counting with twin-width R Ganian, F Pokrývka, A Schidler, K Simonov, S Szeider arXiv preprint arXiv:2206.01706, 2022 | 10 | 2022 |
| Backdoor dnfs S Ordyniak, A Schidler, S Szeider Available at SSRN 4557633, 2021 | 9 | 2021 |
| Tractable abstract argumentation via backdoor-treewidth W Dvořák, M Hecher, M König, A Schidler, S Szeider, S Woltran Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 5608-5615, 2022 | 8 | 2022 |
| SAT-based local search for plane subgraph partitions (CG challenge) A Schidler 38th International Symposium on Computational Geometry (SoCG 2022), 2022 | 7 | 2022 |
| Computing twin-width with SAT and branch & bound A Schidler, S Szeider Proceedings of the Thirty-Second International Joint Conference on …, 2023 | 3 | 2023 |
| SAT-boosted Tabu Search for Coloring Massive Graphs A Schidler, S Szeider ACM Journal of Experimental Algorithmics 28, 1-19, 2023 | 2 | 2023 |
| Threshold treewidth and hypertree width R Ganian, A Schidler, M Sorge, S Szeider Journal of Artificial Intelligence Research 74, 1687-1713, 2022 | 2 | 2022 |
| Solving the Steiner Tree Problem with few Terminals AS Johannes Klaus Fichte, Markus Hecher ICTAI 2022, 293-300, 2020 | 2* | 2020 |
| A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets R Kiesel, A Schidler 2023 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2023 | 1 | 2023 |
| A solver for the Steiner tree problem with few terminals A Schidler Wien, 2018 | 1 | 2018 |
| SAT Encodings and Beyond (Dagstuhl Seminar 23261) MJH Heule, I Lynce, S Szeider, A Schidler Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2024 | | 2024 |
| Scalability for SAT-based combinatorial problem solving A Schidler Technische Universität Wien, 2023 | | 2023 |
| PACE Solver Description: DAGer-Cutting out Cycles with MaxSAT R Kiesel, A Schidler 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), 2022 | | 2022 |
| SAT Benchmarks based on Hypertree Decompositions A Schidler, S Szeider SAT COMPETITION 2020, 91, 0 | | |
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, AustriaПотвърден имейл адрес: szeider.net
