Volume 13,
Number 1,
March 1992
Papers from the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1990)
- Amihood Amir, Gad M. Landau, Uzi Vishkin:
Efficient Pattern Matching with Scaling.
2-32 BibTeX
- David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung:
Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph.
33-54 BibTeX
,
Corrigendum: J. Algorithms 15(1): 173(1993) BibTeX
- Maria M. Klawe:
Superlinear Bounds for Matrix Searching Problems.
55-78 BibTeX
- Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos:
Using Separation Algorithms in Fixed Dimension.
79-98 BibTeX
- Mike Paterson, F. Frances Yao:
Optimal Binary Space Partitions for Orthogonal Objects.
99-113 BibTeX
- Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen:
A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs.
114-127 BibTeX
- Leslie Ann Goldberg:
Efficient Algorithms for Listing Unlabeled Graphs.
128-143 BibTeX
- Peter Avery:
An Algorithmic Proof that Semiorders are Representable.
144-147 BibTeX
- Daniel S. Hirschberg, Lawrence L. Larmore:
The Traveler's Problem.
148-160 BibTeX
- Toshinobu Kashiwabara, Sumio Masuda, Kazuo Nakajima, Toshio Fujisawa:
Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph.
161-174 BibTeX
Volume 13,
Number 2,
June 1992
- P. P. Chakrabarti, Sujoy Ghose:
A General Best First Search Algorithm in AND/OR Graphs.
177-187 BibTeX
- Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg:
Single Round Simulation on Radio Networks.
188-210 BibTeX
- Robert Cypher, Jorge L. C. Sanz:
Cubesort: A Parallel Algorithm for Sorting N Data Items with S-Sorters.
211-234 BibTeX
- K. V. S. Ramarao, S. Venkatesan:
On Finding and Updating Shortest Paths Distributively.
235-257 BibTeX
- Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli:
Random Pseudo-Polynomial Algorithms for Exact Matroid Problems.
258-273 BibTeX
- Mark de Berg, Svante Carlsson, Mark H. Overmars:
A General Approach to Dominance in the Plane.
274-296 BibTeX
- Kenneth D. Blaha:
Minimum Bases for Permutation Groups: The Greedy Approximation.
297-306 BibTeX
- Jirí Matousek, Emo Welzl:
Good Splitters for Counting Points in Triangles.
307-319 BibTeX
- Michael Lindenbaum, Alfred M. Bruckstein:
Parallel Strategies for Geometric Probing.
320-349 BibTeX
Volume 13,
Number 3,
September 1992
Volume 13,
Number 4,
December 1992
Copyright © Sun May 17 00:06:07 2009
by Michael Ley (ley@uni-trier.de)
