Matthias Niewerth

40 papers A* 8A 5B 1Journal 23Unranked 2
YearRankTypeTitle / Venue / Authors
2025 A conf
A Formal Language Perspective on Factorized Representations.
ICDT
Benny Kimelfeld, Wim Martens, Matthias Niewerth
2025 J jnl
MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras.
Log. Methods Comput. Sci.
Sarah Kleest-Meißner, Jonas Marasus, Matthias Niewerth
2024 — conf
Compact Path Representations for Graph Database Pattern Matching.
ICDEW
Wim Martens, Matthias Niewerth, Tina Popp, Carlos Rojas, Stijn Vansummeren, Domagoj Vrgoc
2024 J jnl
PACMMOD Volume 2 Issue 2: Editorial.
Proc. ACM Manag. Data
Floris Geerts, Wim Martens, Matthias Niewerth
2023 J jnl
A Trichotomy for Regular Trail Queries.
Log. Methods Comput. Sci.
Wim Martens, Matthias Niewerth, Tina Popp
2023 J jnl
A Unifying Perspective on Succinct Data Representations.
CoRR
Benny Kimelfeld, Wim Martens, Matthias Niewerth
2023 J jnl
An Optimal Algorithm for Partial Order Multiway Search.
SIGMOD Rec.
Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao
2023 J jnl
Partial Order Multiway Search.
ACM Trans. Database Syst.
Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao
2023 J jnl
Representing Paths in Graph Database Pattern Matching.
Proc. VLDB Endow.
Wim Martens, Matthias Niewerth, Tina Popp, Carlos Rojas, Stijn Vansummeren, Domagoj Vrgoc
2022 J jnl
MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras.
CoRR
Sarah Kleest-Meißner, Jonas Marasus, Matthias Niewerth
2022 A* conf
Optimal Algorithms for Multiway Search on Partial Orders.
PODS
Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao
2022 J jnl
Representing Paths in Graph Database Pattern Matching.
CoRR
Wim Martens, Matthias Niewerth, Tina Popp, Stijn Vansummeren, Domagoj Vrgoc
2021 J jnl
Constant-Delay Enumeration for Nondeterministic Document Spanners.
ACM Trans. Database Syst.
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2020 A conf
A Trichotomy for Regular Trail Queries.
STACS
Wim Martens, Matthias Niewerth, Tina Trautner
2020 J jnl
Constant-Delay Enumeration for Nondeterministic Document Spanners.
CoRR
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2020 J jnl
Constant-Delay Enumeration for Nondeterministic Document Spanners.
SIGMOD Rec.
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2020 A* conf
Containment of Simple Conjunctive Regular Path Queries.
KR
Diego Figueira, Adwait Godbole, S. Krishna, Wim Martens, Matthias Niewerth, Tina Trautner
2020 J jnl
Containment of Simple Regular Path Queries.
CoRR
Diego Figueira, Adwait Godbole, S. Krishna, Wim Martens, Matthias Niewerth, Tina Trautner
2019 J jnl
A Trichotomy for Regular Trail Queries.
CoRR
Wim Martens, Matthias Niewerth, Tina Trautner
2019 A conf
Constant-Delay Enumeration for Nondeterministic Document Spanners.
ICDT
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2019 A* conf
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates.
PODS
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2018 J jnl
Constant-Delay Enumeration for Nondeterministic Document Spanners.
CoRR
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2018 A* conf
Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates.
PODS
Matthias Niewerth, Luc Segoufin
2018 J jnl
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates.
CoRR
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2018 A* conf
MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras.
LICS
Matthias Niewerth
2018 J jnl
Minimization of Tree Patterns.
J. ACM
Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys
2018 J jnl
Reasoning About XML Constraints Based on XML-to-Relational Mappings.
Theory Comput. Syst.
Matthias Niewerth, Thomas Schwentick
2017 J jnl
BonXai: Combining the Simplicity of DTD with the Expressiveness of XML Schema.
ACM Trans. Database Syst.
Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick
2017 J jnl
Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data.
SIGMOD Rec.
Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys
2016 J jnl
Closure properties and descriptional complexity of deterministic regular expressions.
Theor. Comput. Sci.
Katja Losemann, Wim Martens, Matthias Niewerth
2016 — —
Data definition languages for XML repository management systems.
Matthias Niewerth
2016 A* conf
Minimization of Tree Pattern Queries.
PODS
Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys
2016 J jnl
On the state complexity of closures and interiors of regular languages with subwords and superwords.
Theor. Comput. Sci.
Prateek Karandikar, Matthias Niewerth, Philippe Schnoebelen
2015 A* conf
BonXai: Combining the simplicity of DTD with the expressiveness of XML Schema.
PODS
Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick
2015 — conf
Definability by Weakly Deterministic Regular Expressions with Counters is Decidable.
MFCS (1)
Markus Latte, Matthias Niewerth
2014 A conf
Reasoning about XML Constraints based on XML-to-relational mappings.
ICDT
Matthias Niewerth, Thomas Schwentick
2012 B conf
Descriptional Complexity of Deterministic Regular Expressions.
MFCS
Katja Losemann, Wim Martens, Matthias Niewerth
2012 J jnl
Developing and Analyzing XSDs through BonXai.
Proc. VLDB Endow.
Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick
2011 A conf
Two-variable logic and key constraints on data words.
ICDT
Matthias Niewerth, Thomas Schwentick
2010 A* conf
Schema design for XML repositories: complexity and tractability.
PODS
Wim Martens, Matthias Niewerth, Thomas Schwentick