The arithmetic complexity of tensor contractions. - Florent Capelli; Arnaud Durand 001; Stefan Mengel (STACS, 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)

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)

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

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

Understanding the complexity of #SAT using knowledge compilation. - Florent Capelli (LICS, 2017)

On The Complexity of Enumeration. - Florent Capelli; Yann Strozecki (CoRR, 2017)

Non-FPT lower bounds for structural restrictions of decision DNNF. - Andrea Calì; Florent Capelli; Igor Razgon (CoRR, 2017)

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

Counting Minimal Transversals of β-Acyclic Hypergraphs. - Benjamin Bergougnoux; Florent Capelli; Mamadou Moustapha Kanté (CoRR, 2018)

Knowledge Compilation Languages as Proof Systems. - Florent Capelli (SAT, 2019)

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

Dependency Weighted Aggregation on Factorized Databases. - Florent Capelli; Nicolas Crosetti; Joachim Niehren; Jan Ramon (CoRR, 2019)

Incremental delay enumeration: Space and time. - Florent Capelli; Yann Strozecki (Discret. Appl. Math., 2019)

Counting minimal transversals of β-acyclic hypergraphs. - Benjamin Bergougnoux; Florent Capelli; Mamadou Moustapha Kanté (J. Comput. Syst. Sci., 2019)

Connecting Knowledge Compilation Classes and Width Parameters. - Antoine Amarilli; Florent Capelli; Mikaël Monet; Pierre Senellart (Theory Comput. Syst., 2020)

Correction to: Connecting Knowledge Compilation Classes and Width Parameters. - Antoine Amarilli; Florent Capelli; Mikaël Monet; Pierre Senellart (Theory Comput. Syst., 2020)

Certifying Top-Down Decision-DNNF Compilers. - Florent Capelli; Jean-Marie Lagniez; Pierre Marquis (AAAI, 2021)

Enumerating models of DNF faster: Breaking the dependency on the formula size. - Florent Capelli; Yann Strozecki (Discret. Appl. Math., 2021)

Linear Programs with Conjunctive Queries. - Florent Capelli; Nicolas Crosetti; Joachim Niehren; Jan Ramon (ICDT, 2022)

Geometric Amortization of Enumeration Algorithms. - Florent Capelli; Yann Strozecki (STACS, 2023)

Direct Access for Conjunctive Queries with Negation. - Florent Capelli; Oliver Irwin (CoRR, 2023)

A Knowledge Compilation Take on Binary Polynomial Optimization. - Florent Capelli; Alberto Del Pia; Silvia Di Gregorio (CoRR, 2023)

Ranked Enumeration for MSO on Trees via Knowledge Compilation. - Antoine Amarilli; Pierre Bourhis; Florent Capelli; Mikaël Monet (ICDT, 2024)

Direct Access for Conjunctive Queries with Negations. - Florent Capelli; Oliver Irwin (ICDT, 2024)

A Top-Down Tree Model Counter for Quantified Boolean Formulas. - Florent Capelli; Jean-Marie Lagniez; Andreas Plank; Martina Seidl (IJCAI, 2024)

Linear Programs with Conjunctive Database Queries. - Florent Capelli; Nicolas Crosetti; Joachim Niehren; Jan Ramon (Log. Methods Comput. Sci., 2024)

Tractable Circuits in Database Theory. - Antoine Amarilli; Florent Capelli (SIGMOD Rec., 2024)

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

A Simple Algorithm for Worst Case Optimal Join and Sampling. - Florent Capelli; Oliver Irwin; Sylvain Salvati (ICDT, 2025)