| 2026 | SAT | A Canonical Generalization of OBDD. | Florent Capelli, YooJung Choi, Stefan Mengel, Martn Muoz, Guy Van den Broeck |
| 2025 | AAAI | Sum of Squares Circuits. | Lorenzo Loconte, Stefan Mengel, Antonio Vergari |
| 2025 | ICDT | Dynamic Direct Access of MSO Query Evaluation over Strings. | Pierre Bourhis, Florent Capelli, Stefan Mengel, Cristian Riveros |
| 2025 | PODS | Lower Bounds for Conjunctive Query Evaluation. | Stefan Mengel |
| 2024 | ICDT | Skyline Operators for Document Spanners. | Antoine Amarilli, Benny Kimelfeld, Sbastien Labb, Stefan Mengel |
| 2024 | ICDT | Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity. | Hubie Chen, Stefan Mengel |
| 2024 | ICLR | Subtractive Mixture Models via Squaring: Representation and Learning. | Lorenzo Loconte, Aleksanteri M. Sladek, Stefan Mengel, Martin Trapp, Arno Solin, Nicolas Gillis, Antonio Vergari |
| 2024 | STACS | A Characterization of Efficiently Compilable Constraint Languages. | Christoph Berkholz, Stefan Mengel, Hermann Wilhelm |
| 2023 | SAT | Bounds on BDD-Based Bucket Elimination. | Stefan Mengel |
| 2022 | AAAI | Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation. | Alexis de Colnet, Stefan Mengel |
| 2022 | PODS | Tight Fine-Grained Bounds for Direct Access on Join Queries. | Karl Bringmann, Nofar Carmeli, Stefan Mengel |
| 2022 | SAT | Changing Partitions in Rectangle Decision Lists. | Stefan Mengel |
| 2021 | KR | A Compilation of Succinctness Results for Arithmetic Circuits. | Alexis de Colnet, Stefan Mengel |
| 2021 | SAT | Characterizing Tseitin-Formulas with Short Regular Resolution Refutations. | Alexis de Colnet, Stefan Mengel |
| 2021 | SAT | Proof Complexity of Symbolic QBF Reasoning. | Stefan Mengel, Friedrich Slivovsky |
| 2020 | IJCAI | On Irrelevant Literals in Pseudo-Boolean Constraint Learning. | Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon |
| 2020 | IJCAI | Lower Bounds for Approximate Knowledge Compilation. | Alexis de Colnet, Stefan Mengel |
| 2019 | ICDT | Constant-Delay Enumeration for Nondeterministic Document Spanners. | Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth |
| 2019 | ICDT | Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. | Stefan Mengel, Sebastian Skritek |
| 2019 | PODS | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. | Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth |
| 2019 | STACS | Tractable QBF by Knowledge Compilation. | Florent Capelli, Stefan Mengel |
| 2019 | SAT | Revisiting Graph Width Measures for CNF-Encodings. | Stefan Mengel, Romain Wallon |
| 2018 | ICDT | Enumeration on Trees under Relabelings. | Antoine Amarilli, Pierre Bourhis, Stefan Mengel |
| 2018 | IJCAI | Pseudo-Boolean Constraints from a Knowledge Representation Perspective. | Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon |
| 2018 | SAT | QBF as an Alternative to Courcelle's Theorem. | Michael Lampis, Stefan Mengel, Valia Mitsou |
| 2017 | ICALP | A Circuit-Based Approach to Efficient Enumeration. | Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel |
| 2017 | LICS | The logic of counting query answers. | Hubie Chen, Stefan Mengel |
| 2016 | CSR | The Next Whisky Bar. | Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer |
| 2016 | IJCAI | Knowledge Compilation Meets Communication Complexity. | Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky |
| 2016 | PODS | Counting Answers to Existential Positive Queries: A Complexity Classification. | Hubie Chen, Stefan Mengel |
| 2016 | SAT | Parameterized Compilation Lower Bounds for Restricted CNF-Formulas. | Stefan Mengel |
| 2016 | WALCOM | As Close as It Gets. | Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer |
| 2015 | ICDT | A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. | Hubie Chen, Stefan Mengel |
| 2015 | ISAAC | Give Me Another One! | Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer |
| 2015 | STACS | Understanding Model Counting for beta-acyclic CNF-formulas. | Johann Brault-Baron, Florent Capelli, Stefan Mengel |
| 2015 | SAT | On Compiling CNFs into Structured Deterministic DNNFs. | Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky |
| 2014 | SAT | Hypergraph Acyclicity and Propositional Model Counting. | Florent Capelli, Arnaud Durand, Stefan Mengel |
| 2013 | ICDT | Structural tractability of counting of solutions to conjunctive queries. | Arnaud Durand, Stefan Mengel |
| 2013 | MFCS | Arithmetic Branching Programs with Memory. | Stefan Mengel |
| 2013 | STACS | The arithmetic complexity of tensor contractions. | Florent Capelli, Arnaud Durand, Stefan Mengel |
| 2012 | STACS | Monomials in arithmetic circuits: Complete problems in the counting hierarchy. | Herv Fournier, Guillaume Malod, Stefan Mengel |
| 2011 | ICALP | Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems - (Extended Abstract). | Stefan Mengel |