Volume 12,
Number 1,
March 1991
- Jirí Matousek, Robin Thomas:
Algorithms Finding Tree-Decompositions of Graphs.
1-22 BibTeX
- Xin He:
An Improved Algorithm for the Planar 3-Cut Problem.
23-37 BibTeX
- Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri:
Finding k Points with Minimum Diameter and Related Problems.
38-56 BibTeX
- Siu-Wing Cheng, Ravi Janardan:
Efficient Maintenance of the Union of Intervals on a Line, with Applications.
57-74 BibTeX
- Subir Kumar Ghosh:
Computing the Visibility Polygon from a Convex Set and Related Problems.
75-95 BibTeX
- Teresa M. Przytycka, Derek G. Corneil:
Parallel Algorithms for Parity Graphs.
96-109 BibTeX
- Phillip B. Gibbons, Richard M. Karp, Vijaya Ramachandran, Danny Soroker, Robert Endre Tarjan:
Transitive Compaction in Parallel via Branchings.
110-125 BibTeX
- Ryan Hayward, Colin McDiarmid:
Average Case Analysis of Heap Building by Repeated Insertion.
126-153 BibTeX
- Jimmy J. M. Tan:
A Necessary and Sufficient Condition for the Existence of a Complete Stable Matching.
154-178 BibTeX
- Herbert S. Wilf:
Two Algorithms for the Sieve Method.
179-182 BibTeX
- Peter van Emde Boas:
Problems.
183-185 BibTeX
Volume 12,
Number 2,
June 1991
- János Csirik, J. B. G. Frenk, Gábor Galambos, A. H. G. Rinnooy Kan:
Probabilistic Analysis of Algorithms for Dual Bin Packing Problems.
189-203 BibTeX
- Hagit Attiya, Marc Snir:
Better Computing on the Anonymous Ring.
204-238 BibTeX
- Daniel Bienstock, Paul D. Seymour:
Monotonicity in Graph Searching.
239-245 BibTeX
- Young Man Kim, Ten-Hwang Lai:
The Complexity of Congestion-1 Embedding in a Hypercube.
246-280 BibTeX
- Hans Zantema:
Minimizing Sums of Addition Chains.
281-307 BibTeX
- Stefan Arnborg, Jens Lagergren, Detlef Seese:
Easy Problems for Tree-Decomposable Graphs.
308-340 BibTeX
- Vasilis Capoyleas, Günter Rote, Gerhard J. Woeginger:
Geometric Clusterings.
341-356 BibTeX
Volume 12,
Number 3,
September 1991
Volume 12,
Number 4,
December 1991
- Micha Hofri, Hadas Shachnai:
Self-Organizing Lists and Independent References: A Statistical Synergy.
533-555 BibTeX
- Brigitte Vallée:
Gauss' Algorithm Revisited.
556-572 BibTeX
- Yossi Matias, Uzi Vishkin:
On Parallel Hashing and Integer Sorting.
573-606 BibTeX
- Marek Chrobak, Lawrence L. Larmore:
On Fast Algorithms for Two Servers.
607-614 BibTeX
- Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni:
Incremental Algorithms for Minimal Length Paths.
615-638 BibTeX
- James R. Bergen, Haim Schweitzer:
A Probabilistic Algorithm for Computing Hough Transforms.
639-656 BibTeX
- Binghuan Zhu, Wayne Goddard:
An Algorithm for Outerplanar Graphs with Parameter.
657-662 BibTeX
- Xiaolin Wu:
Optimal Quantization by Matrix Searching.
663-673 BibTeX
- Ludek Kucera:
The Greedy Coloring Is a Bad Probabilistic Algorithm.
674-684 BibTeX
- Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young:
Competitive Paging Algorithms.
685-699 BibTeX
- Peter van Emde Boas:
Problems.
700-703 BibTeX
Copyright © Sun May 17 00:06:07 2009
by Michael Ley (ley@uni-trier.de)
