Discrete Mathematics & Theoretical Computer Science

Volume 1:1 (1997), regular papers

If you select a title you will receive more information about the paper and the option to download the paper in PostScript or in Acrobat PDF form:

Contents
001-016	Computing nilpotent quotients in finitely presented Lie rings: Csaba Schneider
017-041	On P4-tidy graphs: V Giakoumakis, F Roussel, H Thuillier
043-052	Lyndon factorization of the Thue-Morse word and its relatives: Augustin Ido, Guy Melançon
053-067	A direct bijective proof of the hook-length formula: Jean-Christophe Novelli, Igor Pak, Alexander V. Stoyanovskii
069-098	E-unification by means of tree tuple synchronized grammars: Sébastien Limet, Pierre Réty
099-246	Special issue: ‘Lie Computations’: Click for a full listing of Special Issue papers
247-266	Descendants and ascendants in binary trees Alois Panholzer and Helmut Prodinger