Items where authors include "Szeider, S"

Proceedings Paper

Eiben, E orcid.org/0000-0003-1935-651X, Ganian, R, Kanj, I et al. (2 more authors) (2023) The Computational Complexity of Concise Hypersphere Classification. In: Proceedings of Machine Learning Research. ICML 2023 Fortieth International Conference on Machine Learning, 23-29 Jul 2023, Honolulu, Hawai. Proceedings of the 40th International Conference on Machine Learning, 202 . PMLR , pp. 9060-9070.

Eiben, E, Ordyniak, S orcid.org/0000-0003-1935-651X, Paesani, G et al. (1 more author) (2023) Learning Small Decision Trees with Large Domain. In: Elkind, E, (ed.) Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence. IJCAI 2023, The 32nd International Joint Conference On Artificial Intelligence, 19-25 Aug 2023, Macau, S.A.R.. International Joint Conferences on Artificial Intelligence , pp. 3184-3192. ISBN 978-1-956792-03-4

Ordyniak, S orcid.org/0000-0003-1935-651X, Paesani, G and Szeider, S (2023) The Parameterized Complexity of Finding Concise Local Explanations. In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence. IJCAI 2023, The 32nd International Joint Conference On Artificial Intelligence, 19-25 Aug 2023, Macau, China. International Joint Conferences on Artificial Intelligence , pp. 3312-3320. ISBN 978-1-956792-03-4

Eiben, E, Ganian, R, Kanj, I et al. (2 more authors) (2022) Finding a Cluster in Incomplete Data. In: Chechik, S, Navarro, G, Rotenberg, E and Herman, G, (eds.) Proceedings of 30th Annual European Symposium on Algorithms (ESA 2022). 30th Annual European Symposium on Algorithms (ESA 2022), 05-07 Sep 2022, Postdam, Germany. Leibniz International Proceedings in Informatics (LIPIcs), 244 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik , 47:1-47:14. ISBN 978-3-95977-247-1

Dreier, J, Ordyniak, S orcid.org/0000-0003-1935-651X and Szeider, S (2022) SAT Backdoors: Depth Beats Size. In: LIPIcs : Leibniz International Proceedings in Informatics. 30th Annual European Symposium on Algorithms (ESA 2022), 05-07 Sep 2022, Postdam, Germany. Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , 46:1-46:18.

Dreier, J, Ordyniak, S orcid.org/0000-0003-1935-651X and Szeider, S (2022) CSP Beyond Tractable Constraint Languages. In: Solnon, C, (ed.) Proceedings of 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). 28th International Conference on Principles and Practice of Constraint Programming (CP 2022), 31 Jul - 05 Aug 2022, Haifa, Israel. Leibniz International Proceedings in Informatics (LIPIcs), 235 . Schloss Dagstuhl , 20:1-20:17. ISBN 978-3-95977-240-2

Eiben, E, Ganian, R, Kanj, I et al. (2 more authors) (2021) The Parameterized Complexity of Clustering Incomplete Data. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence: AAAI-21 Technical Tracks 8. Thirty-Fifth AAAI Conference on Artificial Intelligence, 02-09 Feb 2021, Virtual Event. , pp. 7296-7304. ISBN 978-1-57735-866-4

Ordyniak, S orcid.org/0000-0003-1935-651X and Szeider, S (2021) Parameterized Complexity of Small Decision Tree Learning. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence - AAAI-21 Technical Tracks 7. Thirty-Fifth AAAI Conference on Artificial Intelligence, 02-09 Feb 2021, Virtual. , pp. 6454-6462. ISBN 978-1-57735-866-4

Ganian, R, Kanj, I, Ordyniak, S orcid.org/0000-0003-1935-651X et al. (1 more author) (2020) On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. In: AAAI-20 Technical Tracks 4. The Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20), 07-12 Feb 2020, New York, New York, USA. , pp. 3906-3913. ISBN 978-1-57735-835-0

Ganian, R, Ordyniak, S orcid.org/0000-0003-1935-651X and Szeider, S (2019) A Join-Based Hybrid Parameter for Constraint Satisfaction. In: Lecture Notes in Computer Science. CP 2019: Principles and Practice of Constraint Programming, 30 Sep - 04 Oct 2019, Stamford, CT, USA. Springer Verlag , pp. 195-212. ISBN 978-3-030-30047-0

Ganian, R, Lodha, N, Ordyniak, S orcid.org/0000-0003-1935-651X et al. (1 more author) (2019) SAT-Encodings for Treecut Width and Treedepth. In: 2019 Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX). ALENEX19, 07-08 Jan 2019, San Diego, California, USA. Society for Industrial and Applied Mathematics , pp. 117-129. ISBN 978-1-61197-549-9