Matthias Niewerth

According to our database, Matthias Niewerth authored at least 27 papers between 2010 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Partial Order Multiway Search.

Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao

ACM Trans. Database Syst., December, 2023

An Optimal Algorithm for Partial Order Multiway Search.

Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao

SIGMOD Rec., 2023

Representing Paths in Graph Database Pattern Matching.

Wim Martens, Matthias Niewerth, Tina Popp, Carlos Rojas, Stijn Vansummeren, Domagoj Vrgoc

Proc. VLDB Endow., 2023

A Trichotomy for Regular Trail Queries.

Wim Martens, Matthias Niewerth, Tina Popp

Log. Methods Comput. Sci., 2023

A Unifying Perspective on Succinct Data Representations.

Benny Kimelfeld, Wim Martens, Matthias Niewerth

CoRR, 2023

2022

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras.

Sarah Kleest-Meißner, Jonas Marasus, Matthias Niewerth

CoRR, 2022

Representing Paths in Graph Database Pattern Matching.

Wim Martens, Matthias Niewerth, Tina Popp, Stijn Vansummeren, Domagoj Vrgoc

CoRR, 2022

Optimal Algorithms for Multiway Search on Partial Orders.

Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

2020

Constant-Delay Enumeration for Nondeterministic Document Spanners.

Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth

SIGMOD Rec., 2020

Containment of Simple Regular Path Queries.

Diego Figueira, Adwait Godbole, S. Krishna, Wim Martens, Matthias Niewerth, Tina Trautner

CoRR, 2020

Containment of Simple Conjunctive Regular Path Queries.

Diego Figueira, Adwait Godbole, S. Krishna, Wim Martens, Matthias Niewerth, Tina Trautner

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

2019

Enumeration on Trees with Tractable Combined Complexity and Efficient Updates.

Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

2018

Reasoning About XML Constraints Based on XML-to-Relational Mappings.

Matthias Niewerth, Thomas Schwentick

Theory Comput. Syst., 2018

Minimization of Tree Patterns.

Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys

J. ACM, 2018

Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates.

Matthias Niewerth, Luc Segoufin

Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras.

Matthias Niewerth

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

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

Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data.

Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys

SIGMOD Rec., 2017

2016

Data definition languages for XML repository management systems.

Matthias Niewerth

PhD thesis, 2016

Closure properties and descriptional complexity of deterministic regular expressions.

Katja Losemann, Wim Martens, Matthias Niewerth

Theor. Comput. Sci., 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

Minimization of Tree Pattern Queries.

Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015

Definability by Weakly Deterministic Regular Expressions with Counters is Decidable.

Markus Latte, Matthias Niewerth

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2012

Developing and Analyzing XSDs through BonXai.

Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick

Proc. VLDB Endow., 2012

Descriptional Complexity of Deterministic Regular Expressions.

Katja Losemann, Wim Martens, Matthias Niewerth

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Two-variable logic and key constraints on data words.

Matthias Niewerth, Thomas Schwentick

Proceedings of the Database Theory, 2011

2010

Schema design for XML repositories: complexity and tractability.

Wim Martens, Matthias Niewerth, Thomas Schwentick

Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010