Volume 15,
Number 1,
July 1993
- János Csirik:
The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm.
1-28 BibTeX
- Greg N. Frederickson, D. J. Guan:
Nonpreemptive Ensemble Motion Planning on a Tree.
29-60 BibTeX
- Carsten Thomassen:
The Even Cycle Problem for Planar Digraphs.
61-75 BibTeX
- Russel Schaffer, Robert Sedgewick:
The Analysis of Heapsort.
76-100 BibTeX
- Bjorn Poonen:
The Worst Case in Shellsort and Related Algorithms.
101-124 BibTeX
- David Hartvigsen:
Minimum Path Bases.
125-142 BibTeX
- Shietung Peng, A. B. Stephens, Yelena Yesha:
Algorithms for a Core and k-Tree Core of a Tree.
143-159 BibTeX
- Hans L. Bodlaender, Ton Kloks:
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs.
160-172 BibTeX
- David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung:
Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph.
173 BibTeX
,
->J. Algorithms 13(1): 33-54(1992) BibTeX
Volume 15,
Number 2,
September 1993
- Ingo Althöfer:
A Parallel Game Tree Search Algorithm with a Linear Speedup.
175-198 BibTeX
- Eric Bach, James R. Driscoll, Jeffrey Shallit:
Factor Refinement.
199-222 BibTeX
- Jim Joichi, Dennis Stanton:
An Algorithmic Involution for p(n).
223-228 BibTeX
- Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars:
Intersection Queries in Curved Objects.
229-266 BibTeX
- Michael Formann, Dorothea Wagner, Frank Wagner:
Routing through a Dense Channel with Minimum Total Wire Length.
267-283 BibTeX
- Xin He:
Parallel Algorithm for Cograph Recognition with Applications.
284-313 BibTeX
- Pankaj K. Agarwal, Alon Efrat, Micha Sharir, Sivan Toledo:
Computing a Segment Center for a Planar Point Set.
314-323 BibTeX
- Yasunori Koda, Frank Ruskey:
A Gray Code for the Ideals of a Forest Poset.
324-340 BibTeX
Volume 15,
Number 3,
November 1993
Copyright © Sun May 17 00:06:07 2009
by Michael Ley (ley@uni-trier.de)
