2. Number - All Departments

Number	Title	Name(s)	Pages
91-123	An optimal algorithm for the on-line closest-pair problem	Schwarz, Smid, Snoeyink	11
91-122	On embeddings in cycles	Hromkovic, Müller, Sýkora, Vrto	22
91-121	On a compaction theorem of ragde	Hagerup	6
91-120	An $O(n^3)$-time maximum-flow algorithm	Cheriyan, Hagerup, Mehlhorn	30
91-115	A lower bound for the nondeterministic space complexity of contextfree recognition	Alt, Geffert, Mehlhorn	4
91-114	Algorithms for dense graphs and networks	Cheriyan, Mehlhorn	29
91-113	Tail estimates for the space complexity of randomized incremantal algorithms	Mehlhorn, Sharir, Welzl	8
91-112	An optimal construction method for generalized convex layers	Lenhof, Smid	25
91-110	Approximate decision algorithms for point set congruence	Heffernan, Schirra	25
91-107	An O(n log n log log n) algorithm for the on-line closes pair problem	Schwarz, Smid	21
91-106	Fast parallel space allocation, estimation an integer sorting	Hagerup	28
91-105	Simultaneous inner and outer aproximation of shapes	Fleischer, Mehlhorn, Rote, Welzl	24
91-104	A tight lower bound for the worst case of bottom-up-heapsort	Fleischer	13
91-103	Maintaining the minimal distance of a point set in polylogarithmic time (revised version)	Smid	17
91-102	Range trees with slack parameter	Smid	11
91-101	Dynamic rectangular point location, with an application to the closest pair problem	Smid	28