External Links

    Journal: Discrete Mathematics & Theoretical Computer Science

    Volume 3, Issue 4

    141 -- 150Hans Leo Bodlaender. A note on domino treewidth
    151 -- 154Aaron Robertson. Permutations Containing and Avoiding 123 and 132 Patterns
    155 -- 166Keqin Li. Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks
    167 -- 176Andrzej Proskurowski, Jan Arne Telle. Classes of graphs with restricted interval models
    177 -- 188Nathalie Caspard. A characterization for all interval doubling schemes of the lattice of permutations
    189 -- 192Herbert S. Wilf. Accelerated series for universal constants, by the WZ method
    193 -- 214Ralf Hinze. Polytypic Functions Over Nested Datatypes

    Volume 3, Issue 3

    71 -- 72Daniel Krob, Christoph Meinel, Michel Morvan. Editors foreword - Selected papers from STACS 1998
    73 -- 94Peter Bürgisser. On the Structure of Valiant s Complexity Classes
    95 -- 107Kim S. Larsen. Partially persistent search trees with transcript operations
    109 -- 124Thomas Schwentick, Klaus Barthelmann. Local Normal Forms for First-Order Logic with Applications to Games and Automata
    125 -- 140Anna E. Frid. Applying a uniform marked morphism to a word

    Volume 3, Issue 2

    33 -- 42Elisha Falbel, Pierre-Vincent Koseleff. The Number of Sides of a Parallelogram
    43 -- 64Charles Knessl, Wojciech Szpankowski. Quicksort Algorithm Again Revisited
    65 -- 70Manfred Göbel. Optimal Lower Bound for Generators of Invariant Rings without Finite SAGBI Bases with Respect to Any Admissible Order

    Volume 3, Issue 1

    1 -- 10Ulrik Brandes, Dagmar Handke. ::::NP::::-Completeness Results for Minimum Planar Spanners
    11 -- 32Christian Krattenthaler. An Involution Principle-Free Bijective Proof of Stanley s Hook-Content Formula
    runs on