Discrete Mathematics & Theoretical Computer Science

Volume 3:4 (1999), 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
141-150	A note on domino treewidth Hans L. Bodlaender
151-154	Permutations containing and avoiding 123 and 132 Patterns Aaron Robertson
155-166	Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks Keqin Li
167-176	Classes of graphs with restricted interval models Andrzej Proskurowski and Jan Arne Telle
177-188	A characterization for all interval doubling schemes of the lattice of permutations Nathalie Caspard
189-192	Accelerated series for universal constants by the WZ method Herbert Wilf
193-214	Polytopic Functions Over Nested Datatypes Ralf Hinze