| 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 | 275 | 2021 |
| 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 | 220 | 2006 |
| Graph pattern matching in GQL and SQL/PGQ A Deutsch, N Francis, A Green, K Hare, B Li, L Libkin, T Lindaaker, ... Proceedings of the 2022 International Conference on Management of Data, 2246 …, 2022 | 182 | 2022 |
| An analytical study of large SPARQL query logs A Bonifati, W Martens, T Timm PVLDB 11, 2017 | 174 | 2017 |
| An analytical study of large SPARQL query logs A Bonifati, W Martens, T Timm The VLDB Journal 29 (2), 655-679, 2020 | 164 | 2020 |
| Querying graphs with data L Libkin, W Martens, D Vrgoč Journal of the ACM (JACM) 63 (2), 14, 2016 | 133 | 2016 |
| Pg-schema: Schemas for property graphs R Angles, A Bonifati, S Dumbrava, G Fletcher, A Green, J Hidders, B Li, ... Proceedings of the ACM on Management of Data 1 (2), 1-25, 2023 | 124 | 2023 |
| Querying graph databases with XPath L Libkin, W Martens, D Vrgoč Proceedings of the 16th International Conference on Database Theory, 129-140, 2013 | 111 | 2013 |
| 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 | 98 | 2007 |
| Frontiers of tractability for typechecking simple XML transformations W Martens, F Neven Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on …, 2004 | 98 | 2004 |
| Navigating the maze of Wikidata query logs A Bonifati, W Martens, T Timm The World Wide Web Conference, 127-138, 2019 | 96 | 2019 |
| Pg-keys: Keys for property graphs R Angles, A Bonifati, S Dumbrava, G Fletcher, KW Hare, J Hidders, ... Proceedings of the 2021 International Conference on Management of Data, 2423 …, 2021 | 92 | 2021 |
| 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 | 91 | 2012 |
| Typechecking top-down uniform unranked tree transducers W Martens, F Neven International Conference on Database Theory, 64-78, 2002 | 86 | 2002 |
| 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 | 80 | 2004 |
| Regular expressions with counting: weak versus strong determinism W Gelade, M Gyssens, W Martens SIAM Journal on Computing 41 (1), 160-190, 2012 | 78 | 2012 |
| 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 | 76* | 2017 |
| A Researcher’s Digest of GQL N Francis, A Gheerbrant, P Guagliardo, L Libkin, V Marsault, W Martens, ... 26th International Conference on Database Theory (ICDT 2023), 2023 | 71 | 2023 |
| The complexity of regular expressions and property paths in SPARQL K Losemann, W Martens ACM Transactions on Database Systems (TODS) 38 (4), 24, 2013 | 69 | 2013 |
| 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 | 68 | 2013 |
Frank NevenProfessor of Computer Science, Hasselt UniversityVerified email at uhasselt.be
