1. E. Althaus, D. Duchier, A. Koller, K. Mehlhorn, J. Niehren, S. Thiel, An efficient algorithm for the configuration problem of dominance graphs, in: Proc. of the 12th ACM-SIAM Symp. on Discrete Algorithms, 7–9, January 2001, Washington, DC, Algorithmica.
2. A first-order axiomatization of the theory of finite trees;Backofen;J. Logic, Language, Inform.,1995
3. P. Blackburn, C. Gardent, W. Meyer-Viol, Talking about trees, in: Proc. of the European Chapter of the Association of Computational Linguistics (EACL), Utrecht, 1993.
4. T. Cornell, On determining the consistency of partial descriptions of trees, in: Proc. of the 32nd Annual Meeting of the Association for Computational Linguistics, ACL, 1994.
5. M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, F. Berthier, The constraint logic programming language CHIP, in: Proc. of the International Conference on Fifth Generation Computer Systems (FGCS-88), Tokyo, Japan, December, 1988.