Discrete Mathematics and Theoretical Computer Science

Volume 5:1 (2002), all 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	The Stack-Size of Combinatorial Tries Revisited Markus E. Nebel
017-046	Lyndon factorization of generalized words of Thue Anton Černý
047-054	3x+1 Minus the + Kenneth G. Monks
055-070	Graph Decompositions and Factorizing Permutations Christian Capelle and Michel Habib and Fabien de Montgolfier
071-096	Probabilistic Analysis of Carlitz Compositions Guy Louchard and Helmut Prodinger
097-108	The height of q-Binary Search Trees Michael Drmota and Helmut Prodinger
109-120	Synthesis Of Space-Time Optimal Systolic Algorithms For The Cholesky Factorization Clémentin Tayou Djamegni
121-126	Multicolored isomorphic spanning trees in complete graphs Gregory Constantine
127-146	Recognizing the P₄-structure of claw-free graphs and a larger graph class Luitpold Babel and Andreas Brandstädt and Van Bang Le
147-168	Partially Complemented Representations of Digraphs Elias Dahlhaus and Jens Gustedt and Ross M. McConnell
169-180	The Cycles of the Multiway Perfect Shuffle Permutation John Ellis and Hongbing Fan and Jeffrey Shallit
181-190	On a Unimodality Conjecture in Matroid Theory W.M.B. Dukes
191-204	Performance analysis of demodulation with diversity -- A combinatorial approach I: Symmetric function theoretical methods J.L. Dornstetter and D. Krob and J.Y. Thibon and E.A. Vassilieva
205-226	Upper bounds on the non-3-colourability threshold of random graphs Nikolaos Fountoulakis and Colin McDiarmid
227-262	A Unified Framework to Compute over Tree Synchronized Grammars and Primal Grammars Frédéric Saubion and Igor Stéphan