Volume 18,
Number 1,
January 1995
Volume 18,
Number 2,
March 1995
- Martin Fürer, Balaji Raghavachari:
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs.
203-220
- Yossi Azar, Joseph Naor, Raphael Rom:
The Competitiveness of On-Line Assignments.
221-237
- Hans L. Bodlaender, John R. Gilbert, Hjálmtyr Hafsteinsson, Ton Kloks:
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree.
238-255
- Mark de Berg, Marc J. van Kreveld, Jack Snoeyink:
Two- and Three-Dimensional Point Location in Rectangular Subdivisions.
256-277
- Dany Breslauer:
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries.
278-296
- Yuval Caspi, Eliezer Dekel:
Edge Coloring Series Parallel Graphs.
296-321
- Yosi Ben-Asher, Assaf Schuster:
The Complexity of Data Reduction on a Reconfigurable Linear Array.
322-357
- Ten-Hwang Lai, Shu-Shang Wei:
Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs.
358-375
Volume 18,
Number 3,
May 1995
Copyright © Mon Nov 2 21:43:00 2009
by Michael Ley (ley@uni-trier.de)
