Discrete Mathematics and Theoretical Computer Science

DMTCS

Volume 6, 6:1 (2003) and 6:2 (2004), 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-012	Counting occurrences of some subword patterns Alexander Burstein and Toufik Mansour
012-040	A bijection between planar constellations and some colored Lagrangian trees Cedric Chauve
041-044	A Note on Set Systems with no Union of Cardinality 0 Modulo m Vince Grolmusz
045-054	The b-chromatic number of power graphs Brice Effantin and Hamamache Kheddouci
055-068	Some Algebraic Aspects of Morse Code Sequences Johann Cigler
069-090	A new two-variable generalization of the chromatic polynomial Klaus Dohmen and André Poenitz and Peter Tittmann
091-100	Numerical Studies of the Asymptotic Height Distribution in Binary Search Trees Charles Knessl
101-106	Fountains, histograms, and q-identities Peter Paule and Helmut Prodinger
107-122	Efficient maxima-finding algorithms for random planar samples Wei-Mei Chen and Hsien-Kuei Hwang and Tsung-Hsi Tsai
123-132	Minimum survivable graphs with bounded distance increase Selma Djelloul and Mekkia Kouider
133-142	An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions Andreas Weiermann
143-162	Towards automated proofs of observational properties Narjes Berregeb and Riadh Robbana and Ashish Tiwari
163-190	Some lattices of closure systems on a finite set. Nathalie Caspard and Bernard Monjardet
191-214	Rare Events and Conditional Events on Random Strings Mireille Regnier and Alain Denise
215-222	New Results on Generalized Graph Coloring Vladimir E. Alekseev and Alastair Farrugia and Vadim V. Lozin
223-252	Coxeter-like complexes Eric Babson and Victor Reiner
253-264	On Cheating Immune Secret Sharing Josef Pieprzyk and Xian-Mo Zhang
265-282	On Locating-Dominating Codes in Binary Hamming Spaces Honkala, Iiro and Laihonen, Tero and Ranto, Sanna
283-314	Statistical properties of General Markov dynamical sources: applications to information theory Frederic Chazal and Veronique Maume-Deschamps
315-338	Efficient Algorithms on the Family Associated to an Implicational System Karell Bertet and Mirabelle Nebut
339-358	On Linear Layouts of Graphs Vida Dujmović and David R. Wood
359-364	A Note on t-designs with t Intersection Numbers Rajendra M. Pawale
365-386	The Summation Package Sigma: Underlying Principles and a Rhombus Tiling Application Carsten Schneider
387-400	The Width of Galton-Watson Trees Conditioned by the Size Michael Drmota and Bernhard Gittenberger
401-408	Well-spread sequences and edge-labellings with constant Hamilton-weight P. Mark Kayll
409-424	The distribution of m-ary search trees generated by van der Corput sequences Wolfgang Steiner
425-436	Generating functions and the satisfiability threshold Vincent Puyhaubert
437-460	Analysis of some statistics for increasing tree families Alois Panholzer and Helmut Prodinger
461-470	On an open problem of Green and Losonczy: exact enumeration of freely braided permutations Toufik Mansour
471-480	Characterisations of Ideal Threshold Schemes Josef Pieprzyk and Xian-Mo Zhang
483-496	Optimal Sequential and Parallel Algorithms for Cut Vertices and Bridges on Trapezoid Graphs Hon-Chan Chen
497-522	Track Layouts of Graphs Vida Dujmović and Attila Pór and David R. Wood
523-528	Improved Expansion of Random Cayley Graphs Po-Shen Loh and Leonard J. Schulman