default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Niewerth
Person information
- affiliation: University of Bayreuth, Department of Computer Science, Germany
- affiliation: TU Dortmund, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Floris Geerts
, Wim Martens, Matthias Niewerth:
PACMMOD Volume 2 Issue 2: Editorial. Proc. ACM Manag. Data 2(2): 73 (2024)- [c15]Wim Martens, Matthias Niewerth, Tina Popp, Carlos Rojas, Stijn Vansummeren, Domagoj Vrgoc:
Compact Path Representations for Graph Database Pattern Matching. ICDEW 2024: 379-380 - 2023
- [j13]Wim Martens, Matthias Niewerth, Tina Popp:
A Trichotomy for Regular Trail Queries. Log. Methods Comput. Sci. 19(4) (2023) - [j12]Wim Martens, Matthias Niewerth, Tina Popp, Carlos Rojas, Stijn Vansummeren, Domagoj Vrgoc:
Representing Paths in Graph Database Pattern Matching. Proc. VLDB Endow. 16(7): 1790-1803 (2023) - [j11]Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao:
An Optimal Algorithm for Partial Order Multiway Search. SIGMOD Rec. 52(1): 84-92 (2023) - [j10]Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao:
Partial Order Multiway Search. ACM Trans. Database Syst. 48(4): 10:1-10:31 (2023) - [i8]Benny Kimelfeld, Wim Martens, Matthias Niewerth:
A Unifying Perspective on Succinct Data Representations. CoRR abs/2309.11663 (2023) - 2022
- [c14]Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao:
Optimal Algorithms for Multiway Search on Partial Orders. PODS 2022: 175-187 - [i7]Wim Martens, Matthias Niewerth, Tina Popp, Stijn Vansummeren, Domagoj Vrgoc:
Representing Paths in Graph Database Pattern Matching. CoRR abs/2207.13541 (2022) - [i6]Sarah Kleest-Meißner, Jonas Marasus, Matthias Niewerth:
MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras. CoRR abs/2208.04180 (2022) - 2021
- [j9]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Constant-Delay Enumeration for Nondeterministic Document Spanners. ACM Trans. Database Syst. 46(1): 2:1-2:30 (2021) - 2020
- [j8]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Constant-Delay Enumeration for Nondeterministic Document Spanners. SIGMOD Rec. 49(1): 25-32 (2020) - [c13]Diego Figueira, Adwait Godbole, S. Krishna, Wim Martens, Matthias Niewerth, Tina Trautner:
Containment of Simple Conjunctive Regular Path Queries. KR 2020: 371-380 - [c12]Wim Martens, Matthias Niewerth, Tina Trautner:
A Trichotomy for Regular Trail Queries. STACS 2020: 7:1-7:16 - [i5]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Constant-Delay Enumeration for Nondeterministic Document Spanners. CoRR abs/2003.02576 (2020) - [i4]Diego Figueira, Adwait Godbole, S. Krishna, Wim Martens, Matthias Niewerth, Tina Trautner:
Containment of Simple Regular Path Queries. CoRR abs/2003.04411 (2020)
2010 – 2019
- 2019
- [c11]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Constant-Delay Enumeration for Nondeterministic Document Spanners. ICDT 2019: 22:1-22:19 - [c10]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. PODS 2019: 89-103 - [i3]Wim Martens, Matthias Niewerth, Tina Trautner:
A Trichotomy for Regular Trail Queries. CoRR abs/1903.00226 (2019) - 2018
- [j7]Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys:
Minimization of Tree Patterns. J. ACM 65(4): 26:1-26:46 (2018) - [j6]Matthias Niewerth, Thomas Schwentick:
Reasoning About XML Constraints Based on XML-to-Relational Mappings. Theory Comput. Syst. 62(8): 1826-1879 (2018) - [c9]Matthias Niewerth:
MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras. LICS 2018: 769-778 - [c8]Matthias Niewerth, Luc Segoufin:
Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates. PODS 2018: 179-191 - [i2]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Constant-Delay Enumeration for Nondeterministic Document Spanners. CoRR abs/1807.09320 (2018) - [i1]Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth:
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates. CoRR abs/1812.09519 (2018) - 2017
- [j5]Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys:
Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data. SIGMOD Rec. 46(1): 15-22 (2017) - [j4]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): 15:1-15:42 (2017) - 2016
- [b1]Matthias Niewerth:
Data definition languages for XML repository management systems. Technical University of Dortmund, Germany, Der Andere Verlag 2016, ISBN 978-3-86247-578-0, pp. 1-238 - [j3]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: 91-107 (2016) - [j2]Katja Losemann, Wim Martens, Matthias Niewerth:
Closure properties and descriptional complexity of deterministic regular expressions. Theor. Comput. Sci. 627: 54-70 (2016) - [c7]Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys:
Minimization of Tree Pattern Queries. PODS 2016: 43-54 - 2015
- [c6]Markus Latte, Matthias Niewerth:
Definability by Weakly Deterministic Regular Expressions with Counters is Decidable. MFCS (1) 2015: 369-381 - [c5]Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick:
BonXai: Combining the simplicity of DTD with the expressiveness of XML Schema. PODS 2015: 145-156 - 2014
- [c4]Matthias Niewerth, Thomas Schwentick:
Reasoning about XML Constraints based on XML-to-relational mappings. ICDT 2014: 72-83 - 2012
- [j1]Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick:
Developing and Analyzing XSDs through BonXai. Proc. VLDB Endow. 5(12): 1994-1997 (2012) - [c3]Katja Losemann, Wim Martens, Matthias Niewerth:
Descriptional Complexity of Deterministic Regular Expressions. MFCS 2012: 643-654 - 2011
- [c2]Matthias Niewerth, Thomas Schwentick:
Two-variable logic and key constraints on data words. ICDT 2011: 138-149 - 2010
- [c1]Wim Martens, Matthias Niewerth, Thomas Schwentick:
Schema design for XML repositories: complexity and tractability. PODS 2010: 239-250
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
