Institutionen der Universität Bayreuth
Lehrstuhl Angewandte Informatik VII - Univ.-Prof. Dr. Wim Martens

Ahmetaj, Shqiponja ; Boneva, Iovka ; Hidders, Jan ; Jakubowski, Maxime ; Gayo, José Emilio Labra ; Martens, Wim ; Mogavero, Fabio ; Murlak, Filip ; Okulmus, Cem ; Savkovic, Ognjen ; Šimkus, Mantas ; Tomaszuk, Dominik:
Common Foundations for Recursive Shape Languages.
In: Wassermann, Renata ; Mugnier, Marie-Laure ; Baader, Franz (Hrsg.): Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning (KR 2026). - Lisbon, Portugal , 2026 . - S. 2-13
DOI: https://doi.org/10.24963/KR.2026/1

Bonifati, Angela ; Dimou, Anastasia ; Dumbrava, Stefania ; Fletcher, George ; Hose, Katja ; Konstantinidis, George ; Gayo, José Emilio Labra ; Martens, Wim ; Pardal, Nina ; Peterfreund, Liat ; Thornton, Katherine ; Vidal, Maria-Esther ; Voigt, Hannes:
How Human-Centric Are Our Graph Data Abstractions?
In: Transactions on Graph Data and Knowledge. Bd. 4 (2026) Heft 2 . - 2:1-2:31.
DOI: https://doi.org/10.4230/TGDK.4.2.2

Aref, Molham ; Guagliardo, Paolo ; Kastrinis, George ; Libkin, Leonid ; Marsault, Victor ; Martens, Wim ; McGrath, Mary ; Murlak, Filip ; Nystrom, Nathaniel J. ; Peterfreund, Liat ; Rogers, Allison ; Sirangelo, Cristina ; Vrgoč, Domagoj ; Zhao, David ; Zreika, Abdul:
Relational Programming in Rel.
In: ACM SIGMOD Record. Bd. 55 (2026) Heft 1 . - S. 97-104.
DOI: https://doi.org/10.1145/3810900.3810918

Hammerer, Janik ; Martens, Wim:
A Compendium of Regular Expression Shapes in SPARQL Queries.
In: Arora, Akhil ; Dumbrava, Stefania (Hrsg.): Proceedings of the 8th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA). - New York, NY : Association for Computing Machinery, 2025 . - 4
DOI: https://doi.org/10.1145/3735546.3735853

Arenas, Marcelo ; Franconi, Enrico ; Hammerer, Janik ; Hartig, Olaf ; Hose, Katja ; Koesten, Laura ; Konstantinidis, George ; Libkin, Leonid ; Martens, Wim ; Sasaki, Yuya ; Scherzinger, Stefanie ; Thornton, Katherine ; Wu, Hsiang-Yun:
Exploring Exploratory Querying.
In: Proceedings of the VLDB Endowment. Bd. 18 (2025) Heft 13 . - S. 5731-5739.
DOI: https://doi.org/10.14778/3773731.3773746

Libkin, Leonid ; Martens, Wim ; Murlak, Filip ; Peterfreund, Liat ; Vrgoč, Domagoj:
Querying Graph Data : Where We Are and Where To Go.
In: Companion of the 44th Symposium on Principles of Database Systems. - New York, NY : Association for Computing Machinery, 2025 . - S. 9-26
DOI: https://doi.org/10.1145/3722234.3725822

Bonifati, Angela ; Dumbrava, Stefania ; Fletcher, George ; Hidders, Jan ; Hofer, Matthias ; Martens, Wim ; Murlak, Filip ; Shinavier, Joshua ; Staworko, Sławek ; Tomaszuk, Dominik:
Threshold queries in theory and in the wild.
In: The VLDB Journal. Bd. 34 (2025) Heft 4 . - 49.
DOI: https://doi.org/10.1007/S00778-025-00916-W

Popp, Tina:
Evaluation and Enumeration of Regular Simple Path and Trail Queries.
Bayreuth , 2022 . - x, 209 S.
( Dissertation, 2022 , Universität Bayreuth, Fakultät für Mathematik, Physik und Informatik)
DOI: https://doi.org/10.15495/EPub_UBT_00006606

Doleschal, Johannes:
Optimization and Parallelization of RegEx Based Information Extraction.
Bayreuth , 2021 . - XVII, 176 S.
( Dissertation, 2021 , Universität Bayreuth, Bayreuther Graduiertenschule für Mathematik und Naturwissenschaften - BayNAT)
DOI: https://doi.org/10.15495/EPub_UBT_00005737

Timm, Thomas:
Exploration of Large-Scale SPARQL Query Collections : Finding Structure and Regularity for Optimizing Database Systems.
Bayreuth , 2020 . - xii, 153 S.
( Dissertation, 2020 , Universität Bayreuth, Fakultät für Mathematik, Physik und Informatik)
DOI: https://doi.org/10.15495/EPub_UBT_00004634

Bonifati, Angela ; Martens, Wim ; Timm, Thomas:
Navigating the Maze of Wikidata Query Logs.
In: The World Wide Web Conference : Proceedings. - New York , 2019 . - S. 127-138
DOI: https://doi.org/10.1145/3308558.3313472

Doleschal, Johannes ; Kimelfeld, Benny ; Martens, Wim ; Nahshon, Yoav ; Neven, Frank:
Split-Correctness in Information Extraction.
In: Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. - New York , 2019 . - S. 149-163
DOI: https://doi.org/10.1145/3294052.3319684

Beedkar, Kaustubh ; Gemulla, Rainer ; Martens, Wim:
A Unified Framework for Frequent Sequence Mining with Subsequence Constraints.
In: ACM Transactions on Database Systems. Bd. 44 (2019) Heft 3 . - 11.
DOI: https://doi.org/10.1145/3321486

Sauer, Lukas ; Henrich, Dominik ; Martens, Wim:
Towards Intuitive Robot Programming Using Finite State Automata.
In: Benzmüller, Christoph ; Stuckenschmidt, Heiner (Hrsg.): KI 2019: Advances in Artificial Intelligence. - Cham : Springer, 2019 . - S. 290-298
DOI: https://doi.org/10.1007/978-3-030-30179-8_25

Doleschal, Johannes ; Höllerich, Nico ; Martens, Wim ; Neven, Frank:
Chisel : Sculpting Tabular and Non-Tabular Data on the Web.
In: Companion Proceedings of the The Web Conference 2018. - Lyon , 2018 . - S. 139-142
DOI: https://doi.org/10.1145/3184558.3186963

Björklund, Henrik ; Martens, Wim ; Schwentick, Thomas:
Conjunctive query containment over trees using schema information.
In: Acta Informatica. Bd. 55 (2018) Heft 1 . - S. 17-56.
DOI: https://doi.org/10.1007/s00236-016-0282-1

Bonifati, Angela ; Martens, Wim ; Timm, Thomas:
DARQL : Deep Analysis of SPARQL Queries.
In: Companion of the The Web Conference 2018 on The Web Conference 2018, WWW 2018, Lyon , France, April 23-27, 2018. - Lyon , 2018 . - S. 187-190
DOI: https://doi.org/10.1145/3184558.3186975

Niewerth, Matthias ; Segoufin, Luc:
Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates.
In: SIGMOND-PODS '18 : Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Houston, TX, USA, June 10-15, 2018. - Houston , 2018 . - S. 179-191
DOI: https://doi.org/10.1145/3196959.3196961

Martens, Wim ; Trautner, Tina:
Evaluation and Enumeration Problems for Regular Path Queries.
In: Kimelfeld, Benny ; Amsterdamer, Yael (Hrsg.): 21st International Conference on Database Theory (ICDT 2018) : Proceedings. - Saarbrücken , 2018 . - No. 19 . - (Leibniz International Proceedings in Informatics (LIPIcs) ; 98 )
DOI: https://doi.org/10.4230/LIPIcs.ICDT.2018.19

Czerwinski, Wojciech ; Martens, Wim ; Niewerth, Matthias ; Parys, Pawel:
Minimization of Tree Patterns.
In: Journal of the ACM. Bd. 65 (2018) Heft 4 . - 26.
DOI: https://doi.org/10.1145/3180281

Niewerth, Matthias:
MSO Queries on Trees : Enumerating Answers under Updates Using Forest Algebras.
In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. - Oxford, UK , 2018 . - S. 769-778
DOI: https://doi.org/10.1145/3209108.3209144

Doleschal, Johannes ; Martens, Wim ; Neven, Frank ; Witkowski, Adam:
Satisfiability for SCULPT-Schemas for CSV-Like Data.
In: Kimelfeld, Benny ; Yael, Amsterdamer (Hrsg.): 21st International Conference on Database Theory, March 26-29, 2018 - Vienna, Austria : Proceedings. - Wadern : Schloss Dagstuhl, 2018 . - No. 14
DOI: https://doi.org/10.4230/LIPIcs.ICDT.2018.14

Bonifati, Angela ; Martens, Wim ; Timm, Thomas:
An Analytical Study of Large SPARQL Query Logs.
In: Proceedings of the VLDB Endowment. Bd. 11 (2017) Heft 2 . - S. 149-161.
DOI: https://doi.org/10.14778/3149193.3149196

Martens, Wim ; Neven, Frank ; Niewerth, Matthias ; Schwentick, Thomas:
BonXai : Combining the Simplicity of DTD with the Expressiveness of XML Schema.
In: ACM Transactions on Database Systems. Bd. 42 (2017) Heft 3 . - 15.
DOI: https://doi.org/10.1145/3105960

Czerwinski, Wojciech ; Martens, Wim ; van Rooijen, Lorijn ; Zeitoun, Marc ; Zetzsche, Georg:
A Characterization for Decidable Separability by Piecewise Testable Languages.
In: Discrete Mathematics and Theoretical Computer Science. Bd. 19 (2017) Heft 4 .
DOI: https://doi.org/10.23638/DMTCS-19-4-1

Czerwinski, Wojciech ; David, Claire ; Losemann, Katja ; Martens, Wim:
Deciding definability by deterministic regular expressions.
In: Journal of Computer and System Sciences. Bd. 88 (2017) . - S. 75-89.
DOI: https://doi.org/10.1016/j.jcss.2017.03.011

Martens, Wim:
Optimizing tree pattern queries : why cutting is not enough (invited talk).
In: STOC 2017 Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. - Montreal , 2017 . - S. 3
DOI: https://doi.org/10.1145/3055399.3079076

Czerwinski, Wojciech ; Martens, Wim ; Niewerth, Matthias ; Parys, Pawel:
Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data.
In: ACM SIGMOD Record. Bd. 46 (2017) Heft 1 . - S. 15-22.
DOI: https://doi.org/10.1145/3093754.3093759

Losemann, Katja ; Martens, Wim ; Niewerth, Matthias:
Closure properties and descriptional complexity of deterministic regular expressions.
In: Theoretical Computer Science. Bd. 627 (2016) . - S. 54-70.
DOI: https://doi.org/10.1016/j.tcs.2016.02.027

Czerwinski, Wojciech ; Martens, Wim ; Niewerth, Matthias ; Parys, Pawel:
Minimization of Tree Pattern Queries.
In: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, June 26 - July 01, 2016. - San Francisco , 2016 . - S. 43-54
DOI: https://doi.org/10.1145/2902251.2902295

Libkin, Leonid ; Martens, Wim ; Vrgoc, Domagoj:
Querying Graphs with Data.
In: Journal of the ACM. Bd. 63 (2016) Heft 2 . - 14.
DOI: https://doi.org/10.1145/2850413

Czerwinski, Wojciech ; Martens, Wim ; Parys, Pawel ; Przybylko, Marcin:
The (Almost) Complete Guide to Tree Pattern Containment.
In: PODS '15 : Proceedings of the 34th ACM Symposium on Principles of Database Systems, PODS 2015, Melbourne, Victoria, Australia, May 31 - June 4, 2015. - New York , 2015 . - S. 117-130
DOI: https://doi.org/10.1145/2745754.2745766

Martens, Wim ; Neven, Frank ; Niewerth, Matthias ; Schwentick, Thomas:
BonXai: Combining the simplicity of DTD with the expressiveness of XML Schema.
In: Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. - New York , 2015 . - S. 145-156
DOI: https://doi.org/10.1145/2745754.2745774

Björklund, Henrik ; Martens, Wim ; Timm, Thomas:
Efficient Incremental Evaluation of Succinct Regular Expressions.
In: Proceedings of the 24th ACM International Conference on Information and Knowledge Management. - New York , 2015 . - S. 1541-1550
DOI: https://doi.org/10.1145/2806416.2806434

Losemann, Katja:
Foundations of Regular Languages for Processing RDF and XML.
Bayreuth , 2015 . - XIV, 175 S.
( Dissertation, 2015 , Universität Bayreuth, Fakultät für Mathematik, Physik und Informatik)

Czerwinski, Wojciech ; Martens, Wim ; van Rooijen, Lorijn ; Zeitoun, Marc:
A Note on Decidable Separability by Piecewise Testable Languages.
In: Kosowski, Adrian ; Walukiewicz, Igor (Hrsg.): Fundamentals of Computation Theory : 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings. - Gdańsk , 2015 . - S. 173-185
DOI: https://doi.org/10.1007/978-3-319-22177-9_14

Martens, Wim ; Neven, Frank ; Vansummeren, Stijn:
SCULPT: A Schema Language for Tabular Data on the Web.
In: Gangemi, Aldo ; Leonardi, Stefano ; Panconesi, Alessandro (Hrsg.): Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, May 18-22, 2015. - Florence , 2015 . - S. 702-720
DOI: https://doi.org/10.1145/2736277.2741142

Hofman, Piotr ; Martens, Wim:
Separability by Short Subsequences and Subwords.
In: 18th International Conference on Database Theory. - Wadern : Schloss Dagstuhl, 2015 . - S. 230-246 . - (Leibniz International Proceedings in Informatics (LIPIcs) ; 31 )
DOI: https://doi.org/10.4230/LIPIcs.ICDT.2015.230

Losemann, Katja ; Martens, Wim:
The complexity of regular expressions and property paths in SPARQL.
In: ACM Transactions on Database Systems. Bd. 38 (2013) Heft 4 . - 24.
DOI: https://doi.org/10.1145/2494529

David, Claire ; Gheerbrant, Amélie ; Libkin, Leonid ; Martens, Wim:
Containment of pattern-based queries over data trees.
In: Proceedings of the 16th International Conference on Database Theory. - New York , 2013 . - S. 201-212
DOI: https://doi.org/10.1145/2448496.2448521

Czerwinski, Wojciech ; Martens, Wim ; Masopust, Tomas:
Efficient Separability of Regular Languages by Subsequences and Suffixes.
In: 40th International Colloquium on Automata, Languages, and Programming. - Berlin , 2013 . - S. 150-161
DOI: https://doi.org/10.1007/978-3-642-39212-2_16

Antonopoulos, Timos ; Geerts, Floris ; Martens, Wim ; Neven, Frank:
Generating, Sampling and Counting Subclasses of Regular Tree Languages.
In: Theory of Computing Systems. Bd. 52 (2013) Heft 3 . - S. 542-585.
DOI: https://doi.org/10.1007/s00224-012-9428-x

Libkin, Leonid ; Martens, Wim ; Vrgoc, Domagoj:
Querying graph databases with XPath.
In: Proceedings of the 16th International Conference on Database Theory. - New York , 2013 . - S. 129-140
DOI: https://doi.org/10.1145/2448496.2448513

Losemann, Katja ; Martens, Wim:
The complexity of evaluating path expressions in SPARQL.
In: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems. - New York , 2012 . - S. 101-112
DOI: https://doi.org/10.1145/2213556.2213573

Martens, Wim ; Neven, Frank ; Niewerth, Matthias ; Schwentick, Thomas:
Developing and Analyzing XSDs through BonXai.
In: Proceedings of the VLDB Endowment. Bd. 5 (2012) Heft 12 . - S. 1994-1997.
DOI: https://doi.org/10.14778/2367502.2367556

Gelade, Wouter ; Gyssens, Marc ; Martens, Wim:
Regular Expressions with Counting : Weak versus Strong Determinism.
In: SIAM Journal on Computing. Bd. 41 (2012) Heft 1 . - S. 160-190.
DOI: https://doi.org/10.1137/100814196

Björklund, Henrik ; Martens, Wim:
The tractability frontier for NFA minimization.
In: Journal of Computer and System Sciences. Bd. 78 (2012) Heft 1 . - S. 198-210.
DOI: https://doi.org/10.1016/j.jcss.2011.03.001

Antonopoulos, Timos ; Martens, Wim ; Neven, Frank:
The complexity of text-preserving XML transformations.
In: Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. - New York , 2011 . - S. 247-258
DOI: https://doi.org/10.1145/1989284.1989316

Niewerth, Matthias ; Schwentick, Thomas:
Two-variable logic and key constraints on data words.
In: ICDT '11 Proceedings of the 14th International Conference on Database Theory. - Uppsala , 2011 . - S. 138-149
DOI: https://doi.org/10.1145/1938551.1938571