| 2024 | ICALP | On the Length of Strongly Monotone Descending Chains over ℕ^d. | Sylvain Schmitz, Lia Schtze |
| 2024 | LICS | Verifying Unboundedness via Amalgamation. | Ashwani Anand, Sylvain Schmitz, Lia Schtze, Georg Zetzsche |
| 2022 | ISSAC | On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices. | Klara Nosan, Amaury Pouly, Sylvain Schmitz, Mahsa Shirmohammadi, James Worrell |
| 2021 | CSL | Branching in Well-Structured Transition Systems (Invited Talk). | Sylvain Schmitz |
| 2019 | ICALP | The Parametric Complexity of Lossy Counter Machines. | Sylvain Schmitz |
| 2019 | LICS | Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. | Petr Jancar, Sylvain Schmitz |
| 2019 | LICS | Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. | Jrme Leroux, Sylvain Schmitz |
| 2019 | PODS | Decidable XPath Fragments in the Real World. | David Baelde, Anthony Lick, Sylvain Schmitz |
| 2018 | AiML | A Hypersequent Calculus with Clusters for Linear Frames. | David Baelde, Anthony Lick, Sylvain Schmitz |
| 2017 | LICS | Perfect half space games. | Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz |
| 2016 | CSL | A Sequent Calculus for a Modal Logic on Finite Data Trees. | David Baelde, Simon Lunel, Sylvain Schmitz |
| 2016 | FOSSACS | Coverability Trees for Petri Nets with Unordered Data. | Piotr Hofman, Slawomir Lasota, Ranko Lazic, Jrme Leroux, Sylvain Schmitz, Patrick Totzke |
| 2016 | ICALP | Deciding Piecewise Testable Separability for Regular Tree Languages. | Jean Goubault-Larrecq, Sylvain Schmitz |
| 2016 | LICS | The Complexity of Coverability in ν-Petri Nets. | Ranko Lazic, Sylvain Schmitz |
| 2016 | STACS | Ideal Decompositions for Vector Addition Systems (Invited Talk). | Jrme Leroux, Sylvain Schmitz |
| 2015 | ICALP | Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time. | Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz |
| 2015 | LICS | Demystifying Reachability in Vector Addition Systems. | Jrme Leroux, Sylvain Schmitz |
| 2014 | CSL | Non-elementary complexities for branching VASS, MELL, and extensions. | Ranko Lazic, Sylvain Schmitz |
| 2014 | MFCS | Alternating Vector Addition Systems with States. | Jean-Baptiste Courtois, Sylvain Schmitz |
| 2013 | CC | On LR Parsing with Selective Delays. | Eberhard Bertsch, Mark-Jan Nederhof, Sylvain Schmitz |
| 2013 | CONCUR | The Power of Priority Channel Systems. | Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen |
| 2013 | CONCUR | The Power of Well-Structured Systems. | Sylvain Schmitz, Philippe Schnoebelen |
| 2013 | FOSSACS | The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. | Prateek Karandikar, Sylvain Schmitz |
| 2013 | LICS | Model-Checking Parse Trees. | Anudhyan Boral, Sylvain Schmitz |
| 2012 | LICS | The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets. | Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen |
| 2011 | ICALP | Multiply-Recursive Upper Bounds with Higman's Lemma. | Sylvain Schmitz, Philippe Schnoebelen |
| 2011 | LICS | Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. | Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen |
| 2011 | MFCS | Model Checking Coverability Graphs of Vector Addition Systems. | Michel Blockelet, Sylvain Schmitz |
| 2010 | ACL | On the Computational Complexity of Dominance Links in Grammatical Formalisms. | Sylvain Schmitz |
| 2007 | ICALP | Conservative Ambiguity Detection in Context-Free Grammars. | Sylvain Schmitz |
| 2006 | DLT | Noncanonical LALR(1) Parsing. | Sylvain Schmitz |