| 2025 | LICS | Navigational hierarchies of regular languages. | Thomas Place, Marc Zeitoun |
| 2024 | CSL | A Generic Characterization of Generalized Unary Temporal Logic and Two-Variable First-Order Logic. | Thomas Place, Marc Zeitoun |
| 2024 | LICS | Dot-depth three, return of the J-class. | Thomas Place, Marc Zeitoun |
| 2023 | LICS | Group Separation Strikes Back. | Thomas Place, Marc Zeitoun |
| 2022 | CSR | Characterizing Level One in Group-Based Concatenation Hierarchies. | Thomas Place, Marc Zeitoun |
| 2022 | LATIN | How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic? | Thomas Place, Marc Zeitoun |
| 2022 | LICS | The amazing mixed polynomial closure and its applications to two-variable first-order logic. | Thomas Place |
| 2020 | LATA | Deciding Classes of Regular Languages: The Covering Approach. | Thomas Place |
| 2019 | ICALP | On All Things Star-Free. | Thomas Place, Marc Zeitoun |
| 2019 | LICS | Separation and covering for group based concatenation hierarchies. | Thomas Place, Marc Zeitoun |
| 2018 | ICALP | Separating Without Any Ambiguity. | Thomas Place, Marc Zeitoun |
| 2017 | CSR | Concatenation Hierarchies: New Bottle, Old Wine. | Thomas Place, Marc Zeitoun |
| 2017 | LICS | Separation for dot-depth two. | Thomas Place, Marc Zeitoun |
| 2016 | FOSSACS | Quantifier Alternation for Infinite Words. | Tho Pierron, Thomas Place, Marc Zeitoun |
| 2016 | MFCS | The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics. | Thomas Place, Marc Zeitoun |
| 2015 | LICS | Separating Regular Languages with Two Quantifiers Alternations. | Thomas Place |
| 2015 | STACS | Separation and the Successor Relation. | Thomas Place, Marc Zeitoun |
| 2014 | CSL | Separating regular languages with first-order logic. | Thomas Place, Marc Zeitoun |
| 2014 | ICALP | Going Higher in the First-Order Quantifier Alternation Hierarchy on Words. | Thomas Place, Marc Zeitoun |
| 2013 | MFCS | Separating Regular Languages by Piecewise Testable and Unambiguous Languages. | Thomas Place, Lorijn van Rooijen, Marc Zeitoun |
| 2012 | ICALP | Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets. | Mikolaj Bojanczyk, Thomas Place |
| 2012 | ICALP | Toward Model Theory with Data Values. | Mikolaj Bojanczyk, Thomas Place |
| 2010 | LICS | Deciding Definability in FO | Thomas Place, Luc Segoufin |
| 2010 | MFCS | Frame Definability for Classes of Trees in the | Galle Fontaine, Thomas Place |
| 2009 | ICALP | A Decidable Characterization of Locally Testable Tree Languages. | Thomas Place, Luc Segoufin |
| 2008 | CSL | Characterization of Logics over Ranked Tree Languages. | Thomas Place |