[2009] Olivier Gauwin and Joachim Niehren and Sophie Tison, Bounded Delay and Concurrency for Earliest Query Answering, 3rd International Conference on Language
and Automata Theory and Applications, Lecture Notes in Computer Science 5457, 350-361
[2007] Emmanuel Filiot and Joachim Niehren and Jean-Marc Talbot and Sophie Tison, Polynomial Time Fragments of XPath with Variables, 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 205-214
[2005] Wim Martens and Joachim Niehren, Minimizing Tree Automata for Unranked Trees, 10th International Symposium on Database Programming Languages, Lecture Notes in Computer Science 3774, 232--246
[2005] Joachim Niehren and Laurent Planque and Jean-Marc Talbot and Sophie Tison, N-ary Queries by Tree Automata, 10th International Symposium on Database Programming Languages, Lecture Notes in Computer Science 3774, 217--231
[2004] Julien Carme and Joachim Niehren and Marc Tommasi, Querying Unranked Trees with Stepwise Tree Automata, 19th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 3091, 105--118
[2006] Emmanuel Filiot and Joachim Niehren and Jean-Marc Talbot and Sophie Tison, Composing Monadic Queries in Trees, PLAN-X International Workshop, 61--70