A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic. - Johann Brault-Baron (CSL, 2012)

De la pertinence de l'énumération : complexité en logiques propositionnelle et du premier ordre. (The relevance of the list: propositional logic and complexity of the first order). - Johann Brault-Baron (2013)

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

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

Hypergraph Acyclicity Revisited. - Johann Brault-Baron (ACM Comput. Surv., 2016)