Schema design for XML repositories: complexity and tractability. - Wim Martens; Matthias Niewerth; Thomas Schwentick (PODS, 2010)

Two-variable logic and key constraints on data words. - Matthias Niewerth; Thomas Schwentick (ICDT, 2011)

Descriptional Complexity of Deterministic Regular Expressions. - Katja Losemann; Wim Martens; Matthias Niewerth (MFCS, 2012)

Developing and Analyzing XSDs through BonXai. - Wim Martens; Frank Neven; Matthias Niewerth; Thomas Schwentick (Proc. VLDB Endow., 2012)

Definability by Weakly Deterministic Regular Expressions with Counters is Decidable. - Markus Latte; Matthias Niewerth (MFCS (1), 2015)

Minimization of Tree Pattern Queries. - Wojciech Czerwinski; Wim Martens; Matthias Niewerth; Pawel Parys (PODS, 2016)

On the state complexity of closures and interiors of regular languages with subwords and superwords. - Prateek Karandikar; Matthias Niewerth; Philippe Schnoebelen (Theor. Comput. Sci., 2016)

Closure properties and descriptional complexity of deterministic regular expressions. - Katja Losemann; Wim Martens; Matthias Niewerth (Theor. Comput. Sci., 2016)

Data definition languages for XML repository management systems. - Matthias Niewerth (Der Andere Verlag, 2016)

Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data. - Wojciech Czerwinski; Wim Martens; Matthias Niewerth; Pawel Parys (SIGMOD Rec., 2017)

BonXai: Combining the Simplicity of DTD with the Expressiveness of XML Schema. - Wim Martens; Frank Neven; Matthias Niewerth; Thomas Schwentick (ACM Trans. Database Syst., 2017)

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras. - Matthias Niewerth (LICS, 2018)

Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates. - Matthias Niewerth; Luc Segoufin (PODS, 2018)

Minimization of Tree Patterns. - Wojciech Czerwinski; Wim Martens; Matthias Niewerth; Pawel Parys (J. ACM, 2018)

Reasoning About XML Constraints Based on XML-to-Relational Mappings. - Matthias Niewerth; Thomas Schwentick (Theory Comput. Syst., 2018)

Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. - Antoine Amarilli; Pierre Bourhis; Stefan Mengel; Matthias Niewerth (PODS, 2019)

Containment of Simple Conjunctive Regular Path Queries. - Diego Figueira; Adwait Godbole; S. Krishna 004; Wim Martens; Matthias Niewerth; Tina Trautner (KR, 2020)

Containment of Simple Regular Path Queries. - Diego Figueira; Adwait Godbole; S. Krishna 004; Wim Martens; Matthias Niewerth; Tina Trautner (CoRR, 2020)

Constant-Delay Enumeration for Nondeterministic Document Spanners. - Antoine Amarilli; Pierre Bourhis; Stefan Mengel; Matthias Niewerth (SIGMOD Rec., 2020)

Optimal Algorithms for Multiway Search on Partial Orders. - Shangqi Lu; Wim Martens; Matthias Niewerth; Yufei Tao 001 (PODS, 2022)

Representing Paths in Graph Database Pattern Matching. - Wim Martens; Matthias Niewerth; Tina Popp; Stijn Vansummeren; Domagoj Vrgoc (CoRR, 2022)

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras. - Sarah Kleest-Meißner; Jonas Marasus; Matthias Niewerth (CoRR, 2022)

A Unifying Perspective on Succinct Data Representations. - Benny Kimelfeld; Wim Martens; Matthias Niewerth (CoRR, 2023)

A Trichotomy for Regular Trail Queries. - Wim Martens; Matthias Niewerth; Tina Popp (Log. Methods Comput. Sci., 2023)

Representing Paths in Graph Database Pattern Matching. - Wim Martens; Matthias Niewerth; Tina Popp; Carlos Rojas; Stijn Vansummeren; Domagoj Vrgoc (Proc. VLDB Endow., 2023)

An Optimal Algorithm for Partial Order Multiway Search. - Shangqi Lu; Wim Martens; Matthias Niewerth; Yufei Tao 001 (SIGMOD Rec., 2023)

Partial Order Multiway Search. - Shangqi Lu; Wim Martens; Matthias Niewerth; Yufei Tao 001 (ACM Trans. Database Syst., 2023)

Compact Path Representations for Graph Database Pattern Matching. - Wim Martens; Matthias Niewerth; Tina Popp; Carlos Rojas; Stijn Vansummeren; Domagoj Vrgoc (ICDEW, 2024)

PACMMOD Volume 2 Issue 2: Editorial. - Floris Geerts; Wim Martens; Matthias Niewerth (Proc. ACM Manag. Data, 2024)

A Formal Language Perspective on Factorized Representations. - Benny Kimelfeld; Wim Martens; Matthias Niewerth (ICDT, 2025)