| 2026 | ICALP | Gray Codes with Constant Delay and Constant Auxiliary Space. | Antoine Amarilli, Claire David, Nadime Francis, Victor Marsault, Mikal Monet, Yann Strozecki |
| 2026 | STACS | On the Complexity of Language Membership for Probabilistic Words. | Antoine Amarilli, Mikal Monet, Paul Raphal, Sylvain Salvati |
| 2026 | WG | The S-Hamiltonian Cycle Problem. | Antoine Amarilli, Arthur Lombardo, Mikal Monet |
| 2024 | ICDT | Ranked Enumeration for MSO on Trees via Knowledge Compilation. | Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikal Monet |
| 2023 | STACS | Enumerating Regular Languages with Bounded Delay. | Antoine Amarilli, Mikal Monet |
| 2022 | MFCS | Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. | Antoine Amarilli, Mikal Monet |
| 2022 | SIGMOD | ShapGraph: An Holistic View of Explanations through Provenance Graphs and Shapley Values. | Susan B. Davidson, Daniel Deutch, Nave Frost, Benny Kimelfeld, Omer Koren, Mikal Monet |
| 2022 | SIGMOD | Computing the Shapley Value of Facts in Query Answering. | Daniel Deutch, Nave Frost, Benny Kimelfeld, Mikal Monet |
| 2021 | AAAI | The Tractability of SHAP-Score-Based Explanations for Classification over Deterministic and Decomposable Boolean Circuits. | Marcelo Arenas, Pablo Barcel, Leopoldo E. Bertossi, Mikal Monet |
| 2020 | ICLR | The Logical Expressiveness of Graph Neural Networks. | Pablo Barcel, Egor V. Kostylev, Mikal Monet, Jorge Prez, Juan L. Reutter, Juan Pablo Silva |
| 2020 | PODS | Counting Problems over Incomplete Databases. | Marcelo Arenas, Pablo Barcel, Mikal Monet |
| 2020 | PODS | Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases. | Mikal Monet |
| 2018 | ICDT | Connecting Width and Structure in Knowledge Compilation. | Antoine Amarilli, Mikal Monet, Pierre Senellart |
| 2017 | ICDT | Combined Tractability of Query Evaluation via Tree Automata and Cycluits. | Antoine Amarilli, Pierre Bourhis, Mikal Monet, Pierre Senellart |
| 2017 | PODS | Conjunctive Queries on Probabilistic Graphs: Combined Complexity. | Antoine Amarilli, Mikal Monet, Pierre Senellart |
| 2016 | SIGMOD | Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth Instances. | Mikal Monet |