Publications: Stefan Szeider

⬅️ ZurΓΌck zum Profil

2026

  • OBDDs, SDDs, and Circuits of Bounded Width: Completeness Matters Alexis De Colnet, Sebastian Ordyniak, Stefan Szeider. Artificial Intelligence
    πŸ“„ Details

  • Backdoors to Satisfaction Continued Serge Gaspers, Stefan Szeider. Computer Science Review
    πŸ“„ Details

  • Graph Choosability via SAT: Beyond the Nullstellensatz Markus Kirchweger, TomΓ‘s Peitl, David Seka, Stefan Szeider. The 40th Annual AAAI Conference on Artificial Intelligence, AAAI-2026
    πŸ“„ Details

  • A General Theoretical Framework for Learning Smallest Interpretable Models Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider. Artificial Intelligence
    πŸ“„ Details

  • Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms Ordyniak, Sebastian, Rychlicki, Mateusz, Szeider, Stefan. The 40th Annual AAAI Conference on Artificial Intelligence, AAAI-2026
    πŸ“„ Details

2025

  • Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach Carlos AnsΓ³tegui, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider, Hai Xia. Computational Science - ICCS 2025 - 25th International Conference, Singapore, July 7-9, 2025, Proceedings, Part II
    πŸ“„ Details

  • Analyzing Reformulation Performance in Core-Guided MaxSAT Solving AndrΓ© Schidler, Stefan Szeider. 28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, August 12-15, 2025, Glasgow, Scotland
    πŸ“„ Details

  • Extracting Problem Structure with LLMs for Optimized SAT Local Search AndrΓ© Schidler, Stefan Szeider. SOCS 2025, The 18th International Symposium on Combinatorial Search. August 12-15, 2025. University of Glasgow, Scotland, United Kingdom
    πŸ“„ Details

  • Large andΒ Parallel Human Sorting Networks Szeider, Stefan. Creative Mathematical Sciences Communication
    πŸ“„ Details

  • Bridging Language Models and Symbolic Solvers via the Model Context Protocol Stefan Szeider. 28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, August 12-15, 2025, Glasgow, Scotland
    πŸ“„ Details

  • SAT Modulo Symmetries: A Survey Stefan Szeider. Satisfiability Checking and Symbolic Computation, 10th International Workshop, SC-Square 2025, Stuttgart, Germany, August 2, 2025, co-located with CADE 2025
    πŸ“„ Details

  • StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamliners Voboril, Florentina, Peruvemba Ramaswamy, Vaidyanathan, Szeider, Stefan. 2025 IEEE/ACM 1st International Workshop on Neuro-Symbolic Software Engineering (NSE)
    πŸ“„ Details

  • Generating Streamlining Constraints with Large Language Models Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider. Journal of Artificial Intelligence Research
    πŸ“„ Details

  • The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators Tianwei Zhang, Stefan Szeider. 31st International Conference on Principles and Practice of Constraint Programming, CP 2025, August 10-15, 2025, Glasgow, Scotland
    πŸ“„ Details

2024

  • Hardness of Random Reordered Encodings of Parity for Resolution and CDCL Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider. AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada
    πŸ“„ Details

  • ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP Chew, Leroy, de Colnet, Alexis, Szeider, Stefan. Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning
    πŸ“„ Details

  • Learning Small Decision Trees for Data of Low Rank-Width Konrad Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider. AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada
    πŸ“„ Details

  • Compilation and Fast Model Counting beyond CNF Alexis de Colnet, Stefan Szeider, Tianwei Zhang. Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24
    πŸ“„ Details

  • SAT backdoors: Depth beats size Jan Dreier, Sebastian Ordyniak, Stefan Szeider. Journal of Computer and System Sciences
    πŸ“„ Details

  • Revisiting Causal Discovery from a Complexity-Theoretic Perspective Robert Ganian, Viktoriia Korchemna, Stefan Szeider. Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24
    πŸ“„ Details

  • SAT Modulo Symmetries for Graph Generation and Enumeration Markus Kirchweger, Stefan Szeider. ACM Transactions on Computational Logic
    πŸ“„ Details

  • Computing small Rainbow Cycle Numbers with SAT modulo Symmetries Markus Kirchweger, Stefan Szeider. The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024
    πŸ“„ Details

  • A General Theoretical Framework for Learning Smallest Interpretable Models Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider. AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada
    πŸ“„ Details

  • Explaining Decisions in ML Models: A Parameterized Complexity Analysis Ordyniak, Sebastian, Paesani, Giacomo, Rychlicki, Mateusz, Szeider, Stefan. Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning
    πŸ“„ Details

  • Backdoor DNFs Sebastian Ordyniak, Andre Schidler, Stefan Szeider. Journal of Computer and System Sciences
    πŸ“„ Details

  • The Power of Collaboration: Learning Large Bayesian Networks at Scale Ramaswamy, Vaidyanathan Peruvemba, Szeider, Stefan, Xia, Hai. 2024 IEEE 36th International Conference on Tools with Artificial Intelligence (ICTAI)
    πŸ“„ Details

  • eSLIM: Circuit Minimization with SAT Based Local Improvement Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider. 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024)
    πŸ“„ Details

  • Improved Circuit Minimization with Exact Synthesis Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider.
    πŸ“„ Details

  • SAT-based Decision Tree Learning for Large Data Sets AndrΓ© Schidler, Stefan Szeider. Journal of Artificial Intelligence Research
    πŸ“„ Details

  • Structure-guided Local Improvement for Maximum Satisfiability AndrΓ© Schidler, Stefan Szeider. The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024
    πŸ“„ Details

  • SAT-Based Tree Decomposition with Iterative Cascading Policy Selection Hai Xia, Stefan Szeider. AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada
    πŸ“„ Details

  • Small unsatisfiable k-CNFs with bounded literal occurrence Tianwei Zhang , TomΓ‘Ε‘ Peitl, Stefan Szeider. 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024)
    πŸ“„ Details

2023

  • Learning Small Decision Trees with Large Domain Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider. The 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), August 19–25, 2023, Macao, S.A.R.
    πŸ“„ Details

  • IPASIR-UP: User Propagators for CDCL Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere. The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy
    πŸ“„ Details

  • Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicity Johannes K. Fichte, Markus Hecher, Stefan Szeider. Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023
    πŸ“„ Details

  • The Silent (R)evolution of SAT Johannes K. Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider. Communications of the ACM
    πŸ“„ Details

  • Co-Certificate Learning with SAT Modulo Symmetries Markus Kirchweger, TomΓ‘Ε‘ Peitl, Stefan Szeider. Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China
    πŸ“„ Details

  • SAT-Based Generation of Planar Graphs Markus Kirchweger, Manfred Scheucher, Stefan Szeider. The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy
    πŸ“„ Details

  • The Parameterized Complexity of Finding Concise Local Explanations Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider. Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China
    πŸ“„ Details

  • Are Hitting Formulas Hard for Resolution? TomΓ‘Ε‘ Peitl, Stefan Szeider. Discr. Appl. Math.
    πŸ“„ Details

  • Circuit Minimization with QBF-Based Exact Synthesis Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider. Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023
    πŸ“„ Details

  • Circuit Minimization with Exact Synthesis: From QBF Back to SAT Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider. Proceedings of the 32nd International Workshop on Logic & Synthesis (IWLS)
    πŸ“„ Details

  • Computing twin-width with SAT and branch & bound Andre Schidler, Stefan Szeider. The 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), August 19–25, 2023, Macao, S.A.R.
    πŸ“„ Details

  • SAT-Boosted Tabu Search for Coloring Massive Graphs Andre Schidler, Stefan Szeider. J. Exp. Algorithmics
    πŸ“„ Details

  • Computing optimal hypertree decompositions with SAT AndrΓ© Schidler, Stefan Szeider. Artificial Intelligence
    πŸ“„ Details

  • Proven optimally-balanced Latin rectangles with SAT Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider. Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming
    πŸ“„ Details

  • Searching for smallest universal graphs and tournaments with SAT Tianwei Zhang, Stefan Szeider. Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming
    πŸ“„ Details

2022

  • CSP Beyond Tractable Constraint Languages Jan Dreier, Sebastian Ordyniak, Stefan Szeider. 28th International Conference on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel
    πŸ“„ Details

  • Tractable Abstract Argumentation via Backdoor-Treewidth Wolfgang Dvorak, Markus Hecher, Matthias KΓΆnig, Andre Schidler, Stefan Szeider, Stefan Woltran. Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022
    πŸ“„ Details

  • Finding a Cluster in Incomplete Data Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider. 30th Annual European Symposium on Algorithms (ESA 2022)
    πŸ“„ Details

  • Sum-of-Products with Default Values: Algorithms and Complexity Results Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider. Journal of Artificial Intelligence Research
    πŸ“„ Details

  • Algorithmic Applications of Tree-Cut Width Robert Ganian, Eun Jung Kim, Stefan Szeider. SIAM J. Discrete Math.
    πŸ“„ Details

  • Threshold Treewidth and Hypertree Width Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider. Journal of Artificial Intelligence Research
    πŸ“„ Details

  • Weighted Model Counting with Twin-Width Robert Ganian, Filip Pokr ́yvka, Andre Schidler, Kirill Simonov, Stefan Szeider. 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel
    πŸ“„ Details

  • A SAT Attack on Rota’s Basis Conjecture Markus Kirchweger, Manferd Scheucher, Stefan Szeider. 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel
    πŸ“„ Details

  • A SAT Approach to Twin-Width AndrΓ© Schidler, Stefan Szeider. Proceedings of ALENEX 2022, the 24nd SIAM Symposium on Algorithm Engineering and Experiments
    πŸ“„ Details

  • Learning Large Bayesian Networks with Expert Constraints Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider. 38th Conference on Uncertainty in Artificial Intelligence (UAI 2022), Eindhoven, Netherlands, August 1–5, 2022
    πŸ“„ Details

2021

  • The Parameterized Complexity of Clustering Incomplete Data Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider. Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence
    πŸ“„ Details

  • New Width Parameters for SAT and Sharp-SAT Ganian, Robert, Szeider, Stefan. Artificial Intelligence
    πŸ“„ Details

  • SAT Modulo Symmetries for Graph Generation Markus Kirchweger, Stefan Szeider. Proceeings of CP 2021, the 27th International Conference on Principles and Practice of Constraint Programming
    πŸ“„ Details

  • Backdoor DNFs Sebastian Ordyniak, Andre Schidler, Stefan Szeider. Proceeding of IJCAI-2021, the 30th International Joint Conference on Artificial Intelligence
    πŸ“„ Details

  • Parameterized Complexity of Small Decision Tree Learning Sebastian Ordyniak, AndrΓ© Schidler, Stefan Szeider. Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence
    πŸ“„ Details

  • Finding the Hardest Formulas for Resolution (Extended Abstract) TomΓ‘Ε‘ Peitl, Stefan Szeider. Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence
    πŸ“„ Details

  • Finding the Hardest Formulas for Resolution TomΓ‘Ε‘ Peitl, Stefan Szeider. Journal of Artificial Intelligence Research
    πŸ“„ Details

  • Certified DQBF Solving by Definition Extraction Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings
    πŸ“„ Details

  • Fixed-Parameter Tractability Marko Samer, Stefan Szeider. Handbook of Satisfiability, 2nd Edition
    πŸ“„ Details

  • SAT-based Decision Tree Learning for Large Data Sets AndrΓ© Schidler, Stefan Szeider. Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence
    πŸ“„ Details

  • Computing Optimal Hypertree Decompositions with SAT Andre Schidler, Stefan Szeider. Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence
    πŸ“„ Details

  • Turbocharging Treewidth-Bounded Bayesian Network Structure Learning Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider. Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence
    πŸ“„ Details

  • Learning fast-inference Bayesian networks Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider. Proceedings of NeurIPS 2021, the Thirty-fifth Conference on Neural Information Processing Systems
    πŸ“„ Details

2020

  • A Time Leap Challenge for SAT-Solving Johannes K. Fichte, Markus Hecher, Stefan Szeider. Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming
    πŸ“„ Details

  • Breaking Symmetries with RootClique and LexTopsort Johannes K. Fichte, Markus Hecher, Stefan Szeider. Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming
    πŸ“„ Details

  • On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider. Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York
    πŸ“„ Details

  • On the Parameterized Complexity of Clustering Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider.
    πŸ“„ Details

  • Threshold Treewidth and Hypertree Width Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider. Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence
    πŸ“„ Details

  • Formalizing Graph Trail Properties in Isabelle/HOL Laura KovΓ‘cs, Hanna Lachnitt, Stefan Szeider. Intelligent Computer Mathematics - 13th International Conference, CICM 2020, Bertinoro, Italy, July 26-31, 2020, Proceedings
    πŸ“„ Details

  • Finding the Hardest Formulas for Resolution TomΓ‘Ε‘ Peitl, Stefan Szeider. Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming
    πŸ“„ Details

  • Computing Optimal Hypertree Decompositions AndrΓ© Schidler, Stefan Szeider. Proceedings of ALENEX 2020, the 22nd SIAM Symposium on Algorithm Engineering and Experiments
    πŸ“„ Details

  • Short Q-Resolution Proofs with Homomorphisms Ankit Shukla, Friedrich Slivovsky, Stefan Szeider. Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing
    πŸ“„ Details

  • A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth Friedrich Slivovsky, Stefan Szeider. Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing
    πŸ“„ Details

  • MaxSAT-Based Postprocessing for Treedepth Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider. Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming
    πŸ“„ Details

2019

  • Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy de Haan, Ronald, Stefan Szeider. MDPI Algorithms
    πŸ“„ Details

  • The Parameterized Complexity of Cascading Portfolio Scheduling Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider. Proceedings of NeurIPS 2019, the Thirty-third Conference on Neural Information Processing Systems
    πŸ“„ Details

  • SAT-Encodings for Treecut Width and Treedepth Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider. Proceedings of ALENEX 2019, the 21st Workshop on Algorithm Engineering and Experiments
    πŸ“„ Details

  • A Join-Based Hybrid Parameter for Constraint Satisfaction Robert Ganian, Sebastian Ordyniak, Stefan Szeider. Proceedings of CP 2019, the 25th International Conference on Principles and Practice of Constraint Programming
    πŸ“„ Details

  • A SAT Approach to Branchwidth Neha Lodha, Sebastian Ordyniak, Stefan Szeider. ACM Transactions on Computational Logic
    πŸ“„ Details

  • On the Parameterized Complexity of (k,s)-SAT DaniΓ«l~Paulusma, Stefan Szeider. Information Processing Letters
    πŸ“„ Details

  • Long-Distance Q-Resolution with Dependency Schemes TomΓ‘Ε‘ Peitl, Friedrich Slivovsky, Stefan Szeider. Journal of Automated Reasoning
    πŸ“„ Details

  • Dependency Learning for QBF TomΓ‘Ε‘ Peitl, Friedrich Slivovsky, Stefan Szeider. Journal of Artificial Intelligence Research
    πŸ“„ Details

  • Combining Resolution-Path Dependencies with Dependency Learning TomΓ‘Ε‘ Peitl, Friedrich Slivovsky, Stefan Szeider. Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal
    πŸ“„ Details

  • Proof Complexity of Fragments of Long-Distance Q-resolution TomΓ‘Ε‘ Peitl, Friedrich Slivovsky, Stefan Szeider. Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal
    πŸ“„ Details

2018

  • Solving Problems on Graphs of High Rank-Width Eduard Eiben, Robert Ganian, Stefan Szeider. Algorithmica
    πŸ“„ Details

  • An SMT Approach to Fractional Hypertree Width Johannes K. Fichte, Markus Hecher, Neha Lodha, Stefan Szeider. Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming
    πŸ“„ Details

  • Parameterized Algorithms for the Matrix Completion Problem Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider. Proceeding of ICML, the Thirty-fifth International Conference on Machine Learning, Stockholm, July 10–15, 2018
    πŸ“„ Details

  • Sum-of-Products with Default Values: Algorithms and Complexity Results Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider. Proceedings of ICTAI 2018, the 30th IEEE International Conference on Tools with Artificial Intelligence
    πŸ“„ Details

  • Portfolio-Based Algorithm Selection for Circuit QBFs Hoos, Holger H., Peitl, TomΓ‘Ε‘, Slivovsky, Friedrich, Szeider, Stefan. Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming
    πŸ“„ Details

  • Portfolio Solvers for QDIMACS and QCIR Hoos, Holger H., Peitl, TomΓ‘Ε‘, Slivovsky, Friedrich, Szeider, Stefan.
    πŸ“„ Details

  • On the Parameterized Complexity of (k,s)-SAT DaniΓ«l~Paulusma, Stefan Szeider.
    πŸ“„ Details

  • Polynomial-Time Validation of QCDCL Certificates TomΓ‘Ε‘ Peitl, Friedrich Slivovsky, Stefan Szeider. Proceedings of SAT 2018, the 21st International Conference on Theory and Applications of Satisfiability Testing, Part of FLoC 2018, July 9–12, 2018, Oxford, UK
    πŸ“„ Details

2017

  • Circuit Treewidth, Sentential Decision, and Query Compilation Simone Bova, Stefan Szeider. Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017
    πŸ“„ Details

  • Parameterized Complexity Classes Beyond Para-NP Ronald de Haan, Stefan Szeider. Journal of Computer and System Sciences
    πŸ“„ Details

  • SAT-Based Local Improvement for Finding Tree Decompositions of Small Width Johannes K. Fichte, Neha Lodha, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings
    πŸ“„ Details

  • Backdoor Trees for Answer Set Programming Johannes Klaus Fichte, Stefan Szeider. Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning, ASPOCP@LPNMR 2017, Espoo, Finland, July 3, 2017.
    πŸ“„ Details

  • Combining Treewidth and Backdoors for CSP Robert Ganian, M. S. Ramanujan, Stefan Szeider. 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
    πŸ“„ Details

  • Backdoor Treewidth for SAT Robert Ganian, M. S. Ramanujan, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings
    πŸ“„ Details

  • New Width Parameters for Model Counting Robert Ganian, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings
    πŸ“„ Details

  • Backdoors into heterogeneous classes of SAT and CSP Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny. Journal of Computer and System Sciences
    πŸ“„ Details

  • Backdoor Sets for CSP Serge Gaspers, Sebastian Ordyniak, Stefan Szeider. The Constraint Satisfaction Problem: Complexity and Approximability
    πŸ“„ Details

  • On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instances de Haan, Ronald, Kanj, Iyad, Szeider, Stefan. ACM Transactions on Computational Logic
    πŸ“„ Details

  • SAT-Encodings for Special Treewidth and Pathwidth Neha Lodha, Sebastian Ordyniak, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings
    πŸ“„ Details

  • A SAT Approach to Branchwidth Neha Lodha, Sebastian Ordyniak, Stefan Szeider. Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017
    πŸ“„ Details

  • The Treewidth of Proofs Moritz MΓΌller, Stefan Szeider. Information and Computation
    πŸ“„ Details

  • Dependency learning for QBF TomΓ‘Ε‘ Peitl, Friedrich Slivovsky, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings
    πŸ“„ Details

  • Long-Distance Q-Resolution with Dependency Schemes TomΓ‘Ε‘ Peitl, Friedrich Slivovsky, Stefan Szeider.
    πŸ“„ Details

  • Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable M. S. Ramanujan, Stefan Szeider. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA
    πŸ“„ Details

2016

  • Positive and Negative Results for Parameterized Compilability Simone Bova, Ronald de Haan, Neha Lodha, Stefan Szeider.
    πŸ“„ Details

  • Model Checking Existential Logic on Partially Ordered Sets Simone Bova, Robert Ganian, Stefan Szeider. ACM Transactions on Computational Logic
    πŸ“„ Details

  • Quantified Conjunctive Queries on Partially Ordered Sets Simone Bova, Robert Ganian, Stefan Szeider. Theoretical Computer Science
    πŸ“„ Details

  • Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics Ronald de Haan, Stefan Szeider. Proceedings of KR 2016, the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning, Cape Town, South Africa, April 25-29, 2016
    πŸ“„ Details

  • Parameterized Complexity Results for Agenda Safety in Judgment Aggregation Ulle Endriss, Ronald de Haan, Stefan Szeider.
    πŸ“„ Details

  • On Existential MSO and its Relation to ETH Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider. 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
    πŸ“„ Details

  • Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting Robert Ganian, M. S. Ramanujan, Stefan Szeider. Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016
    πŸ“„ Details

  • Backdoors to Tractable Valued CSP Robert Ganian, M.S. Ramanujan, Stefan Szeider. Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings
    πŸ“„ Details

  • Meta-Kernelization with Structural Parameters Robert Ganian, Friedrich Slivovsky, Stefan Szeider. Journal of Computer and System Sciences
    πŸ“„ Details

  • Backdoors to q-Horn Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider. Algorithmica
    πŸ“„ Details

  • A SAT Approach to Branchwidth Neha Lodha, Sebastian Ordyniak, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings
    πŸ“„ Details

  • Model Counting for CNF Formulas of Bounded Modular Treewidth DaniΓ«l Paulusma, Friedrich Slivovsky, Stefan Szeider. Algorithmica
    πŸ“„ Details

  • Long Distance Q-Resolution with Dependency Schemes TomΓ‘Ε‘ Peitl, Friedrich Slivovsky, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings
    πŸ“„ Details

  • Soundness of Q-resolution with dependency schemes Friedrich Slivovsky, Stefan Szeider. Theoretical Computer Science
    πŸ“„ Details

  • Quantifier reordering for QBF Slivovsky, Friedrich, Szeider, Stefan. Journal of Automated Reasoning
    πŸ“„ Details

2015

  • A complete parameterized complexity analysis of bounded planning BΓ€ckstrΓΆm, Christer, Jonsson, Peter, Ordyniak, Sebastian, Szeider, Stefan. Journal of Computer and System Sciences
    πŸ“„ Details

  • On the Subexponential-Time Complexity of CSP Ronald de Haan, Iyad A. Kanj, Stefan Szeider. Journal of Artificial Intelligence Research
    πŸ“„ Details

  • Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP Ronald de Haan, Stefan Szeider. *SOFSEM 2015: Theory and Practice of Computer Science

  • 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod SnΔ›ΕΎkou, Czech Republic, January 24-29,

  1. Proceedings*
    πŸ“„ Details

  • Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics Ronald de Haan, Stefan Szeider.
    πŸ“„ Details

  • Solving Problems on Graphs of High Rank-Width Eduard Eiben, Robert Ganian, Stefan Szeider. Algorithms and Data Structures Symposium (WADS 2015), August 5-7, 2015, University of Victoria, BC, Canada
    πŸ“„ Details

  • Meta-Kernelization using Well-Structured Modulators Eduard Eiben, Robert Ganian, Stefan Szeider. Parameterized and Exact Computation - 10th International Symposium, IPEC 2014, Patras, Greece, September 16-18, 2015. Revised Selected Papers
    πŸ“„ Details

  • Parameterized Complexity Results for Agenda Safety in Judgment Aggregation Ulle Endriss, Ronald de Haan, Stefan Szeider. Proceedings of AAMAS 2015, the 14th International Conference on Autonomous Agents and Multiagent Systems
    πŸ“„ Details

  • Backdoors to Tractable Answer Set Programming Johannes Klaus Fichte, Stefan Szeider. Artificial Intelligence
    πŸ“„ Details

  • Backdoors to Normality for Disjunctive Logic Programs Johannes Klaus Fichte, Stefan Szeider. ACM Transactions on Computational Logic
    πŸ“„ Details

  • Algorithmic Applications of Tree-Cut Width Robert Ganian, Eun Jung Kim, Stefan Szeider. Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II
    πŸ“„ Details

  • Community Structure Inspired Algorithms for SAT and #SAT Robert Ganian, Stefan Szeider. 18th International Conference on Theory and Applications of Satisfiability Testing (SAT 2015), September 24-27, 2015, Austin, Texas
    πŸ“„ Details

  • On finding optimal polytrees Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider. Theoretical Computer Science
    πŸ“„ Details

  • A SAT Approach to Clique-Width Marijn Heule, Stefan Szeider. ACM Transactions on Computational Logic
    πŸ“„ Details

  • Parameterized and subexponential-time complexity of satisfiability problems and applications Iyad A. Kanj, Stefan Szeider. Theoretical Computer Science
    πŸ“„ Details

2014

  • Model checking existential logic on partially ordered sets Simone Bova, Robert Ganian, Stefan Szeider. Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS ‘14, Vienna, Austria, July 14 - 18, 2014
    πŸ“„ Details

  • Quantified Conjunctive Queries on Partially Ordered Sets Simone Bova, Robert Ganian, Stefan Szeider. Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers
    πŸ“„ Details

  • Small Unsatisfiable Subsets in Constraint Satisfaction Ronald de Haan, Iyad A. Kanj, Stefan Szeider. 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, Cyprus, November 10-12, 2014
    πŸ“„ Details

  • Subexponential Time Complexity of CSP with Global Constraints Ronald de Haan, Iyad A. Kanj, Stefan Szeider. Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings
    πŸ“„ Details

  • The Parameterized Complexity of Reasoning Problems Beyond NP de Haan, Ronald, Stefan Szeider. Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014
    πŸ“„ Details

  • Fixed-Parameter Tractable Reductions to SAT de Haan, Ronald, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings
    πŸ“„ Details

  • Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy de Haan, Ronald, Stefan Szeider.
    πŸ“„ Details

  • Parameterized Complexity Results for Agenda Safety in Judgment Aggregation Endriss, Ulle, de Haan, Ronald, Stefan Szeider. Proceedings of ComSoc'14, Fifth International Workshop on Computational Social Choice Pittsburgh, Pennsylvania, June 23-25, 2014
    πŸ“„ Details

  • Backdoors into Heterogeneous Classes of SAT and CSP Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny. Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27-31, 2014, QuΓ©bec City, QuΓ©bec, Canada.
    πŸ“„ Details

  • Guarantees and limits of preprocessing in constraint satisfaction and reasoning Gaspers, Serge, Szeider, Stefan. Artificial Intelligence
    πŸ“„ Details

  • Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications Iyad A. Kanj, Stefan Szeider. Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings
    πŸ“„ Details

  • Tractable answer-set programming with weight constraints: bounded treewidth is not enough Reinhard Pichler, Stefan RΓΌmmele, Stefan Szeider, Stefan Woltran. Theory Pract. Log. Program.
    πŸ“„ Details

  • Variable Dependencies and Q-Resolution Friedrich Slivovsky, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings
    πŸ“„ Details

2013

  • Parameterized Complexity and Kernel Bounds for Hard Planning Problems Christer BΓ€ckstrΓΆm, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider. *Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24,
  1. Proceedings*
    πŸ“„ Details

  • Local Backbones Ronald de Haan, Iyad A. Kanj, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings
    πŸ“„ Details

  • Parameterized Complexity Results for Plan Reuse Ronald de Haan, Anna Roubickova, Stefan Szeider. Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA
    πŸ“„ Details

  • Backdoors to Normality for Disjunctive Logic Programs Johannes Klaus Fichte, Stefan Szeider. Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA
    πŸ“„ Details

  • Backdoors to q-Horn Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider. 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany
    πŸ“„ Details

  • Strong Backdoors to Bounded Treewidth SAT Serge Gaspers, Stefan Szeider. 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA
    πŸ“„ Details

  • A SAT Approach to Clique-Width Marijn Heule, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings
    πŸ“„ Details

  • On the Subexponential Time Complexity of CSP Iyad Kanj, Stefan Szeider. Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA
    πŸ“„ Details

  • The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider. Theory and Applications of Formal Argumentation - Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected papers
    πŸ“„ Details

  • Upper and Lower Bounds for Weak Backdoor Set Detection Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings
    πŸ“„ Details

  • Revisiting Space in Proof Complexity: Treewidth and Pathwidth Moritz MΓΌller, Stefan Szeider. Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings
    πŸ“„ Details

  • Satisfiability of acyclic and almost acyclic CNF formulas Sebastian Ordyniak, DaniΓ«l Paulusma, Stefan Szeider. Theoretical Computer Science
    πŸ“„ Details

  • Parameterized Complexity Results for Exact Bayesian Network Structure Learning Sebastian Ordyniak, Stefan Szeider. Journal of Artificial Intelligence Research
    πŸ“„ Details

  • Model Counting for CNF Formulas of Bounded Modular Treewidth DaniΓ«l Paulusma, Friedrich Slivovsky, Stefan Szeider. 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany
    πŸ“„ Details

  • Backdoors to Abduction Andreas Pfandler, Stefan RΓΌmmele, Stefan Szeider. Proceedings of IJCAI 2013, the 23th International Joint Conference on Artificial Intelligence, August 3-9, 2013, Beijing, China
    πŸ“„ Details

  • Model Counting for Formulas of Bounded Clique-Width Friedrich Slivovsky, Stefan Szeider. Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings
    πŸ“„ Details

  • The Parameterized Complexity of Constraint Satisfaction and Reasoning Stefan Szeider. Applications of Declarative Programming and Knowledge Management - 19th International Conference, INAP 2011, and 25th Workshop on Logic Programming, WLP 2011, Vienna, Austria, September 28-30, 2011, Revised Selected Papers
    πŸ“„ Details

  • Capturing Structure in Hard Combinatorial Problems Stefan Szeider. 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, Herndon, VA, USA, November 4-6, 2013
    πŸ“„ Details

2012

  • The Complexity of Planning Revisited - A Parameterized Analysis Christer BΓ€ckstrΓΆm, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider. Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada
    πŸ“„ Details

  • Augmenting tractable fragments of abstract argumentation DvorΓ‘k, Sebastian Ordyniak, Stefan Szeider. Artificial Intelligence
    πŸ“„ Details

  • Abstract Argumentation via Monadic Second Order Logic Wolfgang DvorΓ‘k, Stefan Szeider, Stefan Woltran. Scalable Uncertainty Management - 6th International Conference, SUM 2012, Marburg, Germany, September 17-19, 2012. Proceedings
    πŸ“„ Details

  • Backdoors to Tractable Answer-Set Programming Johannes Klaus Fichte, Stefan Szeider.
    πŸ“„ Details

  • k-Gap Interval Graphs Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger. *LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20,

  1. Proceedings*
    πŸ“„ Details

  • Don’t Be Strict in Local Search! Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider. Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada
    πŸ“„ Details

  • On Finding Optimal Polytrees Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider. Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada
    πŸ“„ Details

  • Backdoors to Satisfaction Serge Gaspers, Stefan Szeider. The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday
    πŸ“„ Details

  • Backdoors to Acyclic SAT Serge Gaspers, Stefan Szeider. Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I
    πŸ“„ Details

  • Strong Backdoors to Nested Satisfiability Serge Gaspers, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings
    πŸ“„ Details

  • Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo. Algorithmica
    πŸ“„ Details

  • Editing graphs to satisfy degree constraints: a parameterized approach Mathieson, Luke, Szeider, Stefan. Journal of Computer and System Sciences
    πŸ“„ Details

  • Computing Resolution-Path Dependencies in Linear Time Friedrich Slivovsky, Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings
    πŸ“„ Details

  • On graph contractions and induced minors van ’t Hof, Pim, Kami\Ε‰ski, Marcin, Paulusma, DaniΓ«l, Szeider, Stefan, Thilikos, Dimitrios M.. Discr. Appl. Math.
    πŸ“„ Details

2011

  • Solving MAX-r-SAT above a tight lower bound Alon, Noga, Gutin, Gregory, Kim, Eun Jung, Szeider, Stefan, Yeo, Anders. Algorithmica
    πŸ“„ Details

  • Parameterized Proof Complexity Stefan S. Dantchev, Barnaby Martin, Stefan Szeider. Computational Complexity
    πŸ“„ Details

  • On the complexity of some colorful problems parameterized by treewidth Fellows, Michael R., Fomin, Fedor V., Lokshtanov, Daniel, Rosamond, Frances, Saurabh, Saket, Szeider, Stefan, Thomassen, Carsten. Information and Computation
    πŸ“„ Details

  • Backdoors to Tractable Answer-Set Programming Johannes Klaus Fichte, Stefan Szeider. Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011
    πŸ“„ Details

  • Backdoors to Acyclic SAT Serge Gaspers, Stefan Szeider.
    πŸ“„ Details

  • Backdoors to Satisfaction Serge Gaspers, Stefan Szeider.
    πŸ“„ Details

  • The Parameterized Complexity of Local Consistency Serge Gaspers, Stefan Szeider. Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP 2011)
    πŸ“„ Details

  • Kernels for Global Constraints Serge Gaspers, Stefan Szeider. IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011
    πŸ“„ Details

  • A probabilistic approach to problems parameterized above or below tight bounds Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo. Journal of Computer and System Sciences
    πŸ“„ Details

  • Algorithms and Complexity Results for Persuasive Argumentation Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider. Artificial Intelligence
    πŸ“„ Details

  • Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) Sebastian Ordyniak, DaniΓ«l Paulusma, Stefan Szeider. *Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22,

  1. Proceedings*
    πŸ“„ Details

  • Augmenting Tractable Fragments of Abstract Argumentation Sebastian Ordyniak, Stefan Szeider. Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011
    πŸ“„ Details

  • Tractable cases of the extended global cardinality constraint Marko Samer, Stefan Szeider. Constraints
    πŸ“„ Details

  • Monadic Second Order Logic on Graphs with Local Cardinality Constraints Stefan Szeider. ACM Transactions on Computational Logic
    πŸ“„ Details

  • Limits of Preprocessing Stefan Szeider. Proceedings of the Twenty-Fifth Conference on Artificial Intelligence, AAAI 2011
    πŸ“„ Details

  • The parameterized complexity of k-flip local search for SAT and MAX SAT Szeider, Stefan. Discrete Optim.
    πŸ“„ Details

2010

  • Solving MAX-r-SAT Above a Tight Lower Bound Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo. Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010
    πŸ“„ Details

  • Reasoning in Argumentation Frameworks of Bounded Clique-Width DvorΓ‘k, Stefan Szeider, Stefan Woltran. Computational Models of Argumentation, Proceedings of COMMA 2010
    πŸ“„ Details

  • Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo. Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings
    πŸ“„ Details

  • On Contracting Graphs to Fixed Pattern Graphs Pim van ’t Hof, Marcin Kaminski, DaniΓ«l Paulusma, Stefan Szeider, Dimitrios M. Thilikos. SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv MlΓ½n, Czech Republic, January 23-29, 2010. Proceedings
    πŸ“„ Details

  • Algorithms and Complexity Results for Persuasive Argumentation Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider. Computational Models of Argumentation, Proceedings of COMMA 2010
    πŸ“„ Details

  • Satisfiability of Acyclic and Almost Acyclic CNF Formulas Sebastian Ordyniak, DaniΓ«l Paulusma, Stefan Szeider. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India
    πŸ“„ Details

  • Algorithms and Complexity Results for Exact Bayesian Structure Learning Sebastian Ordyniak, Stefan Szeider. Proceedings of UAI 2010, The 26th Conference on Uncertainty in Artificial Intelligence, Catalina Island, California, USA, July 8-11, 2010
    πŸ“„ Details

  • Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough Reinhard Pichler, Stefan RΓΌmmele, Stefan Szeider, Stefan Woltran. Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, May 9-13, 2010
    πŸ“„ Details

  • Algorithms for propositional model counting Samer, Marko, Szeider, Stefan. J. Discrete Algorithms
    πŸ“„ Details

  • Constraint satisfaction with bounded treewidth revisited Marko Samer, Stefan Szeider. Journal of Computer and System Sciences
    πŸ“„ Details

2009

  • Clique-width is NP-complete Fellows, Michael R., Rosamond, Frances A., Rotics, Udi, Szeider, Stefan. SIAM J. Discrete Math.
    πŸ“„ Details

  • Covering graphs with few complete bipartite subgraphs Herbert Fleischner, Egbert Mujuni, DaniΓ«l Paulusma, Stefan Szeider. Theoretical Computer Science
    πŸ“„ Details

  • A Probabilistic Approach to Problems Parameterized above or below Tight Bounds Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo. Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers
    πŸ“„ Details

  • Backdoor sets of quantified Boolean formulas Samer, Marko, Szeider, Stefan. Journal of Automated Reasoning
    πŸ“„ Details

  • The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT Stefan Szeider. Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings
    πŸ“„ Details

  • Matched Formulas and Backdoor Sets Stefan Szeider. J on Satisfiability, Boolean Modeling and Computation
    πŸ“„ Details

2008

  • Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems Georg Gottlob, Stefan Szeider. The Computer Journal
    πŸ“„ Details

  • Fixed-parameter complexity of minimum profile problems Gutin, Gregory, Szeider, Stefan, Yeo, Anders. Algorithmica
    πŸ“„ Details

  • The Parameterized Complexity of Regular Subgraph Problems and Generalizations Luke Mathieson, Stefan Szeider. Proceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22-25, 2008
    πŸ“„ Details

  • Parameterized Graph Editing with Chosen Vertex Degrees Luke Mathieson, Stefan Szeider. Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John’s, NL, Canada, August 21-24, 2008. Proceedings
    πŸ“„ Details

  • Tractable Cases of the Extended Global Cardinality Constraint Marko Samer, Stefan Szeider. Proceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22-25, 2008
    πŸ“„ Details

  • Backdoor Trees Marko Samer, Stefan Szeider. AAAI 08, Twenty-Third Conference on Artificial Intelligence, Chicago, Illinois, July 13-17, 2008
    πŸ“„ Details

  • Monadic Second Order Logic on Graphs with Local Cardinality Constraints Stefan Szeider. Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings
    πŸ“„ Details

  • Parameterized SAT Stefan Szeider. Encyclopedia of Algorithms
    πŸ“„ Details

  • Not So Easy Problems For Tree Decomposable Graphs (invited talk) Stefan Szeider. ICDM 2008, International Conference on Discrete Mathematics, June 6-10, 2008, Mysore, India, Proceedings
    πŸ“„ Details

2007

  • Parameterized Proof Complexity Stefan Dantchev, Barnaby Martin, Stefan Szeider. Proceedings of the 48th Annual Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA
    πŸ“„ Details

  • On the Complexity of Some Colorful Problems Parameterized by Treewidth Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen. Proceedings of COCOA 2007, Combinatorial Optimization and Applications, First International Conference, Xi’an, China, August 14-16, 2007
    πŸ“„ Details

  • Covering Graphs with Few Complete Bipartite Subgraphs Herbert Fleischner, Egbert Mujuni, DaniΓ«l Paulusma, Stefan Szeider. FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings
    πŸ“„ Details

  • The Linear Arrangement Problem Parameterized Above Guaranteed Value Gregory Gutin, Arash Rafiey, Stefan Szeider , Anders Yeo. Theory Comput. Syst.
    πŸ“„ Details

  • Solving #SAT using Vertex Covers Naomi Nishimura, Prabhakar Ragde, Stefan Szeider. Acta Informatica
    πŸ“„ Details

  • Backdoor Sets of Quantified Boolean Formulas Marko Samer, Stefan Szeider. Proceedings of SAT 2007, Tenth International Conference on Theory and Applications of Satisfiability Testing, May 28-31, 2007, Lisbon, Portugal,
    πŸ“„ Details

  • Algorithms for Propositional Model Counting Marko Samer, Stefan Szeider. Proceedings of LPAR 2007, 14th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, October 15-19, 2007 Yerevan, Armenia
    πŸ“„ Details

  • Matched Formulas and Backdoor Sets Stefan Szeider. Proceedings of SAT 2007, Tenth International Conference on Theory and Applications of Satisfiability Testing, May 28-31, 2007, Lisbon, Portugal,
    πŸ“„ Details

  • Without Loss of Generality - Symmetric Reasoning for Resolution Systems (Invited Talk) Stefan Szeider. Proceedings of SymCon'07, Seventh International Workshop on Symmetry and Constraint Satisfaction Problems, satellite workshop of CP 2007, September 23, 2007, Providence, RI, USA
    πŸ“„ Details

2006

  • Clique-width Minimization is NP-hard Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider. Proceedings of STOC 2006; the 38th ACM Symposium on Theory of Computing, Seattle, Washington, USA
    πŸ“„ Details

  • On Finding Short Resolution Refutations and Small Unsatisfiable Subsets Michael R. Fellows, Stefan Szeider, Graham Wrightson. Theoretical Computer Science
    πŸ“„ Details

  • The Linear Arrangement Problem Parameterized Above Guaranteed Value Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo. Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings
    πŸ“„ Details

  • Fixed-Parameter Complexity of Minimum Profile Problems Gregory Gutin, Anders Yeo, Stefan Szeider. Proceedings of IWPEC 2006, 2nd International Workshop on Parameterized and Exact Computation
    πŸ“„ Details

  • A note on unsatisfiable k-CNF formulas with few occurrences per variable Shlomo Hoory, Stefan Szeider. SIAM J. Discrete Math.
    πŸ“„ Details

  • Solving #SAT using Vertex Covers Naomi Nishimura, Prabhakar Ragde, Stefan Szeider. Proceedings of SAT 2006, Ninth International Conference on Theory and Applications of Satisfiability Testing,
    August 12-15, 2006, Seattle, Washington, USA
    πŸ“„ Details

  • Constraint satisfaction with bounded treewidth revisited Marko Samer, Stefan Szeider. Proceedings of CP 2006 , Twelfth International Conference on Principles and Practice of Constraint Programming, September 24-29, 2006, Nantes, France
    πŸ“„ Details

2005

  • On Edge-Colored Graphs Covered by Properly Colored Cycles Herbert Fleischner, Stefan Szeider. Graphs and Combinatorics
    πŸ“„ Details

  • Computing unsatisfiable k-SAT instances with few occurrences per variable Hoory, Shlomo, Szeider, Stefan. Theoretical Computer Science
    πŸ“„ Details

  • Generalizations of matched CNF formulas Stefan Szeider. Ann. Math. Artif. Intell.
    πŸ“„ Details

  • Backdoor Sets for DLL Subsolvers Stefan Szeider. Journal of Automated Reasoning
    πŸ“„ Details

  • The Complexity of Resolution with Generalized Symmetry Rules Stefan Szeider. Theory Comput. Syst.
    πŸ“„ Details

2004

  • On Finding Short Resolution Refutations and Small Unsatisfiable Subsets Michael R. Fellows, Stefan Szeider, Graham Wrightson. 1st International Workshop on Parameterized and Exact Computation (IWPEC 2004)
    πŸ“„ Details

  • Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable Shlomo Hoory, Stefan Szeider. SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings
    πŸ“„ Details

  • Detecting Backdoor Sets with Respect to Horn and Binary Clauses Naomi Nishimura, Prabhakar Ragde, Stefan Szeider. Proceedings of SAT 2004 (Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May, 2004, Vancouver, BC, Canada)
    πŸ“„ Details

  • The Parameterized Complexity of SAT Backdoors Stefan Szeider. Computing: The Australasian Theory Symposium (CATS 2004)
    πŸ“„ Details

  • On fixed-parameter tractable parameterizations of SAT Stefan Szeider. Theory and Applications of Satisfiability, 6th International Conference, SAT 2003, Selected and Revised Papers
    πŸ“„ Details

  • On Theorems Equivalent with Kotzig’s Result on Graphs with Unique 1-Factors Stefan Szeider. Ars Combinatoria
    πŸ“„ Details

  • Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable Stefan Szeider. Journal of Computer and System Sciences
    πŸ“„ Details

2003

  • Finding paths in graphs avoiding forbidden transitions Stefan Szeider. Discr. Appl. Math.
    πŸ“„ Details

  • Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable Stefan Szeider. Proceedings of the 9th International Computing and Combinatorics Conference (COCOON'03)
    πŸ“„ Details

  • The complexity of resolution with generalized symmetry rules Stefan Szeider. Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (STACS'03)
    πŸ“„ Details

  • Homomorphisms of Conjunctive Normal Forms Stefan Szeider. Discr. Appl. Math.
    πŸ“„ Details

2002

  • Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference Fleischner, Herbert, Kullmann, Oliver, Szeider, Stefan. Theoretical Computer Science
    πŸ“„ Details

  • Generalizations of matched CNF formulas Stefan Szeider. Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2002) Cincinnati, Ohio, USA, May 6-9, 2002
    πŸ“„ Details

2001

  • NP-Completeness of Refutability by Literal-Once Resolution Stefan Szeider. IJCAR 2001, Proceedings of the International Joint Conference on Automated Reasoning
    πŸ“„ Details

  • Conjunctive Normal Forms with Bounded Deficiency Stefan Szeider.
    πŸ“„ Details

AC Admin
AC Admin

Website maintainer