Typechecking Top-Down Uniform Unranked Tree Transducers. - Wim Martens; Frank Neven (ICDT, 2003)

Complexity of Decision Problems for Simple Regular Expressions. - Wim Martens; Frank Neven; Thomas Schwentick (MFCS, 2004)

Minimizing Tree Automata for Unranked Trees. - Wim Martens; Joachim Niehren (DBPL, 2005)

Which XML Schemas Admit 1-Pass Preorder Typing? - Wim Martens; Frank Neven; Thomas Schwentick (ICDT, 2005)

Expressiveness of XSDs: from practice to theory, there and back again. - Geert Jan Bex; Wim Martens; Frank Neven; Thomas Schwentick (WWW, 2005)

On the complexity of typechecking top-down XML transformations. - Wim Martens; Frank Neven (Theor. Comput. Sci., 2005)

On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas - Wim Martens; Frank Neven; Marc Gyssens (CoRR, 2006)

Expressiveness and complexity of XML Schema. - Wim Martens; Frank Neven; Thomas Schwentick; Geert Jan Bex (ACM Trans. Database Syst., 2006)

Static analysis of XML transformation and schema languages - Wim Martens (2006)

Efficient Algorithms for the Tree Homeomorphism Problem. - Michaela Götz; Christoph Koch 001; Wim Martens (DBPL, 2007)

Frontiers of tractability for typechecking simple XML transformations. - Wim Martens; Frank Neven (J. Comput. Syst. Sci., 2007)

On the minimization of XML Schemas and tree automata for unranked trees. - Wim Martens; Joachim Niehren (J. Comput. Syst. Sci., 2007)

Simple off the shelf abstractions for XML schema. - Wim Martens; Frank Neven; Thomas Schwentick (SIGMOD Rec., 2007)

Deterministic top-down tree automata: past, present, and future. - Wim Martens; Frank Neven; Thomas Schwentick (Logic and Automata, 2008)

Optimizing Conjunctive Queries over Trees Using Schema Information. - Henrik Björklund; Wim Martens; Thomas Schwentick (MFCS, 2008)

Typechecking top-down XML transformations: Fixed input or output schemas. - Wim Martens; Frank Neven; Marc Gyssens (Inf. Comput., 2008)

Incremental XPath evaluation. - Henrik Björklund; Wouter Gelade; Marcel Marquardt; Wim Martens (ICDT, 2009)

Simplifying XML schema: effortless handling of nondeterministic regular expressions. - Geert Jan Bex; Wouter Gelade; Wim Martens; Frank Neven (SIGMOD Conference, 2009)

Efficient algorithms for descendant-only tree pattern queries. - Michaela Götz; Christoph Koch 001; Wim Martens (Inf. Syst., 2009)

Optimizing Schema Languages for XML: Numerical Constraints and Interleaving. - Wouter Gelade; Wim Martens; Frank Neven (SIAM J. Comput., 2009)

Complexity of Decision Problems for XML Schemas and Chain Regular Expressions. - Wim Martens; Frank Neven; Thomas Schwentick (SIAM J. Comput., 2009)

Simplifying XML schema: single-type approximations of regular tree languages. - Wouter Gelade; Tomasz Idziaszek; Wim Martens; Frank Neven (PODS, 2010)

Schema design for XML repositories: complexity and tractability. - Wim Martens; Matthias Niewerth; Thomas Schwentick (PODS, 2010)

Logik und Automaten: ein echtes Dreamteam. - Henrik Björklund; Wim Martens; Nicole Schweikardt; Thomas Schwentick (Inform. Spektrum, 2010)

Incremental XPath evaluation. - Henrik Björklund; Wouter Gelade; Wim Martens (ACM Trans. Database Syst., 2010)

The complexity of text-preserving XML transformations. - Timos Antonopoulos; Wim Martens; Frank Neven (PODS, 2011)

Conjunctive query containment over trees. - Henrik Björklund; Wim Martens; Thomas Schwentick (J. Comput. Syst. Sci., 2011)

30 Years of PODS in facts and figures. - Tom J. Ameloot; Maarten Marx; Wim Martens; Frank Neven; Justin van Wees (SIGMOD Rec., 2011)

Descriptional Complexity of Deterministic Regular Expressions. - Katja Losemann; Wim Martens; Matthias Niewerth (MFCS, 2012)

The complexity of evaluating path expressions in SPARQL. - Katja Losemann; Wim Martens (PODS, 2012)

The tractability frontier for NFA minimization. - Henrik Björklund; Wim Martens (J. Comput. Syst. Sci., 2012)

Developing and Analyzing XSDs through BonXai. - Wim Martens; Frank Neven; Matthias Niewerth; Thomas Schwentick (Proc. VLDB Endow., 2012)

Regular Expressions with Counting: Weak versus Strong Determinism. - Wouter Gelade; Marc Gyssens; Wim Martens (SIAM J. Comput., 2012)

Efficient Separability of Regular Languages by Subsequences and Suffixes. - Wojciech Czerwinski; Wim Martens; Tomás Masopust (ICALP (2), 2013)

Containment of pattern-based queries over data trees. - Claire David; Amélie Gheerbrant; Leonid Libkin; Wim Martens (ICDT, 2013)

Querying graph databases with XPath. - Leonid Libkin; Wim Martens; Domagoj Vrgoc (ICDT, 2013)

Validity of Tree Pattern Queries with Respect to Schema Information. - Henrik Björklund; Wim Martens; Thomas Schwentick (MFCS, 2013)

Counting in SPARQL Property Paths: Perspectives from Theory and Practice. - Wim Martens (WoLLIC, 2013)

Simplifying XML Schema: Single-type approximations of regular tree languages. - Wouter Gelade; Tomasz Idziaszek; Wim Martens; Frank Neven; Jan Paredaens (J. Comput. Syst. Sci., 2013)

Generating, Sampling and Counting Subclasses of Regular Tree Languages. - Timos Antonopoulos; Floris Geerts; Wim Martens; Frank Neven (Theory Comput. Syst., 2013)

The complexity of regular expressions and property paths in SPARQL. - Katja Losemann; Wim Martens (ACM Trans. Database Syst., 2013)

MSO queries on trees: enumerating answers under updates. - Katja Losemann; Wim Martens (CSL-LICS, 2014)

The ICDT 2014 Test of Time Award. - Michael Benedikt; Ronald Fagin; Wim Martens (ICDT, 2014)

A Note on Decidable Separability by Piecewise Testable Languages. - Wojciech Czerwinski; Wim Martens (CoRR, 2014)

Theory for processing data on the Web. - Wim Martens (it Inf. Technol., 2014)

Efficient Incremental Evaluation of Succinct Regular Expressions. - Henrik Björklund; Wim Martens; Thomas Timm (CIKM, 2015)

A Note on Decidable Separability by Piecewise Testable Languages. - Wojciech Czerwinski; Wim Martens; Lorijn van Rooijen; Marc Zeitoun (FCT, 2015)

Separability by Short Subsequences and Subwords. - Piotr Hofman; Wim Martens (ICDT, 2015)

The (Almost) Complete Guide to Tree Pattern Containment. - Wojciech Czerwinski; Wim Martens; Pawel Parys; Marcin Przybylko (PODS, 2015)

SCULPT: A Schema Language for Tabular Data on the Web. - Wim Martens; Frank Neven; Stijn Vansummeren (WWW, 2015)

Deciding Twig-definability of Node Selecting Tree Automata. - Timos Antonopoulos; Dag Hovland; Wim Martens; Frank Neven (Theory Comput. Syst., 2015)

Minimization of Tree Pattern Queries. - Wojciech Czerwinski; Wim Martens; Matthias Niewerth; Pawel Parys (PODS, 2016)

Foundations of Data Management (Dagstuhl Perspectives Workshop 16151). - Marcelo Arenas; Richard Hull 001; Wim Martens; Tova Milo; Thomas Schwentick (Dagstuhl Reports, 2016)

Querying Graphs with Data. - Leonid Libkin; Wim Martens; Domagoj Vrgoc (J. ACM, 2016)

Research Directions for Principles of Data Management (Abridged). - Serge Abiteboul; Marcelo Arenas; Pablo Barceló; Meghyn Bienvenu; Diego Calvanese; Claire David; Richard Hull 001; Eyke Hüllermeier; Benny Kimelfeld; Leonid Libkin; Wim Martens; Tova Milo; et al. (SIGMOD Rec., 2016)

Closure properties and descriptional complexity of deterministic regular expressions. - Katja Losemann; Wim Martens; Matthias Niewerth (Theor. Comput. Sci., 2016)

Optimizing tree pattern queries: why cutting is not enough (invited talk). - Wim Martens (STOC, 2017)

Enumeration Problems for Regular Path Queries. - Wim Martens; Tina Trautner (CoRR, 2017)

A Characterization for Decidable Separability by Piecewise Testable Languages. - Wojciech Czerwinski; Wim Martens; Lorijn van Rooijen; Marc Zeitoun; Georg Zetzsche (Discret. Math. Theor. Comput. Sci., 2017)

Deciding definability by deterministic regular expressions. - Wojciech Czerwinski; Claire David; Katja Losemann; Wim Martens (J. Comput. Syst. Sci., 2017)

An Analytical Study of Large SPARQL Query Logs. - Angela Bonifati; Wim Martens; Thomas Timm (Proc. VLDB Endow., 2017)

Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data. - Wojciech Czerwinski; Wim Martens; Matthias Niewerth; Pawel Parys (SIGMOD Rec., 2017)

BonXai: Combining the Simplicity of DTD with the Expressiveness of XML Schema. - Wim Martens; Frank Neven; Matthias Niewerth; Thomas Schwentick (ACM Trans. Database Syst., 2017)

Satisfiability for SCULPT-Schemas for CSV-Like Data. - Johannes Doleschal; Wim Martens; Frank Neven; Adam Witkowski (ICDT, 2018)

Evaluation and Enumeration Problems for Regular Path Queries. - Wim Martens; Tina Trautner (ICDT, 2018)

2018 ACM PODS Alberto O. Mendelzon Test-of-Time Award. - Maurizio Lenzerini; Wim Martens; Nicole Schweikardt (PODS, 2018)

DARQL: Deep Analysis of SPARQL Queries. - Angela Bonifati; Wim Martens; Thomas Timm (WWW (Companion Volume), 2018)

Chisel: Sculpting Tabular and Non-Tabular Data on the Web. - Johannes Doleschal; Nico Höllerich; Wim Martens; Frank Neven (WWW (Companion Volume), 2018)

Conjunctive query containment over trees using schema information. - Henrik Björklund; Wim Martens; Thomas Schwentick (Acta Informatica, 2018)

Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). - Serge Abiteboul; Marcelo Arenas; Pablo Barceló; Meghyn Bienvenu; Diego Calvanese; Claire David; Richard Hull 001; Eyke Hüllermeier; Benny Kimelfeld; Leonid Libkin; Wim Martens; Tova Milo; et al. (Dagstuhl Manifestos, 2018)

Minimization of Tree Patterns. - Wojciech Czerwinski; Wim Martens; Matthias Niewerth; Pawel Parys (J. ACM, 2018)

Foreword: Special Issue on Database Theory. - Wim Martens (Theory Comput. Syst., 2018)

Towards Intuitive Robot Programming Using Finite State Automata. - Lukas Sauer; Dominik Henrich; Wim Martens (KI, 2019)

Split-Correctness in Information Extraction. - Johannes Doleschal; Benny Kimelfeld; Wim Martens; Yoav Nahshon; Frank Neven (PODS, 2019)

Navigating the Maze of Wikidata Query Logs. - Angela Bonifati; Wim Martens; Thomas Timm (WWW, 2019)

Annotated Document Spanners. - Johannes Doleschal; Benny Kimelfeld; Wim Martens; Liat Peterfreund (CoRR, 2019)

Technical Perspective: Entity Matching with Quality and Error Guarantees. - Benny Kimelfeld; Wim Martens (SIGMOD Rec., 2019)

Technical Perspective: Efficient Query Processing for Dynamically Changing Datasets. - Wim Martens (SIGMOD Rec., 2019)

Bridging Theory and Practice with Query Log Analysis. - Wim Martens; Tina Trautner (SIGMOD Rec., 2019)

A Unified Framework for Frequent Sequence Mining with Subsequence Constraints. - Kaustubh Beedkar; Rainer Gemulla; Wim Martens (ACM Trans. Database Syst., 2019)

Dichotomies for Evaluating Simple Regular Path Queries. - Wim Martens; Tina Trautner (ACM Trans. Database Syst., 2019)

Formal Languages in Information Extraction and Graph Databases. - Wim Martens (CiE, 2020)

Containment of Simple Conjunctive Regular Path Queries. - Diego Figueira; Adwait Godbole; S. Krishna 004; Wim Martens; Matthias Niewerth; Tina Trautner (KR, 2020)

SHARQL: Shape Analysis of Recursive SPARQL Queries. - Angela Bonifati; Wim Martens; Thomas Timm (SIGMOD Conference, 2020)

Containment of Simple Regular Path Queries. - Diego Figueira; Adwait Godbole; S. Krishna 004; Wim Martens; Matthias Niewerth; Tina Trautner (CoRR, 2020)

Holding a Conference Online and Live due to COVID-19. - Angela Bonifati; Giovanna Guerrini; Carsten Lutz; Wim Martens; Lara Mazilu; Norman W. Paton; Marcos Antonio Vaz Salles; Marc H. Scholl; Yongluan Zhou (CoRR, 2020)

Holding a Conference Online and Live due to Covid-19: Experiences and Lessons Learned from EDBT / ICDT 2020. - Angela Bonifati; Giovanna Guerrini; Carsten Lutz; Wim Martens; Lara Mazilu; Norman W. Paton; Marcos Antonio Vaz Salles; Marc H. Scholl; Yongluan Zhou (SIGMOD Rec., 2020)

Learning algorithms. - Henrik Björklund; Johanna Björklund; Wim Martens (Handbook of Automata Theory (I.), 2021)

The Complexity of Aggregates over Extractions by Regular Expressions. - Johannes Doleschal; Noa Bratman; Benny Kimelfeld; Wim Martens (ICDT, 2021)

PG-Keys: Keys for Property Graphs. - Renzo Angles; Angela Bonifati; Stefania Dumbrava; George Fletcher 001; Keith W. Hare; Jan Hidders; Victor E. Lee; Bei Li; Leonid Libkin; Wim Martens; Filip Murlak; Josh Perryman; et al. (SIGMOD Conference, 2021)

The future is big graphs: a community view on graph processing systems. - 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; et al. (Commun. ACM, 2021)

Database Principles and Challenges in Text Analysis. - Johannes Doleschal; Benny Kimelfeld; Wim Martens (SIGMOD Rec., 2021)

Threshold queries in Python. - Angela Bonifati; Stefania Dumbrava; George Fletcher 001; Jan Hidders; Matthias Hofer 005; Wim Martens; Filip Murlak; Joshua Shinavier; Slawek Staworko; Dominik Tomaszuk (Zenodo, 2021)

Optimal Algorithms for Multiway Search on Partial Orders. - Shangqi Lu; Wim Martens; Matthias Niewerth; Yufei Tao 001 (PODS, 2022)

Towards Theory for Real-World Data. - Wim Martens (PODS, 2022)

The Complexity of Regular Trail and Simple Path Queries on Undirected Graphs. - Wim Martens; Tina Popp (PODS, 2022)

Graph Pattern Matching in GQL and SQL/PGQ. - Alin Deutsch; Nadime Francis; Alastair Green; Keith Hare; Bei Li; Leonid Libkin; Tobias Lindaaker; Victor Marsault; Wim Martens; Jan Michels; Filip Murlak; Stefan Plantikow; et al. (SIGMOD Conference, 2022)

Representing Paths in Graph Database Pattern Matching. - Wim Martens; Matthias Niewerth; Tina Popp; Stijn Vansummeren; Domagoj Vrgoc (CoRR, 2022)

Weight Annotation in Information Extraction. - Johannes Doleschal; Benny Kimelfeld; Wim Martens; Liat Peterfreund (Log. Methods Comput. Sci., 2022)

Threshold Queries in Theory and in the Wild. - Angela Bonifati; Stefania Dumbrava; George Fletcher 001; Jan Hidders; Matthias Hofer 005; Wim Martens; Filip Murlak; Joshua Shinavier; Slawek Staworko; Dominik Tomaszuk (Proc. VLDB Endow., 2022)

A Researcher's Digest of GQL (Invited Talk). - Nadime Francis; Amélie Gheerbrant; Paolo Guagliardo; Leonid Libkin; Victor Marsault; Wim Martens; Filip Murlak; Liat Peterfreund; Alexandra Rogova; Domagoj Vrgoc (ICDT, 2023)

GPC: A Pattern Calculus for Property Graphs. - Nadime Francis; Amélie Gheerbrant; Paolo Guagliardo; Leonid Libkin; Victor Marsault; Wim Martens; Filip Murlak; Liat Peterfreund; Alexandra Rogova; Domagoj Vrgoc (PODS, 2023)

A Unifying Perspective on Succinct Data Representations. - Benny Kimelfeld; Wim Martens; Matthias Niewerth (CoRR, 2023)

The Complexity of Aggregates over Extractions by Regular Expressions. - Johannes Doleschal; Benny Kimelfeld; Wim Martens (Log. Methods Comput. Sci., 2023)

A Trichotomy for Regular Trail Queries. - Wim Martens; Matthias Niewerth; Tina Popp (Log. Methods Comput. Sci., 2023)

PG-Schema: Schemas for Property Graphs. - Renzo Angles; Angela Bonifati; Stefania Dumbrava; George Fletcher 001; Alastair Green; Jan Hidders; Bei Li; Leonid Libkin; Victor Marsault; Wim Martens; Filip Murlak; Stefan Plantikow; et al. (Proc. ACM Manag. Data, 2023)

Representing Paths in Graph Database Pattern Matching. - Wim Martens; Matthias Niewerth; Tina Popp; Carlos Rojas; Stijn Vansummeren; Domagoj Vrgoc (Proc. VLDB Endow., 2023)

Threshold Queries. - Angela Bonifati; Stefania Dumbrava; George Fletcher 001; Jan Hidders; Matthias Hofer 005; Wim Martens; Filip Murlak; Joshua Shinavier; Slawek Staworko; Dominik Tomaszuk (SIGMOD Rec., 2023)

An Optimal Algorithm for Partial Order Multiway Search. - Shangqi Lu; Wim Martens; Matthias Niewerth; Yufei Tao 001 (SIGMOD Rec., 2023)

Partial Order Multiway Search. - Shangqi Lu; Wim Martens; Matthias Niewerth; Yufei Tao 001 (ACM Trans. Database Syst., 2023)

Compact Path Representations for Graph Database Pattern Matching. - Wim Martens; Matthias Niewerth; Tina Popp; Carlos Rojas; Stijn Vansummeren; Domagoj Vrgoc (ICDEW, 2024)

PACMMOD Volume 2 Issue 2: Editorial. - Floris Geerts; Wim Martens; Matthias Niewerth (Proc. ACM Manag. Data, 2024)