Stefan Szeider
Univ.Prof. Mag.rer.nat. Dr.rer.nat.

Stefan Szeider

News

  • MCP-DBLP: An MCP server that provides Large Language Models access to the DBLP computer science bibliography database. Paper AI4SC @ AAAI 2026. Software on PiPy.
  • SAT 2026 PC co-chair: website is online
  • New paper on arxiv: What Do LLM Agents Do When Left Alone?
  • MCP Solver, version 3.4 released. A Model Context Protocol (MCP) server that exposes SAT, SMT, and constraint-solving capabilities to Large Language Models. Supports MiniZinc (CP), PySAT (SAT, MaxSAT),  Z3 (SMT), and clingo (ASP).  Paper published at SAT 2025.
  • Agentic Python Coder, version 1.0.0 released [GitHub] [paper]
  • Invited speaker at SC2 2025. Workshop affiliated with CADE 2025, 10th International Workshop on Satisfiability Checking and Symbolic Computation, August 2, 2025, Stuttgart, Germany
  • Invited speaker at LLM-Solve 2025. Joint talk with PTHG, Workshop on LLMs meet Constraint Solving, CP/SAT 2025,  August 11, 202,5 Glasgow, Scotland
  • Invited speaker at PTHG 2025. Joint talk with LM-Solve, Workshop on Progress Towards the Holy Grail,  CP/SAT 2025,  August 11, 202,5 Glasgow, Scotland
  • Co-organizer of ML4SP 2025. Workshop on Machine Learning for Solvers and Provers, CP/SAT 2025,  August 10, 202,5 Glasgow, Scotland
  • Invited speaker at NSE 2025. Workshop on Neuro-Symbolic Software Engineering, affiliated with ICSE 2025, May 5, 2025, Ottawa, Canada

Academic Affiliations

I am a full professor and chair at TU Wien, Vienna, Austria, and head of the Algorithms and Complexity Group, and I am a visiting scientist at the Simons Institute for the Theory of Computing, UC Berkeley. Previously, I held academic positions at the University of Durham (UK), the University of Toronto (Canada), and the Austrian Academy of Sciences (Austria).

Academic Activities 

I am a founding co-chair of the Vienna Center for Logic and Algorithms (VCLA),  the chair of the Marie Skłodowska-Curie COFUND  doctoral programme logicCS@TUWien, a key researcher of the Cluster of Excellence Bilateral AI, a full member of the Wolfgang Pauli Institute, a board member of the Center for Artificial Intelligence and Machine Learning (CAIML), the scientific co-organizer of the Vienna Gödel Lectures, and the chair of the jury for the Heinz Zemanek Dissertation Price of the Austrian Computer Society. I am the speaker of the full professors in Computer Science at TU Wien. Previously, I was the deputy speaker of the Doctoral Program Logical Methods in Computer Science (LogiCS),  and coordinator of the research focus Logic and Computation at the Faculty of Informatics, TU Wien.

Research

In my research, I combine algorithmic and logic-based methods to solve hard computational problems that arise in Artificial Intelligence, Automated Reasoning, and Combinatorial Optimization. The design of efficient algorithms is complemented by complexity-theoretic methods for establishing theoretical limits and lower bounds. I have been the principal investigator of several research projects, including projects from the ERC (EU), the EPSRC (UK), the Nuffield Foundation (UK), the FWF (Austria), and the WWTF (Austria). My Erdős Number is 2, and I have published over 200 articles in scientific journals and conference proceedings.

Editorial

I am an Associate Editor of the Journal of Computer and System Sciences (JCSS) and the Journal of Artificial Intelligence Research (JAIR). Previously, I have served on the editorial boards of the Journal of Discrete Algorithms (2014—2018),  Fundamenta Informaticae (2012—2018), and I was a guest editor of Algorithmica (2015) and Discrete Applied Mathematics (2022). I have co-edited the Proceedings of MFCS 2022IPEC 2013, COMMA 2012, and SAT 2010.

Public Outreach

I’m engaged in dissemination activities of Computer Science to children and interested people;  I am a founding member of the initiative ADA (Algorithms Think Differently), curator of the world record human sorting network,  and the initiator of the video competition Algorithms in 60 Seconds. In 2021, I gave a lecture on Algorithms to the Austrian Parliament. I have created a contemporary version of the Garey-Johnson Cartoon and an OBDD representation of the US presidential election 2020 and 2024. Recently, I co-authored a survey article in the Communications of the ACM, which was downloaded over 45000 times. I designed an educational interactive Shannon Linguistic Playground. Here is some recent media coverage.

Awards and Prizes

I received a Highlighted Paper Award at SAT 2023 (with Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger,  and Armin Biere), a Best Paper Award at CP 2020 (with Tomas Peitl), and a first prize in the PACE 2019 competition (with Andre Schidler). I was the first Austrian Computer Scientist to receive an award from the European Research Council (ERC Start 2009).

Graduate Students and Postdocs

My current students and postdocs are Markus Kirchweger (PhD),  Tianwei Zhang (PhD), Hai Xia (PhD), Alexis de Colnet (Postdoc), Andre Schidler (PhD 2023, received the Best Dissertation Award 2024, now Postdoc at TU Wien), Vaidyanathan P. R. (PhD 2023, now Postdoc),  Leroy Chew (postdoc),  Tomas Peitl (PhD 2019, now Postdoc), and Jan Dreier (Postdoc). Former Postdocs were Robert Ganian (now Prof. at TU Wien), Sebastian Ordyniak (now Prof. at U Leeds), Simone Bova, Ramanujan Sridharan (now Prof. at U Warwick), Serge Gaspers (now Prof. at UNSW), Neeldhara Misra (now Prof. at IIT Gandhinaga), and Marko Samer. My former graduate students were Neha Lodha (PhD 2019, Best Student paper at SAT 2016, now Mondi Group), Eduard Eiben (PhD 2018, received Austria’s Award of Excellence, now Prof. at RHUL, U London),  Ronald de Haan (PhD 2016, received the Beth Dissertation Prize, now Prof. at U Amsterdam), Johannes Fichte (PhD 2015, now Prof . at Linköping U), Friedrich Slivovsky (PhD 2015, now Prof. at U Liverpool), Luke Mathieson (PhD 2010, now Prof at UT Sydney).

Organization of Scientific Events

I co-organized the Dagstuhl Seminar SAT Encodings and Beyond (2023) and the Workshop on Logic-based Methods in Machine Learning, part of FLoC 2022.  I was the general chair and co-organzier of  the 47th International Symposium on Mathematical Foundations of Computer Science MFCS 2022),  I co-organized the 9th Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2019), I was the chair of the Congress on Algorithms (ALGO 2017), the Symposium on New Frontiers in Knowledge Compilation (2015), the First Symposium on Structure in Hard Combinatorial Problems (2013), the Third Workshop on Kernelization (2011), and the first Workshop on the Parameterized Complexity of Computational Reasoning (2010).  I was the workshop chair at FLoC 2014, overseeing 74 workshops.

Programm Committees

SAT 2026 (PC co-chair), ICLR 2026 (PC), AAAI 2026 (area chair),  IJCAI 2025 (area chair),  NSE@ICSE 20256 (PC), SAT 2025 (PC), AAAI 2025 (area chair), NSE@ICSE 2025 (PC), CP 2024 (PC),  SAT 2024 (PC), AAAI 2024 (area chair) UAI 2023 (PC), SAT 2023 (PC), MFCS 2022 (general chair),  AAAI 2022 (SPC), UAI 2022 (PC), SEA 2022 (PC), UAI 2021 (PC), SOCS 2021 (PC), SAT 2021 (PC),   AAAI 2021 (SPC), NeurIPS 2021 (PC), SOCS 2020 (PC),  NeurIPS 2020 (PC), CP 2020 (PC),  IJCAI-PRICAI 2020 (SPC),  SAT 2020 (PC), CPAIOR 2020 (PC), GROW 2019 (co-chair), SoCS 2019 (PC),  CP 2019 (PC), IJCAI 2019 (SPC), ICALP 2019 (PC), SAT 2018, IJCAI-ECAI 2018 (SPC), ALGO 2017 (chair),  SAT 2017 (PC),  IPEC 2016 (PC), STACS 2016 (PC), SAT 2016 (PC), BeyondNP 2016 (PC), IJCAI 2016 (SPC),  SAT 2015 (PC), IJCAI 2015 (SPC), FLoC 2014 (workshop chair),  ECAI 2014 (PC),  SAT 2014 (PC), STAIRS 2014 (PC),  ECAI 2014 (PC),  ISAIM 2014 (PC),  IPEC 2013 (co-chair),  SAT 2013 (PC), CP 2013 (SPC), QBF 2013 (PC), IJCAI 2013 (SPC), CP 2012 (PC),  AAAI 2012 (PC),  MEMICS 2012 (PC),  SAT 2012 (PC),  SAT 2011 (PC),  NECTAR 2011 (PC),  MFCS 2010 (PC), ISAIM 2010 (PC),  NECTAR 2010 (PC),  SAT 2010 (PC co-chair),  IWPEC 2009 (PC),  IJCAI 2009 (PC),  SAT 2009 (PC),  CATS 2009 (PC), ASCW 2009,  IWPEC 2008 (PC),  AAAI 2008 (PC),  SAT 2008 (PC),  SAT 2007,  SAT 2006 (PC),  WADS 2005 (PC),  SAT 2005 (PC).

Teaching

I am responsible for the Algorithms and Data Structures course (Bachelor’s) and Algorithmics (Master’s).  The former course was nominated for the Best Teaching Award 2022 and the Best Distance Learning Award 2020. I’m also part of the course Ways of Thinking in Informatics , which won a Special Award for Digital Teaching in 2022.

Projects

FWF Cluster of Excellence: Bilateral Artificial Intelligence

ASK-SAT: Alternating Symmetry-Breaking Combinatorial Search with SAT

Exploiting New Types of Structure for Fixed Parameter Tractability

Learning to Solve Quantified Boolean Formulas

Parameterized Compilation

QBF Proofs and Certificates

REVEAL-AI: Revealing and Utilizing the Hidden Structure for Solving Hard Problems in AI

SLIM: SAT Based Local Improvement

STRIDES: Structure Identification with SAT

The Parameterized Complexity of Reasoning Problems

Variable Dependencies of Quantified Boolean Formulas

Recent Publications

Backdoors to Satisfaction Continued
Computer Science Review, volume 60, pages 100868, 2026.
Graph Choosability via SAT: Beyond the Nullstellensatz
The 40th Annual AAAI Conference on Artificial Intelligence, AAAI-2026, 2026.
Note: To appear
Analyzing Reformulation Performance in Core-Guided MaxSAT Solving
28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, August 12-15, 2025, Glasgow, Scotland (Jeremias Berg and Jakob Nordström), volume 341 of LIPIcs, pages 26:1-26:18, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Bridging Language Models and Symbolic Solvers via the Model Context Protocol
28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, August 12-15, 2025, Glasgow, Scotland (Jeremias Berg and Jakob Nordström), volume 341 of LIPIcs, pages 30:1-30:12, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Extracting Problem Structure with LLMs for Optimized SAT Local Search
SOCS 2025, The 18th International Symposium on Combinatorial Search. August 12-15, 2025. University of Glasgow, Scotland, United Kingdom, 2025.
Large and Parallel Human Sorting Networks
Creative Mathematical Sciences Communication (Fernau, Henning and Schwank, Inge and Staub, Jacqueline), pages 194-204, 2025, Springer Nature Switzerland.
SAT Modulo Symmetries: A Survey
Satisfiability Checking and Symbolic Computation, 10th International Workshop, SC-Square 2025, Stuttgart, Germany, August 2, 2025, co-located with CADE 2025, volume 4116 of CEUR Workshop Proceedings, pages 1-11, 2025, CEUR-WS.org.
The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators
31st International Conference on Principles and Practice of Constraint Programming, CP 2025, August 10-15, 2025, Glasgow, Scotland (Maria Garcia de la Banda), volume 340 of LIPIcs, pages 39:1-39:19, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach
Computational Science - ICCS 2025 - 25th International Conference, Singapore, July 7-9, 2025, Proceedings, Part II (Michael H. Lees and Wentong Cai and Siew Ann Cheong and Yi Su and David Abramson and Jack J. Dongarra and Peter M. A. Sloot), volume 15904 of Lecture Notes in Computer Science, pages 35-49, 2025, Springer.
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.
ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP
Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, pages 253-263, 8 2024.
Backdoor DNFs
Journal of Computer and System Sciences, volume 144, pages 103547, 2024.
Compilation and Fast Model Counting beyond CNF
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24 (Kate Larson), pages 3315-3323, 8 2024, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track
Computing small Rainbow Cycle Numbers with SAT modulo Symmetries
The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024 (Paul Shaw), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
eSLIM: Circuit Minimization with SAT Based Local Improvement
27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Chakraborty, Supratik and Jiang, Jie-Hong Roland), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1-23:14, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Explaining Decisions in ML Models: A Parameterized Complexity Analysis
Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, pages 563-573, 8 2024.
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL
AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy and Sriraam Natarajan), pages 7978-7986, 2024, AAAI Press.
Improved Circuit Minimization with Exact Synthesis
2024, Technical report AC-TR-24-001, Algorithms and Complexity Group, TU Wien.
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.
Revisiting Causal Discovery from a Complexity-Theoretic Perspective
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24 (Kate Larson), pages 3377-3385, 8 2024, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track
SAT backdoors: Depth beats size
Journal of Computer and System Sciences, volume 142, pages 103520, 2024.
SAT-based Decision Tree Learning for Large Data Sets
Journal of Artificial Intelligence Research, volume 80, pages 875-918, 2024.
SAT-Based Tree Decomposition with Iterative Cascading Policy Selection
AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy and Sriraam Natarajan), pages 8191-8199, 2024, AAAI Press.
Small unsatisfiable k-CNFs with bounded literal occurrence
27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Chakraborty, Supratik and Jiang, Jie-Hong Roland), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1-31:22, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Structure-guided Local Improvement for Maximum Satisfiability
The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024 (Paul Shaw), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
The Power of Collaboration: Learning Large Bayesian Networks at Scale
2024 IEEE 36th International Conference on Tools with Artificial Intelligence (ICTAI), pages 371-378, 2024.
The Silent (R)evolution of SAT
Communications of the ACM, volume 66, number 6, pages 64-72, June 2023.
Circuit Minimization with Exact Synthesis: From QBF Back to SAT
Proceedings of the 32nd International Workshop on Logic & Synthesis (IWLS), 2023.
Circuit Minimization with QBF-Based Exact Synthesis
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 (Brian Williams and Yiling Chen and Jennifer Neville), pages 4087-4094, 2023, AAAI Press.
Co-Certificate Learning with SAT Modulo Symmetries
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 1944-1953, 2023, ijcai.org.
Note: Main Track
Computing optimal hypertree decompositions with SAT
Artificial Intelligence, volume 325, pages 104015, 2023.
Computing twin-width with SAT and branch & bound
The 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), August 19–25, 2023, Macao, S.A.R. (Edith Elkind), pages 2013-2021, 2023, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track
Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicity
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 (Brian Williams and Yiling Chen and Jennifer Neville), pages 6363-6371, 2023, AAAI Press.
IPASIR-UP: User Propagators for CDCL
The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan and Friedrich Slivovsky), volume 271 of LIPIcs, pages 8:1-8:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
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
Proven optimally-balanced Latin rectangles with SAT
Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap), volume 280 of LIPIcs, pages 48:1-48:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
SAT-Based Generation of Planar Graphs
The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan and Friedrich Slivovsky), volume 271 of LIPIcs, pages 14:1-14:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Searching for smallest universal graphs and tournaments with SAT
Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap), volume 280 of LIPIcs, pages 39:1-39:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
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.
A SAT Approach to Twin-Width
Proceedings of ALENEX 2022, the 24nd SIAM Symposium on Algorithm Engineering and Experiments (Cynthia A. Phillips and Bettina Speckmann), pages 67-77, 2022, SIAM.
A SAT Attack on Rota’s Basis Conjecture
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel and Ofer Strichman), volume 236 of LIPIcs, pages 4:1-4:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
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.
Learning Large Bayesian Networks with Expert Constraints
38th Conference on Uncertainty in Artificial Intelligence (UAI 2022), Eindhoven, Netherlands, August 1–5, 2022 (James Cussens and Kun Zhang), pages 180:1592–1601, 2022.
Tractable Abstract Argumentation via Backdoor-Treewidth
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, pages 5608-5615, 2022, AAAI Press.
Weighted Model Counting with Twin-Width
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel and Ofer Strichman), volume 236 of LIPIcs, pages 15:1-15:17, 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.
Certified DQBF Solving by Definition Extraction
Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li and Felip Manyà), volume 12831 of Lecture Notes in Computer Science, pages 499-517, 2021, Springer.
Certified DQBF Solving by Definition Extraction
2021, Technical report AC-TR-21-010, Algorithms and Complexity Group, TU Wien.
Computing Optimal Hypertree Decompositions with SAT
Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou), 2021.
Finding the Hardest Formulas for Resolution
Journal of Artificial Intelligence Research, volume 72, pages 69-97, 2021.
Note: Conference Award Track, best paper CP 2020
Finding the Hardest Formulas for Resolution (Extended Abstract)
Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou), pages 4814-4818, 2021.
Note: Sister Conferences Best Papers
Fixed-Parameter Tractability
2021, Technical report AC-TR-21-004, Algorithms and Complexity Group, TU Wien.
Note: Chapter 17, Handbook of Satisfiability, 2nd Edition, 2021
Fixed-Parameter Tractability
Chapter in Handbook of Satisfiability, 2nd Edition (Armin Biere and Marijn Heule and Hans van Maaren and Toby Walsh), pages 693-736, 2021, IOS Press.
Learning fast-inference Bayesian networks
Proceedings of NeurIPS 2021, the Thirty-fifth Conference on Neural Information Processing Systems (M. Ranzato and A. Beygelzimer and K. Nguyen and P.S. Liang and J.W. Vaughan and Y. Dauphin), pages 17852-17863, 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.
SAT Modulo Symmetries for Graph Generation
Proceeings of CP 2021, the 27th International Conference on Principles and Practice of Constraint Programming (Laurent D. Michel), pages 39:1–-39:17, 2021, Dagstuhl Publishing.
SAT-based Decision Tree Learning for Large Data Sets
2021, Technical report AC-TR-21-003, Algorithms and Complexity Group, TU Wien.
SAT-based Decision Tree Learning for Large Data Sets
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3904-3912, 2021, AAAI Press.
The Parameterized Complexity of Clustering Incomplete Data
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 7296-7304, 2021, AAAI Press.
Turbocharging Treewidth-Bounded Bayesian Network Structure Learning
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3895-3903, 2021, AAAI Press.
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina and Martina Seidl), volume 12178 of Lecture Notes in Computer Science, pages 267-276, 2020, Springer Verlag.
A Time Leap Challenge for SAT-Solving
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis), volume 12333 of Lecture Notes in Computer Science, pages 267-285, 2020, Springer Verlag.
Breaking Symmetries with RootClique and LexTopsort
2020, Technical report AC-TR-20-010, Algorithms and Complexity Group, TU Wien.
Breaking Symmetries with RootClique and LexTopsort
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis), volume 12333 of Lecture Notes in Computer Science, pages 286-303, 2020, Springer Verlag.
Computing Optimal Hypertree Decompositions
2020, Technical report AC-TR-20-001, Algorithms and Complexity Group, TU Wien.
Computing Optimal Hypertree Decompositions
Proceedings of ALENEX 2020, the 22nd SIAM Symposium on Algorithm Engineering and Experiments (Guy Blelloch and Irene Finocchi), pages 1-11, 2020, SIAM.
Finding the Hardest Formulas for Resolution
2020, Technical report AC-TR-20-008, Algorithms and Complexity Group, TU Wien.
Finding the Hardest Formulas for Resolution
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis), volume 12333 of Lecture Notes in Computer Science, pages 514-530, 2020, Springer Verlag.
Note: Best Paper Award
Formalizing Graph Trail Properties in Isabelle/HOL
2020, Technical report AC-TR-20-012, Algorithms and Complexity Group, TU Wien.
Formalizing Graph Trail Properties in Isabelle/HOL
Intelligent Computer Mathematics - 13th International Conference, CICM 2020, Bertinoro, Italy, July 26-31, 2020, Proceedings (Christoph Benzmüller and Bruce R. Miller), volume 12236 of Lecture Notes in Computer Science, pages 190-205, 2020, Springer Verlag.
MaxSAT-Based Postprocessing for Treedepth
2020, Technical report AC-TR-20-009, Algorithms and Complexity Group, TU Wien.
MaxSAT-Based Postprocessing for Treedepth
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis), volume 12333 of Lecture Notes in Computer Science, pages 478-495, 2020, Springer Verlag.
On the Parameterized Complexity of Clustering
2020, Technical report AC-TR-20-002, Algorithms and Complexity Group, TU Wien.
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank
Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York, pages 3906-3913, 2020, AAAI Press.
Short Q-Resolution Proofs with Homomorphisms
2020, Technical report AC-TR-20-007, Algorithms and Complexity Group, TU Wien.
Short Q-Resolution Proofs with Homomorphisms
Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina and Martina Seidl), volume 12178 of Lecture Notes in Computer Science, pages 412-428, 2020, Springer Verlag.
Threshold Treewidth and Hypertree Width
Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, pages 1898-1904, 2020.
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.
A SAT Approach to Branchwidth
ACM Transactions on Computational Logic, volume 20, number 3, pages 15:1-15:24, 2019.
A SAT Approach to Branchwidth
2019, Technical report AC-TR-19-010, Algorithms and Complexity Group, TU Wien.
Combining Resolution-Path Dependencies with Dependency Learning
2019, Technical report AC-TR-19-005, Algorithms and Complexity Group, TU Wien.
Combining Resolution-Path Dependencies with Dependency Learning
Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota and Inês Lynce), volume 11628 of Lecture Notes in Computer Science, pages 306-318, 2019, Springer Verlag.
Dependency Learning for QBF
Journal of Artificial Intelligence Research, volume 65, pages 180-208, 2019.
Long-Distance Q-Resolution with Dependency Schemes
Journal of Automated Reasoning, volume 63, number 1, pages 127-155, 2019.
On the Parameterized Complexity of (k,s)-SAT
Information Processing Letters, volume 143, pages 34-36, 2019.
Proof Complexity of Fragments of Long-Distance Q-resolution
2019, Technical report AC-TR-19-004, Algorithms and Complexity Group, TU Wien.
Proof Complexity of Fragments of Long-Distance Q-resolution
Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota and Inês Lynce), volume 11628 of Lecture Notes in Computer Science, pages 319-335, 2019, Springer Verlag.
SAT-Encodings for Treecut Width and Treedepth
2019, Technical report AC-TR-19-001, Algorithms and Complexity Group, TU Wien.
SAT-Encodings for Treecut Width and Treedepth
Proceedings of ALENEX 2019, the 21st Workshop on Algorithm Engineering and Experiments (Stephen G. Kobourov and Henning Meyerhenke), pages 117-129, 2019, SIAM.
The Parameterized Complexity of Cascading Portfolio Scheduling
2019, Technical report AC-TR-19-009, Algorithms and Complexity Group, TU Wien.
The Parameterized Complexity of Cascading Portfolio Scheduling
Proceedings of NeurIPS 2019, the Thirty-third Conference on Neural Information Processing Systems (Hanna M. Wallach and Hugo Larochelle and Alina Beygelzimer and Florence d’Alché-Buc and Emily B. Fox and Roman Garnett), pages 7666-7676, 2019.
An SMT Approach to Fractional Hypertree Width
2018, Technical report AC-TR-18-006, Algorithms and Complexity Group, TU Wien.
An SMT Approach to Fractional Hypertree Width
Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker), volume 11008 of Lecture Notes in Computer Science, pages 109-127, 2018, Springer Verlag.
On the Parameterized Complexity of (k,s)-SAT
2018, Technical report AC-TR-18-008, Algorithms and Complexity Group, TU Wien.
Parameterized Algorithms for the Matrix Completion Problem
Proceeding of ICML, the Thirty-fifth International Conference on Machine Learning, Stockholm, July 10–15, 2018, pages 1642-1651, 2018, JMLR.org.
Note: ISSN: 1938-7228
Polynomial-Time Validation of QCDCL Certificates
2018, Technical report AC-TR-18-003, Algorithms and Complexity Group, TU Wien.
Polynomial-Time Validation of QCDCL Certificates
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 (Olaf Beyersdorff and Christoph M. Wintersteiger), volume 10929 of Lecture Notes in Computer Science, pages 253-269, 2018, Springer Verlag.
Portfolio-Based Algorithm Selection for Circuit QBFs
2018, Technical report AC-TR-18-004, Algorithms and Complexity Group, TU Wien.
Portfolio-Based Algorithm Selection for Circuit QBFs
Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker), volume 11008 of Lecture Notes in Computer Science, pages 195-209, 2018, Springer Verlag.
Sum-of-Products with Default Values: Algorithms and Complexity Results
2018, Technical report AC-TR-18-007, Algorithms and Complexity Group, TU Wien.
Sum-of-Products with Default Values: Algorithms and Complexity Results
Proceedings of ICTAI 2018, the 30th IEEE International Conference on Tools with Artificial Intelligence (Lefteri H. Tsoukalas and Éric Grégoire and Miltiadis Alamaniotis), pages 733-737, 2018, IEEE.
A SAT Approach to Branchwidth
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 (Carles Sierra), pages 4894-4898, 2017, ijcai.org.
Note: Sister Conference Best Paper Track
Backdoor Sets for CSP
Chapter in The Constraint Satisfaction Problem: Complexity and Approximability (Andrei A. Krokhin and Stanislav Zivny), volume 7 of Dagstuhl Follow-Ups, pages 137-157, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Backdoor Trees for Answer Set Programming
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. (Bart Bogaerts and Amelia Harrison), volume 1868 of CEUR Workshop Proceedings, 2017, CEUR-WS.org.
Backdoor Treewidth for SAT
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 20-37, 2017, Springer Verlag.
Backdoor Treewidth for SAT
2017, Technical report AC-TR-17-014, Algorithms and Complexity Group, TU Wien.
Backdoors into heterogeneous classes of SAT and CSP
Journal of Computer and System Sciences, volume 85, pages 38-56, 2017.
Circuit Treewidth, Sentential Decision, and Query Compilation
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017 (Emanuel Sallinger and Jan Van den Bussche and Floris Geerts), pages 233-246, 2017, ACM.
Combining Treewidth and Backdoors for CSP
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) (Heribert Vollmer and Vall ́ee), volume 66 of Leibniz International Proceedings in Informatics (LIPIcs), pages 36:1-36:17, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
Dependency Learning for QBF
2017, Technical report AC-TR-17-011, Algorithms and Complexity Group, TU Wien.
Long-Distance Q-Resolution with Dependency Schemes
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 298-313, 2017, Springer Verlag.
New Width Parameters for Model Counting
2017, Technical report AC-TR-17-013, Algorithms and Complexity Group, TU Wien.
New Width Parameters for Model Counting
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 38-52, 2017, Springer Verlag.
Parameterized Complexity Classes Beyond Para-NP
Journal of Computer and System Sciences, volume 87, number AC-TR-17-004, pages 16-57, 2017.
Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA, pages 3929-3935, 2017.
SAT-Based Local Improvement for Finding Tree Decompositions of Small Width
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 401-411, 2017, Springer Verlag.
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.
The Treewidth of Proofs
Information and Computation, volume 255, pages 147-164, 2017.
The Treewidth of Proofs
2017, Technical report AC-TR-17-010, Algorithms and Complexity Group, TU Wien.
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 to Tractable Valued CSP
Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings (Michel Rueher), volume 9892 of Lecture Notes in Computer Science, pages 233-250, 2016, Springer Verlag.
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 1670-1681, 2016.
Long Distance Q-Resolution with Dependency Schemes
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 500-518, 2016, Springer Verlag.
Meta-Kernelization with Structural Parameters
Journal of Computer and System Sciences, volume 82, number 2, pages 333-346, 2016.
On Existential MSO and its Relation to ETH
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) (Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier), volume 58 of Leibniz International Proceedings in Informatics (LIPIcs), pages 42:1-42:14, 2016, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
Parameterized Complexity Results for Agenda Safety in Judgment Aggregation
2016, Technical report AC-TR-16-005, Algorithms and Complexity Group, TU Wien.
Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics
Proceedings of KR 2016, the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning, Cape Town, South Africa, April 25-29, 2016 (Chitta Baral and James P. Delgrande and Frank Wolter), pages 453-462, 2016, AAAI Press.
Positive and Negative Results for Parameterized Compilability
2016, Technical report AC-TR-16-003, Algorithms and Complexity Group, TU Wien.
Quantifier reordering for QBF
Journal of Automated Reasoning, volume 56, number 4, pages 459-477, 2016.
Soundness of Q-resolution with dependency schemes
Theoretical Computer Science, volume 612, pages 83-101, 2016.
A SAT Approach to Clique-Width
ACM Transactions on Computational Logic, volume 16, number 3, pages 24, 2015.
Algorithmic Applications of Tree-Cut Width
Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, volume 9235 of Lecture Notes in Computer Science, pages 348-360, 2015, Springer Verlag.
Backdoors to Normality for Disjunctive Logic Programs
ACM Transactions on Computational Logic, volume 17, number 1, 2015.
Backdoors to Tractable Answer Set Programming
Artificial Intelligence, volume 220, pages 64-103, 3 2015.
Community Structure Inspired Algorithms for SAT and #SAT
18th International Conference on Theory and Applications of Satisfiability Testing (SAT 2015), September 24-27, 2015, Austin, Texas (Marijn Heule and Sean Weaver), pages 223-237, 2015, Springer Verlag.
Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP
2015, Technical report AC-TR-15-009, Algorithms and Complexity Group, TU Wien.
Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP
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, 2015. Proceedings, volume 8939 of Lecture Notes in Computer Science, pages 217-229, 1 2015, Springer Verlag.
Meta-Kernelization using Well-Structured Modulators
Parameterized and Exact Computation - 10th International Symposium, IPEC 2014, Patras, Greece, September 16-18, 2015. Revised Selected Papers (Thore Husfeldt and Iyad A. Kanj), volume 43 of LIPIcs, pages 114-126, 2015.
On finding optimal polytrees
Theoretical Computer Science, volume 592, pages 49-58, 2015.
On the Subexponential-Time Complexity of CSP
Journal of Artificial Intelligence Research, volume 52, pages 203-234, 2015.
Parameterized Complexity Results for Agenda Safety in Judgment Aggregation
Proceedings of AAMAS 2015, the 14th International Conference on Autonomous Agents and Multiagent Systems (Gerhard Weiss and Pinar Yolum and Rafael H. Bordini and Edith Elkind), pages 127-136, 2015, IFAAMAS/ACM.
Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics
2015, Technical report AC-TR-15-002, Algorithms and Complexity Group, TU Wien.
Solving Problems on Graphs of High Rank-Width
Algorithms and Data Structures Symposium (WADS 2015), August 5-7, 2015, University of Victoria, BC, Canada, pages 314-326, 2015, Springer Verlag.
Backdoors into Heterogeneous Classes of SAT and CSP
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27-31, 2014, Québec City, Québec, Canada. (Carla E. Brodley and Peter Stone), pages 2652-2658, 2014, AAAI Press.
Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy
2014, Technical report TR14-143, Electronic Colloquium on Computational Complexity (ECCC).
Fixed-Parameter Tractable Reductions to SAT
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 (Uwe Egly and Carsten Sinz), volume 8561 of Lecture Notes in Computer Science, pages 85-102, 2014, Springer Verlag.
Model checking existential logic on partially ordered sets
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 (Thomas A. Henzinger and Dale Miller), pages 21:1-21:10, 2014, ACM.
Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications
Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings (Zhao Zhang and Lidong Wu and Wen Xu and Ding-Zhu Du), volume 8881 of Lecture Notes in Computer Science, pages 637-651, 2014, Springer Verlag.
Parameterized Complexity Results for Agenda Safety in Judgment Aggregation
Proceedings of ComSoc'14, Fifth International Workshop on Computational Social Choice Pittsburgh, Pennsylvania, June 23-25, 2014, pages 127-136, 2014.
Quantified Conjunctive Queries on Partially Ordered Sets
Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan and Pinar Heggernes), volume 8894 of Lecture Notes in Computer Science, pages 122-134, 2014, Springer Verlag.
Small Unsatisfiable Subsets in Constraint Satisfaction
26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, Cyprus, November 10-12, 2014, pages 429-436, 2014, IEEE.
Subexponential Time Complexity of CSP with Global Constraints
Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings (Barry O’Sullivan), volume 8656 of Lecture Notes in Computer Science, pages 272-288, 2014, Springer Verlag.
The Parameterized Complexity of Reasoning Problems Beyond NP
Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014 (Chitta Baral and Giuseppe De Giacomo and Thomas Eiter), pages 82-91, 2014, AAAI Press.
Variable Dependencies and Q-Resolution
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 (Carsten Sinz and Uwe Egly), volume 8561 of Lecture Notes in Computer Science, pages 269-284, 2014, Springer Verlag.
A SAT Approach to Clique-Width
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 318-334, 2013, Springer Verlag.
Backdoors to Abduction
Proceedings of IJCAI 2013, the 23th International Joint Conference on Artificial Intelligence, August 3-9, 2013, Beijing, China, 2013.
Backdoors to Normality for Disjunctive Logic Programs
Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins and Michael L. Littman), pages 320-337, 2013, The AAAI Press.
Backdoors to q-Horn
30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (Natacha Portier and Thomas Wilke), volume 20 of LIPIcs, pages 67-79, 2013, Leibniz-Zentrum fuer Informatik.
Capturing Structure in Hard Combinatorial Problems
2013 IEEE 25th International Conference on Tools with Artificial Intelligence, Herndon, VA, USA, November 4-6, 2013, pages 897-898, 2013.
Note: invited keynote talk
Local Backbones
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 377-393, 2013, Springer Verlag.
Model Counting for CNF Formulas of Bounded Modular Treewidth
30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (Natacha Portier and Thomas Wilke), volume 20 of LIPIcs, pages 55-66, 2013, Leibniz-Zentrum fuer Informatik.
Model Counting for Formulas of Bounded Clique-Width
Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (Leizhen Cai and Siu-Wing Cheng and Tak Wah Lam), volume 8283 of Lecture Notes in Computer Science, pages 677-687, 2013, Springer Verlag.
On the Subexponential Time Complexity of CSP
Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins and Michael L. Littman), pages 459-465, 2013, The AAAI Press.
Parameterized Complexity and Kernel Bounds for Hard Planning Problems
Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings (Paul G. Spirakis and Maria J. Serna), volume 7878 of Lecture Notes in Computer Science, pages 13-24, 2013, Springer Verlag.
Parameterized Complexity Results for Plan Reuse
Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins and Michael L. Littman), pages 224-231, 2013, The AAAI Press.
Revisiting Space in Proof Complexity: Treewidth and Pathwidth
Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee and Jiri Sgall), volume 8087 of Lecture Notes in Computer Science, pages 704-716, 2013, Springer Verlag.
Strong Backdoors to Bounded Treewidth SAT
54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pages 489-498, 2013, IEEE Computer Society.
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation
Theory and Applications of Formal Argumentation - Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected papers (Elizabeth Black and Sanjay Modgil and Nir Oren), volume 8306 of Lecture Notes in Computer Science, pages 158-175, 2013, Springer Verlag.
The Parameterized Complexity of Constraint Satisfaction and Reasoning
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 (Hans Tompits and Salvador Abreu and Johannes Oetsch and Jörg Pührer and Dietmar Seipel and Masanobu Umeda and Armin Wolf), volume 7773 of Lecture Notes in Computer Science, pages 27-37, 2013, Springer Verlag.
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.
Abstract Argumentation via Monadic Second Order Logic
Scalable Uncertainty Management - 6th International Conference, SUM 2012, Marburg, Germany, September 17-19, 2012. Proceedings (Eyke Hüllermeier and Sebastian Link and Thomas Fober and Bernhard Seeger), volume 7520 of Lecture Notes in Computer Science, pages 85-98, 2012, Springer Verlag.
Augmenting tractable fragments of abstract argumentation
Artificial Intelligence, volume 186, pages 157-173, 2012.
Backdoors to Acyclic SAT
Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I (Artur Czumaj and Kurt Mehlhorn and Andrew M. Pitts and Roger Wattenhofer), volume 7391 of Lecture Notes in Computer Science, pages 363-374, 2012, Springer Verlag.
Backdoors to Satisfaction
The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday (Hans L. Bodlaender and Rod Downey and Fedor V. Fomin and Dániel Marx), volume 7370 of Lecture Notes in Computer Science, pages 287-317, 2012, Springer Verlag.
Backdoors to Tractable Answer-Set Programming
2012, Technical report 1104.2788, Arxiv.org.
Note: Extended and updated version of a paper that appeared in the proceedings of IJCAI 2011, the 22nd International Joint Conference on Artificial Intelligence
Computing Resolution-Path Dependencies in Linear Time
Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings (Alessandro Cimatti and Roberto Sebastiani), volume 7317 of Lecture Notes in Computer Science, pages 58-71, 2012, 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.
Editing graphs to satisfy degree constraints: a parameterized approach
Journal of Computer and System Sciences, volume 78, number 1, pages 179-191, 2012.
k-Gap Interval Graphs
LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings (David Fernández-Baca), volume 7256 of Lecture Notes in Computer Science, pages 350-361, 2012, Springer Verlag.
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.
Strong Backdoors to Nested Satisfiability
Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings (Alessandro Cimatti and Roberto Sebastiani), volume 7317 of Lecture Notes in Computer Science, pages 72-85, 2012, Springer Verlag.
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.
A probabilistic approach to problems parameterized above or below tight bounds
Journal of Computer and System Sciences, volume 77, number 2, pages 422-429, 2011.
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.
Backdoors to Acyclic SAT
10 2011, Technical report 1110.6384, Arxiv.org.
Backdoors to Satisfaction
10 2011, Technical report 1110.6387, Arxiv.org.
Backdoors to Tractable Answer-Set Programming
Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 (Toby Walsh), pages 863-868, 2011, AAAI Press/IJCAI.
Kernels for Global Constraints
IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011 (Toby Walsh), pages 540-545, 2011, IJCAI/AAAI.
Limits of Preprocessing
Proceedings of the Twenty-Fifth Conference on Artificial Intelligence, AAAI 2011, pages 93-98, 2011, AAAI Press, Menlo Park, California.
Monadic Second Order Logic on Graphs with Local Cardinality Constraints
ACM Transactions on Computational Logic, volume 12, number 2, pages article 12, 2011.
Parameterized Proof Complexity
Computational Complexity, volume 20, number 1, pages 51-85, 2011.
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.
The Parameterized Complexity of Local Consistency
Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP 2011) (Jimmy Ho-Man Lee), volume 6876 of Lecture Notes in Computer Science, pages 302-316, 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.
Algorithms for propositional model counting
J. Discrete Algorithms, volume 8, number 1, pages 50-64, 2010.
Constraint satisfaction with bounded treewidth revisited
Journal of Computer and System Sciences, volume 76, number 2, pages 103-114, 2010.
On Contracting Graphs to Fixed Pattern Graphs
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 (Jan van Leeuwen and Anca Muscholl and David Peleg and Jaroslav Pokorný and Bernhard Rumpe), volume 5901 of Lecture Notes in Computer Science, pages 503-514, 2010, Springer Verlag.
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings (Venkatesh Raman and Saket Saurabh), volume 6478 of Lecture Notes in Computer Science, pages 158-169, 2010, Springer Verlag.
Reasoning in Argumentation Frameworks of Bounded Clique-Width
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 219-230, 2010.
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India (Kamal Lodaya and Meena Mahajan), volume 8 of LIPIcs, pages 84-95, 2010, Leibniz-Zentrum fuer Informatik.
Solving MAX-r-SAT Above a Tight Lower Bound
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 (Moses Charikar), pages 511-517, 2010, SIAM.
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough
Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, May 9-13, 2010 (Fangzhen Lin and Ulrike Sattler and Miroslaw Truszczynski), 2010, AAAI Press.
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds
Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers (Jianer Chen and Fedor V. Fomin), volume 5917 of Lecture Notes in Computer Science, pages 234-245, 2009, Springer Verlag.
Backdoor sets of quantified Boolean formulas
Journal of Automated Reasoning, volume 42, number 1, pages 77-97, 2009.
Clique-width is NP-complete
SIAM J. Discrete Math., volume 23, number 2, pages 909-939, 2009.
Covering graphs with few complete bipartite subgraphs
Theoretical Computer Science, volume 410, number 21-23, pages 2045-2053, 2009.
Matched Formulas and Backdoor Sets
J on Satisfiability, Boolean Modeling and Computation, volume 6, pages 1-12, 2009.
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT
Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings (Oliver Kullmann), volume 5584 of Lecture Notes in Computer Science, pages 276-283, 2009, Springer Verlag.
Backdoor Trees
AAAI 08, Twenty-Third Conference on Artificial Intelligence, Chicago, Illinois, July 13-17, 2008, pages 363-368, 2008, AAAI Press.
Monadic Second Order Logic on Graphs with Local Cardinality Constraints
Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, volume 5162 of Lecture Notes in Computer Science, pages 601-612, 2008, Springer Verlag.
Not So Easy Problems For Tree Decomposable Graphs (invited talk)
ICDM 2008, International Conference on Discrete Mathematics, June 6-10, 2008, Mysore, India, Proceedings, pages 161-171, 2008.
Parameterized Graph Editing with Chosen Vertex Degrees
Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John’s, NL, Canada, August 21-24, 2008. Proceedings (Boting Yang and Ding-Zhu Du and Cao An Wang), volume 5165 of Lecture Notes in Computer Science, pages 13-22, 2008, Springer Verlag.
Parameterized SAT
Chapter in Encyclopedia of Algorithms (Ming-Yang Kao), 2008, Springer Verlag.
The Parameterized Complexity of Regular Subgraph Problems and Generalizations
Proceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22-25, 2008 (J. Harland and P. Manyem), volume 77 of Conferences in Research and Practice in Information Technology, pages 79-86, 2008, Australian Computer Society.
Tractable Cases of the Extended Global Cardinality Constraint
Proceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22-25, 2008 (J. Harland and P. Manyem), volume 77 of Conferences in Research and Practice in Information Technology, pages 67-74, 2008, Australian Computer Society.
Algorithms for Propositional Model Counting
Proceedings of LPAR 2007, 14th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, October 15-19, 2007 Yerevan, Armenia, volume 4790 of Lecture Notes in Computer Science, pages 484-498, 2007, Springer Verlag.
Backdoor Sets of Quantified Boolean Formulas
Proceedings of SAT 2007, Tenth International Conference on Theory and Applications of Satisfiability Testing, May 28-31, 2007, Lisbon, Portugal, (J. Marques-Silva and K. A. Sakallah), volume 4501 of Lecture Notes in Computer Science, pages 230-243, 2007.
Covering Graphs with Few Complete Bipartite Subgraphs
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings (Vikraman Arvind and Sanjiva Prasad), volume 4855 of Lecture Notes in Computer Science, pages 340-351, 2007, Springer Verlag.
Matched Formulas and Backdoor Sets
Proceedings of SAT 2007, Tenth International Conference on Theory and Applications of Satisfiability Testing, May 28-31, 2007, Lisbon, Portugal, (J. Marques-Silva and K. A. Sakallah), volume 4501 of Lecture Notes in Computer Science, pages 94-99, 2007.
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Proceedings of COCOA 2007, Combinatorial Optimization and Applications, First International Conference, Xi’an, China, August 14-16, 2007, volume 4616 of Lecture Notes in Computer Science, pages 366-377, 2007, Springer Verlag.
Parameterized Proof Complexity
Proceedings of the 48th Annual Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, pages 150-160, 2007, IEEE Press.
Solving #SAT using Vertex Covers
Acta Informatica, volume 44, number 7-8, pages 509-523, 2007.
Without Loss of Generality - Symmetric Reasoning for Resolution Systems (Invited Talk)
Proceedings of SymCon'07, Seventh International Workshop on Symmetry and Constraint Satisfaction Problems, satellite workshop of CP 2007, September 23, 2007, Providence, RI, USA (B. Benhamou), pages 5-8, 2007.
Clique-width Minimization is NP-hard
Proceedings of STOC 2006; the 38th ACM Symposium on Theory of Computing, Seattle, Washington, USA, pages 354-362, 2006, ACM.
Constraint satisfaction with bounded treewidth revisited
Proceedings of CP 2006 , Twelfth International Conference on Principles and Practice of Constraint Programming, September 24-29, 2006, Nantes, France, volume 4204 of Lecture Notes in Computer Science, pages 499-513, 2006.
Note: Full version appeared in Constraints
Fixed-Parameter Complexity of Minimum Profile Problems
Proceedings of IWPEC 2006, 2nd International Workshop on Parameterized and Exact Computation, volume 4169 of Lecture Notes in Computer Science, pages 60-71, 2006, Springer Verlag.
Solving #SAT using Vertex Covers
Proceedings of SAT 2006, Ninth International Conference on Theory and Applications of Satisfiability Testing, August 12-15, 2006, Seattle, Washington, USA, volume 4121 of Lecture Notes in Computer Science, pages 396-409, 2006.
The Linear Arrangement Problem Parameterized Above Guaranteed Value
Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings (Tiziana Calamoneri and Irene Finocchi and Giuseppe F. Italiano), volume 3998 of Lecture Notes in Computer Science, pages 356-367, 2006, Springer Verlag.
Backdoor Sets for DLL Subsolvers
Journal of Automated Reasoning, volume 35, number 1-3, pages 73-88, 2005.
Note: Reprinted as Chapter 4 of the book SAT 2005 - Satisfiability Research in the Year 2005, edited by E. Giunchiglia and T. Walsh, Springer Verlag, 2006
Computing unsatisfiable k-SAT instances with few occurrences per variable
Theoretical Computer Science, volume 337, number 1-3, pages 347-359, 2005.
Note: Supplementary material is available at r̆lhttps://www.ac.tuwien.ac.at/files/pub/HoorySzeider05.tar.gz
Generalizations of matched CNF formulas
Ann. Math. Artif. Intell., volume 43, number 1-4, pages 223-238, 2005.
On Edge-Colored Graphs Covered by Properly Colored Cycles
Graphs and Combinatorics, volume 21, number 3, pages 301-206, 2005.
The Complexity of Resolution with Generalized Symmetry Rules
Theory Comput. Syst., volume 38, number 2, pages 171-188, 2005.
Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable
SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings, 2004.
Detecting Backdoor Sets with Respect to Horn and Binary Clauses
Proceedings of SAT 2004 (Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May, 2004, Vancouver, BC, Canada), pages 96-103, 2004.
On Finding Short Resolution Refutations and Small Unsatisfiable Subsets
1st International Workshop on Parameterized and Exact Computation (IWPEC 2004) (Rod Downey and Michael Fellows and Frank Dehne), volume 3162 of Lecture Notes in Computer Science, pages 223-234, 2004, Springer.
On fixed-parameter tractable parameterizations of SAT
Theory and Applications of Satisfiability, 6th International Conference, SAT 2003, Selected and Revised Papers (Enrico Giunchiglia and Armando Tacchella), volume 2919 of Lecture Notes in Computer Science, pages 188-202, 2004, Springer Verlag.
The Parameterized Complexity of SAT Backdoors
Computing: The Australasian Theory Symposium (CATS 2004) (Mike Atkinson), pages 252-261, 2004.
Note: Informal Proceedings
Finding paths in graphs avoiding forbidden transitions
Discr. Appl. Math., volume 126, number 2-3, pages 239-251, 2003.
Homomorphisms of Conjunctive Normal Forms
Discr. Appl. Math., volume 130, number 2, pages 351-365, 2003.
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Proceedings of the 9th International Computing and Combinatorics Conference (COCOON'03) (T. Warnow and B. Zhu), volume 2697 of Lecture Notes in Computer Science, pages 548-558, 2003, Springer Verlag.
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
2003, Technical report TR03-002, Revision~1, Electronic Colloquium on Computational Complexity (ECCC).
The complexity of resolution with generalized symmetry rules
Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (STACS'03) (Helmut Alt and Michel Habib), volume 2607 of Lecture Notes in Computer Science, pages 475-486, 2003.
Generalizations of matched CNF formulas
Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2002) Cincinnati, Ohio, USA, May 6-9, 2002 (John Franco), pages 292-307, 5 2002.
NP-Completeness of Refutability by Literal-Once Resolution
IJCAR 2001, Proceedings of the International Joint Conference on Automated Reasoning (R. Goré and A. Leitsch and T. Nipkow), volume 2083 of Lecture Notes in Artificial Intelligence, pages 168-181, 2001, Springer Verlag.