| 2025 | ICALP | Minimality and Computability of Languages of G-Shifts. | Djamel Eddine Amir, Benjamin Hellouin de Menibus |
| 2025 | STACS | Subshifts Defined by Nondeterministic and Alternating Plane-Walking Automata. | Benjamin Hellouin de Menibus, Pacme Perrotin |
| 2024 | CiE | Two-Player Domino Games. | Benjamin Hellouin de Menibus, Rmi Pallen |
| 2023 | DLT | The Domino Problem Is Undecidable on Every Rhombus Subshift. | Benjamin Hellouin de Menibus, Victor H. Lutfalla, Camille Nos |
| 2022 | STACS | The Aperiodic Domino Problem in Higher Dimension. | Antonin Callard, Benjamin Hellouin de Menibus |
| 2018 | ICALP | Aperiodic Points in Z | Anal Grandjean, Benjamin Hellouin de Menibus, Pascal Vanier |
| 2015 | STACS | Construction of mu-Limit Sets of Two-dimensional Cellular Automata. | Martin Delacourt, Benjamin Hellouin de Menibus |
| 2011 | DLT | Self-organization in Cellular Automata: A Particle-Based Approach. | Benjamin Hellouin de Menibus, Mathieu Sablik |
| 2011 | TAMC | Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. | Benjamin Hellouin de Menibus, Takeaki Uno |