| 2026 | MFCS | Constant-Time Dynamic Enumeration of Word Infixes in a Regular Language. | Antoine Amarilli, Sven Dziadek, Luc Segoufin |
| 2023 | ICDT | A Simple Algorithm for Consistent Query Answering Under Primary Keys. | Diego Figueira, Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo |
| 2023 | PODS | Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis. | Nofar Carmeli, Luc Segoufin |
| 2020 | CSL | Order-Invariant First-Order Logic over Hollow Trees. | Julien Grange, Luc Segoufin |
| 2020 | PODS | Projection Views of Register Automata. | Luc Segoufin, Victor Vianu |
| 2018 | PODS | Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates. | Matthias Niewerth, Luc Segoufin |
| 2018 | PODS | Enumeration for FO Queries over Nowhere Dense Graphs. | Nicole Schweikardt, Luc Segoufin, Alexandre Vigny |
| 2017 | ICDT | Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion. | Luc Segoufin, Alexandre Vigny |
| 2017 | MFCS | The Power of Programs over Monoids in DA. | Nathan Grosshans, Pierre McKenzie, Luc Segoufin |
| 2014 | ICDT | Datalog Rewritings of Regular Path Queries using Views. | Nadime Francis, Luc Segoufin, Cristina Sirangelo |
| 2014 | PODS | Enumerating answers to first-order queries over databases of low degree. | Arnaud Durand, Nicole Schweikardt, Luc Segoufin |
| 2014 | STACS | A glimpse on constant delay enumeration (Invited Talk). | Luc Segoufin |
| 2013 | ICDT | Enumerating with constant delay the answers to a query. | Luc Segoufin |
| 2013 | PODS | Verification of database-driven systems via amalgamation. | Mikolaj Bojanczyk, Luc Segoufin, Szymon Torunczyk |
| 2013 | PODS | Enumeration of first-order queries on classes of structures with bounded expansion. | Wojciech Kazana, Luc Segoufin |
| 2011 | ICALP | Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates. | Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin |
| 2011 | ICALP | Guarded Negation. | Vince Brny, Balder ten Cate, Luc Segoufin |
| 2011 | STACS | Unary negation. | Balder ten Cate, Luc Segoufin |
| 2011 | STACS | Bottom-up automata on data trees and vertical XPath. | Diego Figueira, Luc Segoufin |
| 2011 | STACS | Automata based verification over linearly ordered data domains. | Luc Segoufin, Szymon Torunczyk |
| 2010 | LICS | Deciding Definability in FO | Thomas Place, Luc Segoufin |
| 2010 | LICS | Addition-Invariant FO and Regularity. | Nicole Schweikardt, Luc Segoufin |
| 2009 | ICALP | A Decidable Characterization of Locally Testable Tree Languages. | Thomas Place, Luc Segoufin |
| 2009 | MFCS | Future-Looking Logics on Data Words and Trees. | Diego Figueira, Luc Segoufin |
| 2008 | ICALP | Tree Languages Defined in First-Order Logic with One Quantifier Alternation. | Mikolaj Bojanczyk, Luc Segoufin |
| 2008 | LICS | Piecewise Testable Tree Languages. | Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing |
| 2008 | PODS | Static analysis of active XML systems. | Serge Abiteboul, Luc Segoufin, Victor Vianu |
| 2008 | PODS | XPath, transitive closure logic, and nested tree walking automata. | Balder ten Cate, Luc Segoufin |
| 2007 | FCT | Complexity of Pebble Tree-Walking Automata. | Mathias Samuelides, Luc Segoufin |
| 2007 | ICDT | Determinacy and Rewriting of Conjunctive Queries Using Views: A Progress Report. | Alan Nash, Luc Segoufin, Victor Vianu |
| 2007 | ICDT | Constant-Memory Validation of Streaming XML Documents Against DTDs. | Luc Segoufin, Cristina Sirangelo |
| 2006 | CSL | Automata and Logics for Words and Trees over an Infinite Alphabet. | Luc Segoufin |
| 2006 | ICALP | Expressive Power of Pebble Automata. | Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin |
| 2006 | LICS | Two-Variable Logic on Words with Data. | Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David |
| 2006 | PODS | Two-variable logic on data trees and XML reasoning. | Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin |
| 2005 | CSL | Towards a Characterization of Order-Invariant Queries over Tame Structures. | Michael Benedikt, Luc Segoufin |
| 2005 | PODS | Views and queries: determinacy and rewriting. | Luc Segoufin, Victor Vianu |
| 2005 | STACS | Regular Tree Languages Definable in FO. | Michael Benedikt, Luc Segoufin |
| 2004 | STACS | Active Context-Free Games. | Anca Muscholl, Thomas Schwentick, Luc Segoufin |
| 2003 | PODS | Typing and querying XML documents: some complexity bounds. | Luc Segoufin |
| 2002 | PODS | Validating Streaming XML Documents. | Luc Segoufin, Victor Vianu |
| 2001 | LICS | A Model-Theoretic Approach to Regular String Relations. | Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin |
| 2001 | PODS | Representing and Querying XML with Incomplete Information. | Serge Abiteboul, Luc Segoufin, Victor Vianu |
| 2001 | PODS | String Operations in Query Languages. | Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin |
| 2001 | STOC | When is the evaluation of conjunctive queries tractable? | Martin Grohe, Thomas Schwentick, Luc Segoufin |
| 2000 | LICS | On First-Order Topological Queries. | Martin Grohe, Luc Segoufin |
| 2000 | PODS | Reachability and Connectivity Queries in Constraint Databases. | Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin |
| 2000 | VLDB | Manipulating Interpolated Data is Easier than You Thought. | Stphane Grumbach, Philippe Rigaux, Luc Segoufin |
| 1999 | ICDT | On the Orthographic Dimension of Constraint Databases. | Stphane Grumbach, Philippe Rigaux, Luc Segoufin |
| 1998 | PODS | Querying Spatial Databases via Topological Invariants. | Luc Segoufin, Victor Vianu |
| 1998 | SIGMOD | The DEDALE System for Complex Spatial Queries. | Stphane Grumbach, Philippe Rigaux, Luc Segoufin |