| 2023 | ICDT | Work-Efficient Query Evaluation with PRAMs. | Jens Keppeler, Thomas Schwentick, Christopher Spinrath |
| 2023 | MFCS | Dynamic Constant Time Parallel Graph Algorithms with Sub-Linear Work. | Jonas Schmidt, Thomas Schwentick |
| 2023 | MFCS | On the Work of Dynamic Constant-Time Parallel Algorithms for Regular Tree Languages and Context-Free Languages. | Jonas Schmidt, Thomas Schwentick, Jennifer Todtenhoefer |
| 2022 | ICDT | Rewriting with Acyclic Queries: Mind Your Head. | Gaetano Geck, Jens Keppeler, Thomas Schwentick, Christopher Spinrath |
| 2021 | FOSSACS | Work-sensitive Dynamic Complexity of Formal Languages. | Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier, Thomas Zeume |
| 2021 | PODS | 2021 ACM PODS Alberto O. Mendelzon Test-of-Time Award. | Angela Bonifati, Rasmus Pagh, Thomas Schwentick |
| 2020 | CSL | Dynamic Complexity Meets Parameterised Algorithms. | Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis |
| 2020 | ICDT | Distribution Constraints: The Chase for Distributed Data. | Gaetano Geck, Frank Neven, Thomas Schwentick |
| 2019 | FCT | Winning Strategies for Streaming Rewriting Games. | Christian Coester, Thomas Schwentick, Martin Schuster |
| 2019 | ICDT | Parallel-Correctness and Parallel-Boundedness for Datalog Programs. | Frank Neven, Thomas Schwentick, Christopher Spinrath, Brecht Vandevoort |
| 2018 | CSL | The Ackermann Award 2018. | Dexter Kozen, Thomas Schwentick |
| 2017 | ICALP | A Strategy for Dynamic Programs: Start over and Muddle Through. | Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume |
| 2017 | ICDT | Dynamic Complexity under Definable Changes. | Thomas Schwentick, Nils Vortmeier, Thomas Zeume |
| 2016 | ICDT | Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. | Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick |
| 2015 | CSL | Static Analysis for Logic-based Dynamic Programs. | Thomas Schwentick, Nils Vortmeier, Thomas Zeume |
| 2015 | ICALP | Reachability is in DynFO. | Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume |
| 2015 | ICDT | Games for Active XML Revisited. | Martin Schuster, Thomas Schwentick |
| 2015 | PODS | Parallel-Correctness and Transferability for Conjunctive Queries. | Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick |
| 2015 | PODS | BonXai: Combining the simplicity of DTD with the expressiveness of XML Schema. | Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick |
| 2014 | ICDT | Reasoning about XML Constraints based on XML-to-relational mappings. | Matthias Niewerth, Thomas Schwentick |
| 2014 | ICDT | Dynamic Conjunctive Queries. | Thomas Zeume, Thomas Schwentick |
| 2013 | ICDT | On optimum left-to-right strategies for active context-free games. | Henrik Bjrklund, Martin Schuster, Thomas Schwentick, Joscha Kulbatzki |
| 2013 | LATA | Dynamic Communicating Automata and Branching High-Level MSCs. | Benedikt Bollig, Aiswarya Cyriac, Loc Hlout, Ahmet Kara, Thomas Schwentick |
| 2013 | LATA | XML Schema Management: A Challenge for Automata Theory. | Thomas Schwentick |
| 2013 | MFCS | Validity of Tree Pattern Queries with Respect to Schema Information. | Henrik Bjrklund, Wim Martens, Thomas Schwentick |
| 2013 | MFCS | On the Quantifier-Free Dynamic Complexity of Reachability. | Thomas Zeume, Thomas Schwentick |
| 2013 | WoLLIC | Perspectives of Dynamic Complexity. | Thomas Schwentick |
| 2012 | KR | Rewriting Ontological Queries into Small Nonrecursive Datalog Programs. | Georg Gottlob, Thomas Schwentick |
| 2012 | LATA | Feasible Automata for Two-Variable Logic with Successor on Data Words. | Ahmet Kara, Thomas Schwentick, Tony Tan |
| 2011 | ICDT | Two-variable logic and key constraints on data words. | Matthias Niewerth, Thomas Schwentick |
| 2011 | STACS | Frontmatter, Table of Contents, Preface, Conference Organization. | Thomas Schwentick, Christoph Drr |
| 2010 | CSL | Two-Variable Logic with Two Order Relations - (Extended Abstract). | Thomas Schwentick, Thomas Zeume |
| 2010 | PODS | Schema design for XML repositories: complexity and tractability. | Wim Martens, Matthias Niewerth, Thomas Schwentick |
| 2010 | STACS | Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science. | Jean-Yves Marion, Thomas Schwentick |
| 2010 | STACS | Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science. | Jean-Yves Marion, Thomas Schwentick |
| 2009 | MFCS | On the Hybrid Extension of CTL and CTL | Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick |
| 2009 | STACS | The Dynamic Complexity of Formal Languages. | Wouter Gelade, Marcel Marquardt, Thomas Schwentick |
| 2008 | MFCS | Optimizing Conjunctive Queries over Trees Using Schema Information. | Henrik Bjrklund, Wim Martens, Thomas Schwentick |
| 2008 | STACS | A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract). | Thomas Schwentick |
| 2007 | FCT | On Notions of Regularity for Data Languages. | Henrik Bjrklund, Thomas Schwentick |
| 2007 | PODS | Generalized hypertree decompositions: np-hardness and tractable variants. | Georg Gottlob, Zoltn Mikls, Thomas Schwentick |
| 2007 | PODS | The complexity of reasoning about pattern-based XML schemas. | Gjergji Kasneci, Thomas Schwentick |
| 2007 | STACS | Bounded-Variable Fragments of Hybrid Logics. | Thomas Schwentick, Volker Weber |
| 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 |
| 2006 | VLDB | Inference of Concise DTDs from XML Data. | Geert Jan Bex, Frank Neven, Thomas Schwentick, Karl Tuyls |
| 2005 | CADE | On the Complexity of Equational Horn Clauses. | Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick |
| 2005 | ICDT | Which XML Schemas Admit 1-Pass Preorder Typing? | Wim Martens, Frank Neven, Thomas Schwentick |
| 2005 | WWW | Expressiveness of XSDs: from practice to theory, there and back again. | Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick |
| 2005 | STACS | Dynamic Complexity Theory Revisited. | Volker Weber, Thomas Schwentick |
| 2004 | ICALP | Counting in Trees for Free. | Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl |
| 2004 | MFCS | Complexity of Decision Problems for Simple Regular Expressions. | Wim Martens, Frank Neven, Thomas Schwentick |
| 2004 | PODS | Trees, Automata and XML. | Thomas Schwentick |
| 2004 | STACS | Active Context-Free Games. | Anca Muscholl, Thomas Schwentick, Luc Segoufin |
| 2003 | ICDT | XPath Containment in the Presence of Disjunction, DTDs, and Variables. | Frank Neven, Thomas Schwentick |
| 2003 | PODS | Numerical document queries. | Helmut Seidl, Thomas Schwentick, Anca Muscholl |
| 2001 | DLT | Second-Order Logic over Strings: Regular and Non-regular Fragments. | Thomas Eiter, Georg Gottlob, Thomas Schwentick |
| 2001 | DLT | Partially-Ordered Two-Way Automata: A New Characterization of DA. | Thomas Schwentick, Denis Thrien, Heribert Vollmer |
| 2001 | LICS | A Model-Theoretic Approach to Regular String Relations. | Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin |
| 2001 | MFCS | Towards Regular Languages over Infinite Alphabets. | Frank Neven, Thomas Schwentick, 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 | FOCS | Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. | Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick |
| 2000 | ICALP | The Many Faces of a Translation. | Pierre McKenzie, Thomas Schwentick, Denis Thrien, Heribert Vollmer |
| 2000 | ICALP | On the Power of Tree-Walking Automata. | Frank Neven, Thomas Schwentick |
| 2000 | MFCS | On Diving in Trees. | Thomas Schwentick |
| 2000 | PODS | Expressive and Efficient Pattern Languages for Tree-Structured Data. | Frank Neven, Thomas Schwentick |
| 1999 | PODS | Query Automata. | Frank Neven, Thomas Schwentick |
| 1999 | STACS | The Descriptive Complexity Approach to LOGCFL. | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer |
| 1999 | STACS | A Logical Characterisation of Linear Time on Nondeterministic Turing Machines. | Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick |
| 1998 | CSL | Descriptive Complexity, Lower Bounds and Linear Time. | Thomas Schwentick |
| 1998 | MFCS | Locality of Order-Invariant First-Order Formulas. | Martin Grohe, Thomas Schwentick |
| 1998 | STACS | Local Normal Forms for First-Order Logic with Applications to Games and Automata. | Thomas Schwentick, Klaus Barthelmann |
| 1997 | CSL | Padding and the Expressive Power of Existential Second-Order Logics. | Thomas Schwentick |
| 1997 | STACS | Algebraic and Logical Characterizations of Deterministic Linear Time Classes. | Thomas Schwentick |
| 1996 | STACS | On Bijections vs. Unary Functions. | Thomas Schwentick |
| 1995 | ICALP | Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree. | Thomas Schwentick |
| 1994 | CSL | Logics For Context-Free Languages. | Clemens Lautemann, Thomas Schwentick, Denis Thrien |
| 1994 | FOCS | Graph Connectivity and Monadic NP | Thomas Schwentick |