On sufficient-completeness and related properties of term rewriting systems Deepak KapurPaliath NarendranHantao Zhang OriginalPaper Pages: 395 - 415
Parallel approximation schemes for Subset Sum and Knapsack problems Joseph G. PetersLarry Rudolph OriginalPaper Pages: 417 - 432
A result on k-valent graphs and its application to a graph embedding problem Paul E. Dunne OriginalPaper Pages: 447 - 459
Time optimal left to right construction of position trees M. KempfR. BayerU. Güntzer OriginalPaper Pages: 461 - 474
Optimal worst case trees Edward A. BenderCheryl E. PraegerNicholas C. Wormald OriginalPaper Pages: 475 - 489