A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs. - Jochen Harant; Stefan Senitsch (Discret. Math., 2009)

Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems - (Extended Abstract). - Stefan Mengel (ICALP (1), 2011)

On Polynomials Defined by Acyclic Conjunctive Queries and Weighted Counting Problems - Arnaud Durand 001; Stefan Mengel (CoRR, 2011)

Arithmetic Branching Programs with Memory. - Stefan Mengel (MFCS, 2013)

The arithmetic complexity of tensor contractions. - Florent Capelli; Arnaud Durand 001; Stefan Mengel (STACS, 2013)

Conjunctive queries, arithmetic circuits and counting complexity. - Stefan Mengel (2013)

Hypergraph Acyclicity and Propositional Model Counting. - Florent Capelli; Arnaud Durand 001; Stefan Mengel (SAT, 2014)

Expander CNFs have Exponential DNNF Size. - Simone Bova; Florent Capelli; Stefan Mengel; Friedrich Slivovsky (CoRR, 2014)

Understanding model counting for $β$-acyclic CNF-formulas. - Johann Brault-Baron; Florent Capelli; Stefan Mengel (CoRR, 2014)

The complexity of weighted counting for acyclic conjunctive queries. - Arnaud Durand 001; Stefan Mengel (J. Comput. Syst. Sci., 2014)

A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. - Hubie Chen; Stefan Mengel (ICDT, 2015)

Give Me Another One! - Mike Behrisch; Miki Hermann; Stefan Mengel; Gernot Salzer (ISAAC, 2015)

On Compiling CNFs into Structured Deterministic DNNFs. - Simone Bova; Florent Capelli; Stefan Mengel; Friedrich Slivovsky (SAT, 2015)

Understanding Model Counting for beta-acyclic CNF-formulas. - Johann Brault-Baron; Florent Capelli; Stefan Mengel (STACS, 2015)

Monomials in Arithmetic Circuits: Complete Problems in the Counting Hierarchy. - Hervé Fournier; Guillaume Malod; Stefan Mengel (Comput. Complex., 2015)

The Logic of Counting Query Answers: A Study via Existential Positive Queries. - Hubie Chen; Stefan Mengel (CoRR, 2015)

Structural Tractability of Counting of Solutions to Conjunctive Queries. - Arnaud Durand 001; Stefan Mengel (Theory Comput. Syst., 2015)

The Next Whisky Bar. - Mike Behrisch; Miki Hermann; Stefan Mengel; Gernot Salzer (CSR, 2016)

Knowledge Compilation Meets Communication Complexity. - Simone Bova; Florent Capelli; Stefan Mengel; Friedrich Slivovsky (IJCAI, 2016)

Counting Answers to Existential Positive Queries: A Complexity Classification. - Hubie Chen; Stefan Mengel (PODS, 2016)

Parameterized Compilation Lower Bounds for Restricted CNF-Formulas. - Stefan Mengel (SAT, 2016)

As Close as It Gets. - Mike Behrisch; Miki Hermann; Stefan Mengel; Gernot Salzer (WALCOM, 2016)

Lower Bounds on the mim-width of Some Perfect Graph Classes. - Stefan Mengel (CoRR, 2016)

The Arithmetic Complexity of Tensor Contraction. - Florent Capelli; Arnaud Durand 001; Stefan Mengel (Theory Comput. Syst., 2016)

A Circuit-Based Approach to Efficient Enumeration. - Antoine Amarilli; Pierre Bourhis; Louis Jachiet; Stefan Mengel (ICALP, 2017)

The logic of counting query answers. - Hubie Chen; Stefan Mengel (LICS, 2017)

On tractable query evaluation for SPARQL. - Stefan Mengel; Sebastian Skritek (CoRR, 2017)

Enumeration on Trees under Relabelings. - Antoine Amarilli; Pierre Bourhis; Stefan Mengel (ICDT, 2018)

Pseudo-Boolean Constraints from a Knowledge Representation Perspective. - Daniel Le Berre; Pierre Marquis; Stefan Mengel; Romain Wallon (IJCAI, 2018)

QBF as an Alternative to Courcelle's Theorem. - Michael Lampis; Stefan Mengel; Valia Mitsou (SAT, 2018)

Knowledge Compilation, Width and Quantification. - Florent Capelli; Stefan Mengel (CoRR, 2018)

Lower bounds on the mim-width of some graph classes. - Stefan Mengel (Discret. Appl. Math., 2018)

On the relative power of reduction notions in arithmetic circuit complexity. - Christian Ikenmeyer; Stefan Mengel (Inf. Process. Lett., 2018)

Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. - Antoine Amarilli; Pierre Bourhis; Stefan Mengel; Matthias Niewerth (PODS, 2019)

Tractable QBF by Knowledge Compilation. - Florent Capelli; Stefan Mengel (STACS, 2019)

Minimal Distance of Propositional Models. - Mike Behrisch; Miki Hermann; Stefan Mengel; Gernot Salzer (Theory Comput. Syst., 2019)

On Irrelevant Literals in Pseudo-Boolean Constraint Learning. - Daniel Le Berre; Pierre Marquis; Stefan Mengel; Romain Wallon (IJCAI, 2020)

Lower Bounds for Approximate Knowledge Compilation. - Alexis de Colnet; Stefan Mengel (IJCAI, 2020)

Revisiting Graph Width Measures for CNF-Encodings. - Romain Wallon; Stefan Mengel (J. Artif. Intell. Res., 2020)

Constant-Delay Enumeration for Nondeterministic Document Spanners. - Antoine Amarilli; Pierre Bourhis; Stefan Mengel; Matthias Niewerth (SIGMOD Rec., 2020)

Counting, Knowledge Compilation and Applications. - Stefan Mengel (2021)

A Compilation of Succinctness Results for Arithmetic Circuits. - Alexis de Colnet; Stefan Mengel (KR, 2021)

Proof Complexity of Symbolic QBF Reasoning. - Stefan Mengel; Friedrich Slivovsky (SAT, 2021)

A short note on the counting complexity of conjunctive queries. - Stefan Mengel (CoRR, 2021)

Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection. - Stefan Mengel; Sebastian Skritek (Theory Comput. Syst., 2021)

Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation. - Alexis de Colnet; Stefan Mengel (AAAI, 2022)

Changing Partitions in Rectangle Decision Lists. - Stefan Mengel (SAT, 2022)

No Efficient Disjunction or Conjunction of Switch-Lists. - Stefan Mengel (J. Satisf. Boolean Model. Comput., 2022)

Bounds on BDD-Based Bucket Elimination. - Stefan Mengel (SAT, 2023)

Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability. - Hubie Chen; Gianluigi Greco; Stefan Mengel; Francesco Scarcello (CoRR, 2023)

Characterizing Tseitin-Formulas with Short Regular Resolution Refutations. - Alexis de Colnet; Stefan Mengel (J. Artif. Intell. Res., 2023)

Skyline Operators for Document Spanners. - Antoine Amarilli; Benny Kimelfeld; Sébastien Labbé 003; Stefan Mengel (ICDT, 2024)

Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity. - Hubie Chen; Stefan Mengel (ICDT, 2024)

Subtractive Mixture Models via Squaring: Representation and Learning. - Lorenzo Loconte; Aleksanteri M. Sladek; Stefan Mengel; Martin Trapp 001; Arno Solin; Nicolas Gillis; Antonio Vergari (ICLR, 2024)

Learning Model Agnostic Explanations via Constraint Programming. - Frédéric Koriche; Jean-Marie Lagniez; Stefan Mengel; Chi Tran (ECML/PKDD (4), 2024)

A Characterization of Efficiently Compilable Constraint Languages. - Christoph Berkholz; Stefan Mengel; Hermann Wilhelm (STACS, 2024)

Representation, Provenance, and Explanations in Database Theory and Logic (Dagstuhl Seminar 24032). - Pablo Barceló; Pierre Bourhis; Stefan Mengel; Sudeepa Roy 001 (Dagstuhl Reports, 2024)

An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages. - Hélène Fargier; Stefan Mengel; Jérôme Mengin (Ann. Math. Artif. Intell., 2024)

Sum of Squares Circuits. - Lorenzo Loconte; Stefan Mengel; Antonio Vergari (AAAI, 2025)

Dynamic Direct Access of MSO Query Evaluation over Strings. - Pierre Bourhis; Florent Capelli; Stefan Mengel; Cristian Riveros (ICDT, 2025)

Lower Bounds for Conjunctive Query Evaluation. - Stefan Mengel (PODS Companion, 2025)

Tight Fine-Grained Bounds for Direct Access on Join Queries. - Karl Bringmann; Nofar Carmeli; Stefan Mengel (ACM Trans. Database Syst., 2025)

A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity. - Stefan Mengel; Harry Vinall-Smeeth (Proc. ACM Manag. Data, 2025)