| 2009 |
24 | | Henrik Björklund,
Wouter Gelade,
Marcel Marquardt,
Wim Martens:
Incremental XPath evaluation.
ICDT 2009: 162-173 |
23 | | Wouter Gelade,
Marc Gyssens,
Wim Martens:
Regular Expressions with Counting: Weak versus Strong Determinism.
MFCS 2009: 369-381 |
22 | | Geert Jan Bex,
Wouter Gelade,
Wim Martens,
Frank Neven:
Simplifying XML schema: effortless handling of nondeterministic regular expressions.
SIGMOD Conference 2009: 731-744 |
21 | | Michaela Götz,
Christoph Koch,
Wim Martens:
Efficient algorithms for descendant-only tree pattern queries.
Inf. Syst. 34(7): 602-623 (2009) |
20 | | Wouter Gelade,
Wim Martens,
Frank Neven:
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving.
SIAM J. Comput. 38(5): 2021-2043 (2009) |
19 | | 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) |
| 2008 |
18 | | Henrik Björklund,
Wim Martens:
The Tractability Frontier for NFA Minimization.
ICALP (2) 2008: 27-38 |
17 | | Henrik Björklund,
Wim Martens,
Thomas Schwentick:
Optimizing Conjunctive Queries over Trees Using Schema Information.
MFCS 2008: 132-143 |
16 | | Wim Martens,
Frank Neven,
Marc Gyssens:
Typechecking top-down XML transformations: Fixed input or output schemas.
Inf. Comput. 206(7): 806-827 (2008) |
| 2007 |
15 | | Michaela Götz,
Christoph Koch,
Wim Martens:
Efficient Algorithms for the Tree Homeomorphism Problem.
DBPL 2007: 17-31 |
14 | | Henrik Björklund,
Wim Martens,
Thomas Schwentick:
Conjunctive Query Containment over Trees.
DBPL 2007: 66-80 |
13 | | Wouter Gelade,
Wim Martens,
Frank Neven:
Optimizing Schema Languages for XML: Numerical Constraints and Interleaving.
ICDT 2007: 269-283 |
12 | | Wim Martens,
Frank Neven:
Frontiers of tractability for typechecking simple XML transformations.
J. Comput. Syst. Sci. 73(3): 362-390 (2007) |
11 | | 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) |
10 | | Wim Martens,
Frank Neven,
Thomas Schwentick:
Simple off the shelf abstractions for XML schema.
SIGMOD Record 36(3): 15-22 (2007) |
| 2006 |
9 | | Wim Martens,
Frank Neven,
Thomas Schwentick,
Geert Jan Bex:
Expressiveness and complexity of XML Schema.
ACM Trans. Database Syst. 31(3): 770-813 (2006) |
8 | | Wim Martens,
Frank Neven,
Marc Gyssens:
On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas
CoRR abs/cs/0606094: (2006) |
| 2005 |
7 | | Wim Martens,
Joachim Niehren:
Minimizing Tree Automata for Unranked Trees.
DBPL 2005: 232-246 |
6 | | Wim Martens,
Frank Neven,
Thomas Schwentick:
Which XML Schemas Admit 1-Pass Preorder Typing?
ICDT 2005: 68-82 |
5 | | Geert Jan Bex,
Wim Martens,
Frank Neven,
Thomas Schwentick:
Expressiveness of XSDs: from practice to theory, there and back again.
WWW 2005: 712-721 |
4 | | Wim Martens,
Frank Neven:
On the complexity of typechecking top-down XML transformations.
Theor. Comput. Sci. 336(1): 153-180 (2005) |
| 2004 |
3 | | Wim Martens,
Frank Neven,
Thomas Schwentick:
Complexity of Decision Problems for Simple Regular Expressions.
MFCS 2004: 889-900 |
2 | | Wim Martens,
Frank Neven:
Frontiers of Tractability for Typechecking Simple XML Transformations.
PODS 2004: 23-34 |
| 2003 |
1 | | Wim Martens,
Frank Neven:
Typechecking Top-Down Uniform Unranked Tree Transducers.
ICDT 2003: 64-78 |