Sebastian Ordyniak

Recent Publications

A General Theoretical Framework for Learning Smallest Interpretable Models
AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy and Sriraam Natarajan), pages 10662-10669, 2024, AAAI Press.
Backdoor DNFs
Journal of Computer and System Sciences, volume 144, pages 103547, 2024.
Learning Small Decision Trees for Data of Low Rank-Width
AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy and Sriraam Natarajan), pages 10476-10483, 2024, AAAI Press.
SAT backdoors: Depth beats size
Journal of Computer and System Sciences, volume 142, pages 103520, 2024.
Learning Small Decision Trees with Large Domain
The 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), August 19–25, 2023, Macao, S.A.R. (Edith Elkind), pages 3184-3192, 2023, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track
The Parameterized Complexity of Finding Concise Local Explanations
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 3312-3320, 2023, ijcai.org.
CSP Beyond Tractable Constraint Languages
28th International Conference on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel (Christine Solnon), volume 235 of LIPIcs, pages 20:1-20:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Finding a Cluster in Incomplete Data
30th Annual European Symposium on Algorithms (ESA 2022) (Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1-47:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Backdoor DNFs
2021, Technical report AC-TR-21-001, Algorithms and Complexity Group, TU Wien.
Backdoor DNFs
Proceeding of IJCAI-2021, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou), pages 1403-1409, 2021.
Parameterized Complexity of Small Decision Tree Learning
2021, Technical report AC-TR-21-002, Algorithms and Complexity Group, TU Wien.
Parameterized Complexity of Small Decision Tree Learning
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 6454-6462, 2021, AAAI Press.
A Join-Based Hybrid Parameter for Constraint Satisfaction
2019, Technical report AC-TR-19-006, Algorithms and Complexity Group, TU Wien.
A Join-Based Hybrid Parameter for Constraint Satisfaction
Proceedings of CP 2019, the 25th International Conference on Principles and Practice of Constraint Programming (Thomas Schiex and Simon de Givry), volume 11802 of Lecture Notes in Computer Science, pages 195-212, 2019, Springer Verlag.
Group Activity Selection with Few Agent Types
27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany (Michael A. Bender and Ola Svensson and Grzegorz Herman), pages 48:1-48:16, 2019.
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths
Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers (Ignasi Sau and Dimitrios M. Thilikos), pages 190-204, 2019.
SAT-Encodings for Special Treewidth and Pathwidth
2017, Technical report AC-TR-17-012, Algorithms and Complexity Group, TU Wien.
SAT-Encodings for Special Treewidth and Pathwidth
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers and Toby Walsh), volume 10491 of Lecture Notes in Computer Science, pages 429-445, 2017, Springer Verlag.
A SAT Approach to Branchwidth
Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou and Daniel Le Berre), volume 9710 of Lecture Notes in Computer Science, pages 179-195, 2016, Springer Verlag.
Backdoors for Linear Temporal Logic
11th International Symposium on Parameterized and Exact Computation (IPEC 2016) (Jiong Guo and Danny Hermelin), volume 63 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1-23:17, 2016, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
Counting Linear Extensions: Parameterizations by Treewidth
24th European Symposium of Algorithms, ESA 2016, volume 57 of LIPIcs, pages 39:1-39:18, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
On the Complexity Landscape of Connected f-factor Problems
Mathematical Foundations of Computer Science 2016 - 41st International Symposium, MFCS 2016 (Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier), pages 41:1-41:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Upper and Lower Bounds for Weak Backdoor Set Detection
Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo and Allen Van Gelder), volume 7962 of Lecture Notes in Computer Science, pages 394-402, 2013, Springer Verlag.
Don't Be Strict in Local Search!
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann and Bart Selman), 2012, AAAI Press.
On Finding Optimal Polytrees
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann and Bart Selman), 2012, AAAI Press.
The Complexity of Planning Revisited - A Parameterized Analysis
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann and Bart Selman), 2012, AAAI Press.
Augmenting Tractable Fragments of Abstract Argumentation
Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 (Toby Walsh), pages 1033-1038, 2011, AAAI Press/IJCAI.
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)
Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings (Karem A. Sakallah and Laurent Simon), volume 6695 of Lecture Notes in Computer Science, pages 47-60, 2011, Springer Verlag.
Algorithms and Complexity Results for Exact Bayesian Structure Learning
Proceedings of UAI 2010, The 26th Conference on Uncertainty in Artificial Intelligence, Catalina Island, California, USA, July 8-11, 2010 (Peter Grünwald and Peter Spirtes), 2010, AUAI Press, Corvallis, Oregon.
Algorithms and Complexity Results for Persuasive Argumentation
Computational Models of Argumentation, Proceedings of COMMA 2010 (Pietro Baroni and Federico Cerutti and Massimiliano Giacomin and Guillermo R. Simari), volume 216 of Frontiers in Artificial Intelligence and Applications, pages 311-322, 2010.