Parameterized complexity theory J Flum, M Grohe Springer Science & Business Media, 2006 | 2575 | 2006 |

Finite state machines for strings over infinite alphabets F Neven, T Schwentick, V Vianu ACM Transactions on Computational Logic (TOCL) 5 (3), 403-435, 2004 | 297 | 2004 |

Two-variable logic on data trees and XML reasoning M Bojańczyk, A Muscholl, T Schwentick, L Segoufin Journal of the ACM (JACM) 56 (3), 1-48, 2009 | 245 | 2009 |

XPath containment in the presence of disjunction, DTDs, and variables F Neven, T Schwentick International Conference on Database Theory, 315-329, 2003 | 239 | 2003 |

Two-variable logic on words with data M Bojanczyk, A Muscholl, T Schwentick, L Segoufin, C David 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 7-16, 2006 | 230 | 2006 |

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 | 204 | 2006 |

Two-variable logic on data words M Bojańczyk, C David, A Muscholl, T Schwentick, L Segoufin ACM Transactions on Computational Logic (TOCL) 12 (4), 1-26, 2011 | 181 | 2011 |

Automata for XML—a survey T Schwentick Journal of Computer and System Sciences 73 (3), 289-315, 2007 | 167 | 2007 |

Inference of concise DTDs from XML data GJ Bex, F Neven, T Schwentick, K Tuyls Proceedings of the 32nd international conference on Very large data bases …, 2006 | 159 | 2006 |

Query automata over finite trees F Neven, T Schwentick Theoretical Computer Science 275 (1-2), 633-674, 2002 | 158 | 2002 |

XPath query containment T Schwentick ACM SIGMOD Record 33 (1), 101-109, 2004 | 152 | 2004 |

When is the evaluation of conjunctive queries tractable? M Grohe, T Schwentick, L Segoufin Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001 | 149 | 2001 |

Expressive and efficient pattern languages for tree-structured data F Neven, T Schwentick Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on …, 2000 | 142 | 2000 |

On the power of polynomial time bit-reductions U Hertrampf, C Lautemann, T Schwentick, H Vollmer, KW Wagner [1993] Proceedings of the Eigth Annual Structure in Complexity Theory …, 1993 | 131 | 1993 |

Generalized hypertree decompositions: NP-hardness and tractable variants G Gottlob, Z Miklós, T Schwentick Journal of the ACM (JACM) 56 (6), 1-32, 2009 | 115 | 2009 |

On the complexity of equational horn clauses KN Verma, H Seidl, T Schwentick International Conference on Automated Deduction, 337-352, 2005 | 113 | 2005 |

Inference of concise regular expressions and DTDs GJ Bex, F Neven, T Schwentick, S Vansummeren ACM Transactions on Database Systems (TODS) 35 (2), 1-47, 2010 | 112 | 2010 |

Counting in trees for free H Seidl, T Schwentick, A Muscholl, P Habermehl International Colloquium on Automata, Languages, and Programming, 1136-1149, 2004 | 111 | 2004 |

On notions of regularity for data languages H Björklund, T Schwentick Theoretical Computer Science 411 (4-5), 702-715, 2010 | 109 | 2010 |

On the complexity of XPath containment in the presence of disjunction, DTDs, and variables F Neven, T Schwentick arXiv preprint cs/0606065, 2006 | 104 | 2006 |