default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWim Martens
Person information
- affiliation: University of Bayreuth, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j52]Floris Geerts
, Wim Martens, Matthias Niewerth:
PACMMOD Volume 2 Issue 2: Editorial. Proc. ACM Manag. Data 2(2): 73 (2024)- [c60]Wim Martens, Matthias Niewerth, Tina Popp, Carlos Rojas, Stijn Vansummeren, Domagoj Vrgoc:
Compact Path Representations for Graph Database Pattern Matching. ICDEW 2024: 379-380 - [e2]Floris Geerts, Wim Martens:
Companion of the 43rd Symposium on Principles of Database Systems, PODS 2024, Santiago, Chile, June 9-15, 2024. ACM 2024 [contents] - 2023
- [j51]Johannes Doleschal, Benny Kimelfeld, Wim Martens:
The Complexity of Aggregates over Extractions by Regular Expressions. Log. Methods Comput. Sci. 19(3) (2023) - [j50]Wim Martens, Matthias Niewerth, Tina Popp:
A Trichotomy for Regular Trail Queries. Log. Methods Comput. Sci. 19(4) (2023) - [j49]Renzo Angles, Angela Bonifati, Stefania Dumbrava, George Fletcher, Alastair Green, Jan Hidders, Bei Li, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Stefan Plantikow, Ognjen Savkovic, Michael Schmidt, Juan Sequeda, Slawek Staworko, Dominik Tomaszuk, Hannes Voigt, Domagoj Vrgoc, Mingxi Wu, Dusan Zivkovic:
PG-Schema: Schemas for Property Graphs. Proc. ACM Manag. Data 1(2): 198:1-198:25 (2023) - [j48]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) - [j47]Angela Bonifati, Stefania Dumbrava, George Fletcher, Jan Hidders, Matthias Hofer, Wim Martens, Filip Murlak, Joshua Shinavier, Slawek Staworko, Dominik Tomaszuk:
Threshold Queries. SIGMOD Rec. 52(1): 64-73 (2023) - [j46]Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao:
An Optimal Algorithm for Partial Order Multiway Search. SIGMOD Rec. 52(1): 84-92 (2023) - [j45]Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao:
Partial Order Multiway Search. ACM Trans. Database Syst. 48(4): 10:1-10:31 (2023) - [c59]Nadime Francis, Amélie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, Domagoj Vrgoc:
A Researcher's Digest of GQL (Invited Talk). ICDT 2023: 1:1-1:22 - [c58]Nadime Francis, Amélie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, Domagoj Vrgoc:
GPC: A Pattern Calculus for Property Graphs. PODS 2023: 241-250 - [i21]Benny Kimelfeld, Wim Martens, Matthias Niewerth:
A Unifying Perspective on Succinct Data Representations. CoRR abs/2309.11663 (2023) - 2022
- [j44]Johannes Doleschal, Benny Kimelfeld, Wim Martens, Liat Peterfreund:
Weight Annotation in Information Extraction. Log. Methods Comput. Sci. 18(1) (2022) - [j43]Angela Bonifati, Stefania Dumbrava, George Fletcher, Jan Hidders, Matthias Hofer, Wim Martens, Filip Murlak, Joshua Shinavier, Slawek Staworko, Dominik Tomaszuk:
Threshold Queries in Theory and in the Wild. Proc. VLDB Endow. 15(5): 1105-1118 (2022) - [c57]Wim Martens, Tina Popp:
The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs. PODS 2022: 165-174 - [c56]Shangqi Lu, Wim Martens, Matthias Niewerth, Yufei Tao:
Optimal Algorithms for Multiway Search on Partial Orders. PODS 2022: 175-187 - [c55]Wim Martens:
Towards Theory for Real-World Data. PODS 2022: 261-276 - [c54]Alin Deutsch, Nadime Francis, Alastair Green, Keith Hare, Bei Li, Leonid Libkin, Tobias Lindaaker, Victor Marsault, Wim Martens, Jan Michels, Filip Murlak, Stefan Plantikow, Petra Selmer, Oskar van Rest, Hannes Voigt, Domagoj Vrgoc, Mingxi Wu, Fred Zemke:
Graph Pattern Matching in GQL and SQL/PGQ. SIGMOD Conference 2022: 2246-2258 - [i20]Wim Martens, Matthias Niewerth, Tina Popp, Stijn Vansummeren, Domagoj Vrgoc:
Representing Paths in Graph Database Pattern Matching. CoRR abs/2207.13541 (2022) - [i19]Nadime Francis, Amélie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, Domagoj Vrgoc:
GPC: A Pattern Calculus for Property Graphs. CoRR abs/2210.16580 (2022) - [i18]Renzo Angles, Angela Bonifati, Stefania Dumbrava, George Fletcher, Alastair Green, Jan Hidders, Bei Li, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Stefan Plantikow, Ognjen Savkovic, Michael Schmidt, Juan Sequeda, Slawek Staworko, Dominik Tomaszuk, Hannes Voigt, Domagoj Vrgoc, Mingxi Wu, Dusan Zivkovic:
PG-Schema: Schemas for Property Graphs. CoRR abs/2211.10962 (2022) - 2021
- [j42]Sherif Sakr, Angela Bonifati, Hannes Voigt, Alexandru Iosup, Khaled Ammar, Renzo Angles, Walid G. Aref, Marcelo Arenas, Maciej Besta, Peter A. Boncz, Khuzaima Daudjee, Emanuele Della Valle, Stefania Dumbrava, Olaf Hartig, Bernhard Haslhofer, Tim Hegeman, Jan Hidders, Katja Hose, Adriana Iamnitchi, Vasiliki Kalavri, Hugo Kapp, Wim Martens, M. Tamer Özsu, Eric Peukert, Stefan Plantikow, Mohamed Ragab, Matei Ripeanu, Semih Salihoglu, Christian Schulz, Petra Selmer, Juan F. Sequeda, Joshua Shinavier, Gábor Szárnyas, Riccardo Tommasini, Antonino Tumeo, Alexandru Uta, Ana Lucia Varbanescu, Hsiang-Yun Wu, Nikolay Yakovets, Da Yan, Eiko Yoneki:
The future is big graphs: a community view on graph processing systems. Commun. ACM 64(9): 62-71 (2021) - [j41]Johannes Doleschal, Benny Kimelfeld, Wim Martens:
Database Principles and Challenges in Text Analysis. SIGMOD Rec. 50(2): 6-17 (2021) - [c53]Johannes Doleschal, Noa Bratman, Benny Kimelfeld, Wim Martens:
The Complexity of Aggregates over Extractions by Regular Expressions. ICDT 2021: 10:1-10:20 - [c52]Renzo Angles, Angela Bonifati, Stefania Dumbrava, George Fletcher, Keith W. Hare, Jan Hidders, Victor E. Lee, Bei Li, Leonid Libkin, Wim Martens, Filip Murlak, Josh Perryman, Ognjen Savkovic, Michael Schmidt, Juan F. Sequeda, Slawek Staworko, Dominik Tomaszuk:
PG-Keys: Keys for Property Graphs. SIGMOD Conference 2021: 2423-2436 - [p1]Henrik Björklund, Johanna Björklund, Wim Martens:
Learning algorithms. Handbook of Automata Theory (I.) 2021: 375-409 - [d1]Angela Bonifati, Stefania Dumbrava, George Fletcher, Jan Hidders, Matthias Hofer, Wim Martens, Filip Murlak, Joshua Shinavier, Slawek Staworko, Dominik Tomaszuk:
Threshold queries in Python. Zenodo, 2021
- [i17]Angela Bonifati, Stefania Dumbrava, George Fletcher, Jan Hidders, Matthias Hofer, Wim Martens, Filip Murlak, Joshua Shinavier, Slawek Staworko, Dominik Tomaszuk:
Threshold Queries in Theory and in the Wild. CoRR abs/2106.15703 (2021) - [i16]Alin Deutsch, Nadime Francis, Alastair Green, Keith Hare, Bei Li, Leonid Libkin, Tobias Lindaaker, Victor Marsault, Wim Martens, Jan Michels, Filip Murlak, Stefan Plantikow, Petra Selmer, Hannes Voigt, Oskar van Rest, Domagoj Vrgoc, Mingxi Wu, Fred Zemke:
Graph Pattern Matching in GQL and SQL/PGQ. CoRR abs/2112.06217 (2021) - 2020
- [j40]Angela Bonifati, Giovanna Guerrini, Carsten Lutz, Wim Martens, Lara Mazilu, Norman W. Paton, Marcos Antonio Vaz Salles, Marc H. Scholl, Yongluan Zhou:
Holding a Conference Online and Live due to Covid-19: Experiences and Lessons Learned from EDBT / ICDT 2020. SIGMOD Rec. 49(4): 28-32 (2020) - [j39]Angela Bonifati, Wim Martens, Thomas Timm:
An analytical study of large SPARQL query logs. VLDB J. 29(2-3): 655-679 (2020) - [c51]Wim Martens:
Formal Languages in Information Extraction and Graph Databases. CiE 2020: 306-309 - [c50]Johannes Doleschal, Benny Kimelfeld, Wim Martens, Liat Peterfreund:
Weight Annotation in Information Extraction. ICDT 2020: 8:1-8:18 - [c49]Diego Figueira, Adwait Godbole, S. Krishna, Wim Martens, Matthias Niewerth, Tina Trautner:
Containment of Simple Conjunctive Regular Path Queries. KR 2020: 371-380 - [c48]Angela Bonifati, Wim Martens, Thomas Timm:
SHARQL: Shape Analysis of Recursive SPARQL Queries. SIGMOD Conference 2020: 2701-2704 - [c47]Wim Martens, Matthias Niewerth, Tina Trautner:
A Trichotomy for Regular Trail Queries. STACS 2020: 7:1-7:16 - [i15]Johannes Doleschal, Noa Bratman, Benny Kimelfeld, Wim Martens:
The Complexity of Aggregates over Extractions by Regular Expressions. CoRR abs/2002.08828 (2020) - [i14]Diego Figueira, Adwait Godbole, S. Krishna, Wim Martens, Matthias Niewerth, Tina Trautner:
Containment of Simple Regular Path Queries. CoRR abs/2003.04411 (2020) - [i13]Angela Bonifati, Giovanna Guerrini, Carsten Lutz, Wim Martens, Lara Mazilu, Norman W. Paton, Marcos Antonio Vaz Salles, Marc H. Scholl, Yongluan Zhou:
Holding a Conference Online and Live due to COVID-19. CoRR abs/2004.07668 (2020) - [i12]Sherif Sakr, Angela Bonifati, Hannes Voigt, Alexandru Iosup, Khaled Ammar, Renzo Angles, Walid G. Aref, Marcelo Arenas, Maciej Besta, Peter A. Boncz, Khuzaima Daudjee, Emanuele Della Valle, Stefania Dumbrava, Olaf Hartig, Bernhard Haslhofer, Tim Hegeman, Jan Hidders, Katja Hose, Adriana Iamnitchi, Vasiliki Kalavri, Hugo Kapp, Wim Martens, M. Tamer Özsu, Eric Peukert, Stefan Plantikow, Mohamed Ragab, Matei Ripeanu, Semih Salihoglu, Christian Schulz, Petra Selmer, Juan F. Sequeda, Joshua Shinavier, Gábor Szárnyas, Riccardo Tommasini, Antonino Tumeo, Alexandru Uta, Ana Lucia Varbanescu, Hsiang-Yun Wu, Nikolay Yakovets, Da Yan, Eiko Yoneki:
The Future is Big Graphs! A Community View on Graph Processing Systems. CoRR abs/2012.06171 (2020)
2010 – 2019
- 2019
- [j38]Wim Martens, Tina Trautner:
Bridging Theory and Practice with Query Log Analysis. SIGMOD Rec. 48(1): 6-13 (2019) - [j37]Benny Kimelfeld, Wim Martens:
Technical Perspective: Entity Matching with Quality and Error Guarantees. SIGMOD Rec. 48(1): 23 (2019) - [j36]Wim Martens:
Technical Perspective: Efficient Query Processing for Dynamically Changing Datasets. SIGMOD Rec. 48(1): 32 (2019) - [j35]Kaustubh Beedkar, Rainer Gemulla, Wim Martens:
A Unified Framework for Frequent Sequence Mining with Subsequence Constraints. ACM Trans. Database Syst. 44(3): 11:1-11:42 (2019) - [j34]Wim Martens, Tina Trautner:
Dichotomies for Evaluating Simple Regular Path Queries. ACM Trans. Database Syst. 44(4): 16:1-16:46 (2019) - [c46]Lukas Sauer, Dominik Henrich, Wim Martens:
Towards Intuitive Robot Programming Using Finite State Automata. KI 2019: 290-298 - [c45]Johannes Doleschal, Benny Kimelfeld, Wim Martens, Yoav Nahshon, Frank Neven:
Split-Correctness in Information Extraction. PODS 2019: 149-163 - [c44]Angela Bonifati, Wim Martens, Thomas Timm:
Navigating the Maze of Wikidata Query Logs. WWW 2019: 127-138 - [i11]Wim Martens, Matthias Niewerth, Tina Trautner:
A Trichotomy for Regular Trail Queries. CoRR abs/1903.00226 (2019) - [i10]Johannes Doleschal, Benny Kimelfeld, Wim Martens, Liat Peterfreund:
Annotated Document Spanners. CoRR abs/1908.11642 (2019) - 2018
- [j33]Henrik Björklund, Wim Martens, Thomas Schwentick:
Conjunctive query containment over trees using schema information. Acta Informatica 55(1): 17-56 (2018) - [j32]Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi:
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). Dagstuhl Manifestos 7(1): 1-29 (2018) - [j31]Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys:
Minimization of Tree Patterns. J. ACM 65(4): 26:1-26:46 (2018) - [j30]Wim Martens:
Foreword: Special Issue on Database Theory. Theory Comput. Syst. 62(4): 771 (2018) - [c43]Johannes Doleschal, Wim Martens, Frank Neven, Adam Witkowski:
Satisfiability for SCULPT-Schemas for CSV-Like Data. ICDT 2018: 14:1-14:19 - [c42]Wim Martens, Tina Trautner:
Evaluation and Enumeration Problems for Regular Path Queries. ICDT 2018: 19:1-19:21 - [c41]Maurizio Lenzerini, Wim Martens, Nicole Schweikardt:
2018 ACM PODS Alberto O. Mendelzon Test-of-Time Award. PODS 2018: 105 - [c40]Johannes Doleschal, Nico Höllerich, Wim Martens, Frank Neven:
Chisel: Sculpting Tabular and Non-Tabular Data on the Web. WWW (Companion Volume) 2018: 139-142 - [c39]Angela Bonifati, Wim Martens, Thomas Timm:
DARQL: Deep Analysis of SPARQL Queries. WWW (Companion Volume) 2018: 187-190 - [i9]Johannes Doleschal, Benny Kimelfeld, Wim Martens, Yoav Nahshon, Frank Neven:
Split-Correctness in Information Extraction. CoRR abs/1810.03367 (2018) - 2017
- [j29]Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, Georg Zetzsche:
A Characterization for Decidable Separability by Piecewise Testable Languages. Discret. Math. Theor. Comput. Sci. 19(4) (2017) - [j28]Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens:
Deciding definability by deterministic regular expressions. J. Comput. Syst. Sci. 88: 75-89 (2017) - [j27]Angela Bonifati, Wim Martens, Thomas Timm:
An Analytical Study of Large SPARQL Query Logs. Proc. VLDB Endow. 11(2): 149-161 (2017) - [j26]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) - [j25]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) - [c38]Wim Martens:
Optimizing tree pattern queries: why cutting is not enough (invited talk). STOC 2017: 3 - [i8]Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi:
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). CoRR abs/1701.09007 (2017) - [i7]Angela Bonifati, Wim Martens, Thomas Timm:
An Analytical Study of Large SPARQL Query Logs. CoRR abs/1708.00363 (2017) - [i6]Wim Martens, Tina Trautner:
Enumeration Problems for Regular Path Queries. CoRR abs/1710.02317 (2017) - 2016
- [j24]Leonid Libkin, Wim Martens, Domagoj Vrgoc:
Querying Graphs with Data. J. ACM 63(2): 14:1-14:53 (2016) - [j23]Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi:
Research Directions for Principles of Data Management (Abridged). SIGMOD Rec. 45(4): 5-17 (2016) - [j22]Katja Losemann, Wim Martens, Matthias Niewerth:
Closure properties and descriptional complexity of deterministic regular expressions. Theor. Comput. Sci. 627: 54-70 (2016) - [c37]Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys:
Minimization of Tree Pattern Queries. PODS 2016: 43-54 - [e1]Wim Martens, Thomas Zeume:
19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016. LIPIcs 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-002-6 [contents] - [i5]Marcelo Arenas, Richard Hull, Wim Martens, Tova Milo, Thomas Schwentick:
Foundations of Data Management (Dagstuhl Perspectives Workshop 16151). Dagstuhl Reports 6(4): 39-56 (2016) - 2015
- [j21]Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven:
Deciding Twig-definability of Node Selecting Tree Automata. Theory Comput. Syst. 57(4): 967-1007 (2015) - [c36]Henrik Björklund, Wim Martens, Thomas Timm:
Efficient Incremental Evaluation of Succinct Regular Expressions. CIKM 2015: 1541-1550 - [c35]Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun:
A Note on Decidable Separability by Piecewise Testable Languages. FCT 2015: 173-185 - [c34]Piotr Hofman, Wim Martens:
Separability by Short Subsequences and Subwords. ICDT 2015: 230-246 - [c33]Wojciech Czerwinski, Wim Martens, Pawel Parys, Marcin Przybylko:
The (Almost) Complete Guide to Tree Pattern Containment. PODS 2015: 117-130 - [c32]Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick:
BonXai: Combining the simplicity of DTD with the expressiveness of XML Schema. PODS 2015: 145-156 - [c31]Wim Martens, Frank Neven, Stijn Vansummeren:
SCULPT: A Schema Language for Tabular Data on the Web. WWW 2015: 702-720 - 2014
- [j20]Wim Martens:
Theory for processing data on the Web. it Inf. Technol. 56(6): 310-312 (2014) - [c30]Katja Losemann, Wim Martens:
MSO queries on trees: enumerating answers under updates. CSL-LICS 2014: 67:1-67:10 - [c29]Michael Benedikt, Ronald Fagin, Wim Martens:
The ICDT 2014 Test of Time Award. ICDT 2014: 257 - [i4]Wojciech Czerwinski, Wim Martens:
A Note on Decidable Separability by Piecewise Testable Languages. CoRR abs/1410.1042 (2014) - [i3]Wim Martens, Frank Neven, Stijn Vansummeren:
SCULPT: A Schema Language for Tabular Data on the Web. CoRR abs/1411.2351 (2014) - 2013
- [j19]Wouter Gelade, Tomasz Idziaszek, Wim Martens, Frank Neven, Jan Paredaens:
Simplifying XML Schema: Single-type approximations of regular tree languages. J. Comput. Syst. Sci. 79(6): 910-936 (2013) - [j18]Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven:
Generating, Sampling and Counting Subclasses of Regular Tree Languages. Theory Comput. Syst. 52(3): 542-585 (2013) - [j17]Katja Losemann, Wim Martens:
The complexity of regular expressions and property paths in SPARQL. ACM Trans. Database Syst. 38(4): 24 (2013) - [c28]Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens:
Deciding Definability by Deterministic Regular Expressions. FoSSaCS 2013: 289-304 - [c27]Wojciech Czerwinski, Wim Martens, Tomás Masopust:
Efficient Separability of Regular Languages by Subsequences and Suffixes. ICALP (2) 2013: 150-161 - [c26]Leonid Libkin, Wim Martens, Domagoj Vrgoc:
Querying graph databases with XPath. ICDT 2013: 129-140 - [c25]Claire David, Amélie Gheerbrant, Leonid Libkin, Wim Martens:
Containment of pattern-based queries over data trees. ICDT 2013: 201-212 - [c24]Henrik Björklund, Wim Martens, Thomas Schwentick:
Validity of Tree Pattern Queries with Respect to Schema Information. MFCS 2013: 171-182 - [c23]Wim Martens:
Counting in SPARQL Property Paths: Perspectives from Theory and Practice. WoLLIC 2013: 29-30 - [i2]Wojciech Czerwinski, Wim Martens, Tomás Masopust:
Efficient Separability of Regular Languages by Subsequences and Suffixes. CoRR abs/1303.0966 (2013) - 2012
- [j16]Henrik Björklund, Wim Martens:
The tractability frontier for NFA minimization. J. Comput. Syst. Sci. 78(1): 198-210 (2012) - [j15]Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick:
Developing and Analyzing XSDs through BonXai. Proc. VLDB Endow. 5(12): 1994-1997 (2012) - [j14]Wouter Gelade, Marc Gyssens, Wim Martens:
Regular Expressions with Counting: Weak versus Strong Determinism. SIAM J. Comput. 41(1): 160-190 (2012) - [c22]Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven:
Deciding twig-definability of node selecting tree automata. ICDT 2012: 61-73 - [c21]Katja Losemann, Wim Martens, Matthias Niewerth:
Descriptional Complexity of Deterministic Regular Expressions. MFCS 2012: 643-654 - [c20]Katja Losemann, Wim Martens:
The complexity of evaluating path expressions in SPARQL. PODS 2012: 101-112 - 2011
- [j13]Henrik Björklund, Wim Martens, Thomas Schwentick:
Conjunctive query containment over trees. J. Comput. Syst. Sci. 77(3): 450-472 (2011) - [j12]Tom J. Ameloot, Maarten Marx, Wim Martens, Frank Neven, Justin van Wees:
30 Years of PODS in facts and figures. SIGMOD Rec. 40(3): 54-60 (2011) - [c19]Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven:
Generating, sampling and counting subclasses of regular tree languages. ICDT 2011: 30-41 - [c18]Timos Antonopoulos, Wim Martens, Frank Neven:
The complexity of text-preserving XML transformations. PODS 2011: 247-258 - 2010
- [j11]Henrik Björklund, Wim Martens, Nicole Schweikardt, Thomas Schwentick:
Logik und Automaten: ein echtes Dreamteam. Inform. Spektrum 33(5): 452-461 (2010) - [j10]Henrik Björklund, Wouter Gelade, Wim Martens:
Incremental XPath evaluation. ACM Trans. Database Syst. 35(4): 29:1-29:43 (2010) - [c17]Wim Martens, Matthias Niewerth, Thomas Schwentick:
Schema design for XML repositories: complexity and tractability. PODS 2010: 239-250 - [c16]Wouter Gelade, Tomasz Idziaszek, Wim Martens, Frank Neven:
Simplifying XML schema: single-type approximations of regular tree languages. PODS 2010: 251-260
2000 – 2009
- 2009
- [j9]Michaela Götz, Christoph Koch, Wim Martens:
Efficient algorithms for descendant-only tree pattern queries. Inf. Syst. 34(7): 602-623 (2009) - [j8]Wouter Gelade, Wim Martens, Frank Neven:
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving. SIAM J. Comput. 38(5): 2021-2043 (2009) - [j7]Wim Martens, Frank Neven, Thomas Schwentick:
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions. SIAM J. Comput. 39(4): 1486-1530 (2009) - [c15]Henrik Björklund, Wouter Gelade, Marcel Marquardt, Wim Martens:
Incremental XPath evaluation. ICDT 2009: 162-173 - [c14]Wouter Gelade, Marc Gyssens, Wim Martens:
Regular Expressions with Counting: Weak versus Strong Determinism. MFCS 2009: 369-381 - [c13]Geert Jan Bex, Wouter Gelade, Wim Martens, Frank Neven:
Simplifying XML schema: effortless handling of nondeterministic regular expressions. SIGMOD Conference 2009: 731-744 - 2008
- [j6]Wim Martens, Frank Neven, Marc Gyssens:
Typechecking top-down XML transformations: Fixed input or output schemas. Inf. Comput. 206(7): 806-827 (2008) - [c12]Wim Martens, Frank Neven, Thomas Schwentick:
Deterministic top-down tree automata: past, present, and future. Logic and Automata 2008: 505-530 - [c11]Henrik Björklund, Wim Martens:
The Tractability Frontier for NFA Minimization. ICALP (2) 2008: 27-38 - [c10]Henrik Björklund, Wim Martens, Thomas Schwentick:
Optimizing Conjunctive Queries over Trees Using Schema Information. MFCS 2008: 132-143 - 2007
- [j5]Wim Martens, Frank Neven:
Frontiers of tractability for typechecking simple XML transformations. J. Comput. Syst. Sci. 73(3): 362-390 (2007) - [j4]Wim Martens, Joachim Niehren:
On the minimization of XML Schemas and tree automata for unranked trees. J. Comput. Syst. Sci. 73(4): 550-583 (2007) - [j3]Wim Martens, Frank Neven, Thomas Schwentick:
Simple off the shelf abstractions for XML schema. SIGMOD Rec. 36(3): 15-22 (2007) - [c9]Michaela Götz, Christoph Koch, Wim Martens:
Efficient Algorithms for the Tree Homeomorphism Problem. DBPL 2007: 17-31 - [c8]Henrik Björklund, Wim Martens, Thomas Schwentick:
Conjunctive Query Containment over Trees. DBPL 2007: 66-80 - [c7]Wouter Gelade, Wim Martens, Frank Neven:
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving. ICDT 2007: 269-283 - 2006
- [b1]Wim Martens:
Static analysis of XML transformation and schema languages. Hasselt University, Belgium, 2006 - [j2]Wim Martens, Frank Neven, Thomas Schwentick, Geert Jan Bex:
Expressiveness and complexity of XML Schema. ACM Trans. Database Syst. 31(3): 770-813 (2006) - [i1]Wim Martens, Frank Neven, Marc Gyssens:
On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas. CoRR abs/cs/0606094 (2006) - 2005
- [j1]Wim Martens, Frank Neven:
On the complexity of typechecking top-down XML transformations. Theor. Comput. Sci. 336(1): 153-180 (2005) - [c6]Wim Martens, Joachim Niehren:
Minimizing Tree Automata for Unranked Trees. DBPL 2005: 232-246 - [c5]Wim Martens, Frank Neven, Thomas Schwentick:
Which XML Schemas Admit 1-Pass Preorder Typing? ICDT 2005: 68-82 - [c4]Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick:
Expressiveness of XSDs: from practice to theory, there and back again. WWW 2005: 712-721 - 2004
- [c3]Wim Martens, Frank Neven, Thomas Schwentick:
Complexity of Decision Problems for Simple Regular Expressions. MFCS 2004: 889-900 - [c2]Wim Martens, Frank Neven:
Frontiers of Tractability for Typechecking Simple XML Transformations. PODS 2004: 23-34 - 2003
- [c1]Wim Martens, Frank Neven:
Typechecking Top-Down Uniform Unranked Tree Transducers. ICDT 2003: 64-78
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-10-09 20:32 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:
