Discrete Mathematics & Theoretical Computer Science, Volume 3

Volume 3, Number 1, 1998

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

Volume 3 Number 2, 1999

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

Volume 3, Number 3, 1999

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

Volume 3, Number 4, 1999

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