Dynamic programming and convex clustering Vladimir BatageljSimona Korenjak-ČerneSandi Klavžar OriginalPaper Pages: 93 - 103
A tight lower bound for the worst case of Bottom-Up-Heapsort Rudolf Fleischer OriginalPaper Pages: 104 - 115
Algorithms for bichromatic line-segment problems and polyhedral terrains Bernard ChazelleHerbert EdelsbrunnerMicha Sharir OriginalPaper Pages: 116 - 132
The derivation of on-line algorithms, with an application to finding palindromes Johan Jeuring OriginalPaper Pages: 146 - 184