Matthias Niewerth

ORCID

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 30

Top Venues

CoRR

PODS

SIGMOD Rec.

ACM Trans. Database Syst.

Technical University of Dortmund, Germany (PHD)

Education History

Technical University of Dortmund, Germany

PHD

Publications

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

Matthias Niewerth.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Matthias Niewerth