External Links

    Journal: J. Algorithms

    Volume 4, Issue 4

    303 -- 309Pavol Hell, Moshe Rosenfeld. The Complexity of Finding Generalized Paths in Tournaments
    310 -- 323Hiroshi Imai, Takao Asano. Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane
    324 -- 331Ronald L. Graham, F. Frances Yao. Finding the Convex Hull of a Simple Polygon
    332 -- 344Paul Pritchard. Fast Compact Prime Number Sieves (among Others)
    345 -- 352Edward Minieka, Niranjani H. Patel. On Finding the Core of a Tree with a Specified Length
    353 -- 362Ten-Hwang Lai, Sartaj Sahni. Nearly On-Line Scheduling of Multiprocessor Systems with Memories
    363 -- 381Jean-Pierre Duval. Factorizing Words over an Ordered Alphabet
    382 -- 396Leonidas J. Guibas. Problems
    397 -- 411David S. Johnson. The NP-Completeness Column: An Ongoing Guide

    Volume 4, Issue 3

    205 -- 213John D. Dixon, Herbert S. Wilf. The Random Selection of Unlabeled Graphs
    214 -- 220A. Guénoche. Random Spanning Tree
    221 -- 240W. M. Beynon. A Formal Account of Some Elementary Continued Fraction Algorithms
    241 -- 261T. C. Hu, M. T. Shing. Multiterminal Flows in Outerplanar Networks
    262 -- 270Errol L. Lloyd. An O(n log m) Algorithm for the Josephus Problem
    271 -- 281Eliezer L. Lozinskii. An Algorithm for Parallel Evaluation of Functions
    282 -- 285C. Pandu Rangan. On the Minimum Number of Additions Required to Compute a Quadratic Form
    286 -- 300David S. Johnson. The NP-Completeness Column: An Ongoing Guide
    301 -- 0Mark H. Overmars. Corrigendum: Dynamization of Order Decomposable Set Problems

    Volume 4, Issue 2

    101 -- 120Ronald I. Becker, Yehoshua Perl. Shifting Algorithms for Tree Partitioning with General Weighting Functions
    121 -- 136Binay K. Bhattacharya, Godfried T. Toussaint. Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets
    137 -- 149Ephraim Feig. Certain Systems of Bilinear Forms Whose Minimal Algorithms Are All Quadratic
    150 -- 162Alan D. Kalvin, Yaakov L. Varol. On the Generation of All Topological Sortings
    163 -- 175Gregory Butler. Computing Normalizers in Permutation Groups
    176 -- 188Leonidas J. Guibas. Problems
    189 -- 203David S. Johnson. The NP-Completeness Column: An Ongoing Guide

    Volume 4, Issue 1

    1 -- 34Victor Y. Pan. The Additive and Logical Complexities of Linear and Bilinear Arithmetic Algorithms
    35 -- 44Daniel Leven, Zvi Galil. NP Completeness of Finding the Chromatic Index of Regular Graphs
    45 -- 50Uzi Vishkin. Implementation of Simultaneous Memory Address Access in Models That Forbid It
    51 -- 60U. I. Gupta, D. T. Lee, C. K. Wong. Ranking and Unranking of B-Trees
    61 -- 80Greg N. Frederickson, Donald B. Johnson. Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures
    81 -- 84Ephraim Feig. Minimal Algorithms for Bilinear Forms May Have Divisions
    85 -- 86Leonidas J. Guibas. Problems
    87 -- 100David S. Johnson. The NP-Completeness Column: An Ongoing Guide
    runs on