Follow
Wim Martens
Title
Cited by
Cited by
Year
Expressiveness and complexity of XML Schema
W Martens, F Neven, T Schwentick, GJ Bex
ACM Transactions on Database Systems (TODS) 31 (3), 770-813, 2006
2172006
An analytical study of large SPARQL query logs
A Bonifati, W Martens, T Timm
PVLDB 11, 2017
1322017
Querying graph databases with XPath
L Libkin, W Martens, D Vrgoč
Proceedings of the 16th International Conference on Database Theory, 129-140, 2013
982013
On the minimization of XML schemas and tree automata for unranked trees
W Martens, J Niehren
Journal of Computer and System Sciences 73 (4), 550-583, 2007
942007
Querying graphs with data
L Libkin, W Martens, D Vrgoč
Journal of the ACM (JACM) 63 (2), 14, 2016
922016
Frontiers of tractability for typechecking simple XML transformations
W Martens, F Neven
Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on …, 2004
902004
Typechecking top-down uniform unranked tree transducers
W Martens, F Neven
International Conference on Database Theory, 64-78, 2003
812003
The complexity of evaluating path expressions in SPARQL
K Losemann, W Martens
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of …, 2012
772012
Complexity of decision problems for simple regular expressions
W Martens, F Neven, T Schwentick
International Symposium on Mathematical Foundations of Computer Science, 889-900, 2004
772004
The future is big graphs: a community view on graph processing systems
S Sakr, A Bonifati, H Voigt, A Iosup, K Ammar, R Angles, W Aref, M Arenas, ...
Communications of the ACM 64 (9), 62-71, 2021
732021
Efficient separability of regular languages by subsequences and suffixes
W Czerwiński, W Martens, T Masopust
International Colloquium on Automata, Languages, and Programming, 150-161, 2013
682013
Complexity of decision problems for XML schemas and chain regular expressions
W Martens, F Neven, T Schwentick
SIAM Journal on Computing 39 (4), 1486-1530, 2009
652009
An analytical study of large SPARQL query logs
A Bonifati, W Martens, T Timm
The VLDB Journal 29 (2), 655-679, 2020
642020
Regular expressions with counting: Weak versus strong determinism
W Gelade, M Gyssens, W Martens
SIAM Journal on Computing 41 (1), 160-190, 2012
612012
Conjunctive query containment over trees
H Björklund, W Martens, T Schwentick
Journal of Computer and System Sciences 77 (3), 450-472, 2011
61*2011
Research directions for Principles of Data Management (Dagstuhl perspectives workshop 16151)
S Abiteboul, M Arenas, P Barceló, M Bienvenu, D Calvanese, C David, ...
arXiv preprint arXiv:1701.09007, 2017
59*2017
The complexity of regular expressions and property paths in SPARQL
K Losemann, W Martens
ACM Transactions on Database Systems (TODS) 38 (4), 24, 2013
592013
Conjunctive query containment over trees using schema information
H Björklund, W Martens, T Schwentick
Acta Informatica 55 (1), 17-56, 2018
58*2018
On the complexity of typechecking top-down XML transformations
W Martens, F Neven
Theoretical Computer Science 336 (1), 153-180, 2005
582005
The tractability frontier for NFA minimization
H Björklund, W Martens
Journal of Computer and System Sciences, 2012
55*2012
The system can't perform the operation now. Try again later.
Articles 1–20