Journal of Algorithms, Volume 26

Volume 26, Number 1, January 1998

• Philip D. MacKenzie, Quentin F. Stout: Ultafast Expected Time Parallel Algorithms. 1-33
• Sivaprakasam Sunder, Xin He: Scheduling Interval Ordered Tasks in Parallel. 34-47
• Harold N. Gabow: Algorithms for Graphic Polymatroids and Parametris s-Sets. 48-86
• Vincenzo Auletta, Domenico Parente, Giuseppe Persiano: Placing Resources on a Growing Line. 87-100
• Ehab S. Elmallah, Lorna K. Stewart: Polygon Graph Recognition. 101-140
• Sameet Agarwal, Anne Condon: On Approximation Algorithms for Hierarchical MAX-SAT. 141-165
• Zhi-Zhong Chen: Efficient Approximation Schemes for Maximization Problems on K_{3, 3}-Free Graphs. 166-187
• Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin: Constructing Computer Virus Phylogenies. 188-208

Volume 26, Number 2, February 1998

• Claudio Mirolo: Convex Minimization on a Grid and Applications. 209-237
• Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. 238-274
• Matthew B. Squire: Generating the Acyclic Orientations of a Graph. 275-290
• Kazuhisa Makino, Toshihide Ibaraki: A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. 291-305
• Brendan D. McKay: Isomorph-Free Exhaustive Generation. 306-324
• Lata Narayanan, Naomi Nishimura: Interval Routing on k-Trees. 325-369
• Weimin Chen: More Efficient Algorithm for Ordered Tree Inclusion. 370-385
• James Aspnes, William Hurwood: Spreading Rumors Rapidly Despite an Adversary. 386-411