| 2026 | ICDT | Building Relational Circuits (Invited Talk). | Florent Capelli |
| 2026 | PODS | Enumeration Theory through the Lens of Database Challenges. | Florent Capelli, Nofar Carmeli, Alessio Conte, Benny Kimelfeld, Reinhard Pichler, Nikolaos Tziavelis |
| 2026 | SAT | A Canonical Generalization of OBDD. | Florent Capelli, YooJung Choi, Stefan Mengel, Martn Muoz, Guy Van den Broeck |
| 2025 | ICDT | Dynamic Direct Access of MSO Query Evaluation over Strings. | Pierre Bourhis, Florent Capelli, Stefan Mengel, Cristian Riveros |
| 2025 | ICDT | A Simple Algorithm for Worst Case Optimal Join and Sampling. | Florent Capelli, Oliver Irwin, Sylvain Salvati |
| 2024 | ICDT | Ranked Enumeration for MSO on Trees via Knowledge Compilation. | Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikal Monet |
| 2024 | ICDT | Direct Access for Conjunctive Queries with Negations. | Florent Capelli, Oliver Irwin |
| 2024 | IJCAI | A Top-Down Tree Model Counter for Quantified Boolean Formulas. | Florent Capelli, Jean-Marie Lagniez, Andreas Plank, Martina Seidl |
| 2023 | STACS | Geometric Amortization of Enumeration Algorithms. | Florent Capelli, Yann Strozecki |
| 2022 | ICDT | Linear Programs with Conjunctive Queries. | Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon |
| 2021 | AAAI | Certifying Top-Down Decision-DNNF Compilers. | Florent Capelli, Jean-Marie Lagniez, Pierre Marquis |
| 2019 | STACS | Tractable QBF by Knowledge Compilation. | Florent Capelli, Stefan Mengel |
| 2019 | SAT | Knowledge Compilation Languages as Proof Systems. | Florent Capelli |
| 2017 | LICS | Understanding the complexity of #SAT using knowledge compilation. | Florent Capelli |
| 2016 | IJCAI | Knowledge Compilation Meets Communication Complexity. | Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky |
| 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 | STACS | The arithmetic complexity of tensor contractions. | Florent Capelli, Arnaud Durand, Stefan Mengel |