@article{Gusfield/84,
AUTHOR = {Gusfield, D.},
TITLE = {Bounds for naive multiple machine scheduling with release times and deadlines},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {1},
PAGES = {1-6},
YEAR = {1984, March},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Yale Univ., New Haven, CT, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Knott/84,
AUTHOR = {Knott, G.D.},
TITLE = {Direct-chaining with coalescing lists},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {1},
PAGES = {7-21},
YEAR = {1984, March},
PUBLISHER = {Academic Press},
INSTITUTION = {Nat. Inst. of Health, Bethesda, MD, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Leung/84a,
AUTHOR = {Leung, J.Y.-T.},
TITLE = {Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {1},
PAGES = {22-35},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Larson/84,
AUTHOR = {Larson, P.-{\AA}.},
TITLE = {Analysis of hashing with chaining in the prime area},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {1},
PAGES = {36-47},
YEAR = {1984, March},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Univ. of Waterloo, Waterloo, Ontario, Canada},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Dolev-Warmuth/84,
AUTHOR = {Dolev, D. and Warmuth, M.K.},
TITLE = {Scheduling precedence graphs of bounded height},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {1},
PAGES = {48-59},
YEAR = {1984, March},
PUBLISHER = {Academic Press},
INSTITUTION = {IBM Res. Lab., San Jose, CA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Tucker-Wilson/84,
AUTHOR = {Tucker, A. and Wilson, D.},
TITLE = {An $O(N^2)$ algorithm for coloring perfect planar graphs},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {1},
PAGES = {60-68},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Huang-Wong/84,
AUTHOR = {Huang, S.-H.S. and Wong, C.K.},
TITLE = {Optimal binary split trees},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {1},
PAGES = {69-79},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Gabow-Tarjan/84,
AUTHOR = {Gabow, H.N. and Tarjan, R.E.},
TITLE = {Efficient algorithms for a family of matroid intersection problems},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {1},
PAGES = {80-131},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ramanan-Deogun-Liu/84,
AUTHOR = {Ramanan, P. and Deogun, J.S. and Liu, C.L.},
TITLE = {A personnel assignment problem},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {1},
PAGES = {132-144},
YEAR = {1984, March},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Univ. of Illinois, Urbana, IL, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Guibas/84,
AUTHOR = {Guibas, Leo J.},
TITLE = {Problems},
JOURNAL = {J. Algorithms},
VOLUME = {5},
PAGES = {145-146},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Johnson/84,
AUTHOR = {Johnson, D.S.},
TITLE = {The $NP$-completeness column: An ongoing guide},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {1},
PAGES = {147-160},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Plaisted/84a,
AUTHOR = {Plaisted, D.A.},
TITLE = {Heuristic matching for graphs satisfying the triangle inequality},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {2},
PAGES = {163-179},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Weinberger/84,
AUTHOR = {Weinberger, P.J.},
TITLE = {Finding the number of factors of a polynomial},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {2},
PAGES = {180-186},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Boshernitzan-Fraenkel/84,
AUTHOR = {Boshernitzan, M. and Fraenkel, A.S.},
TITLE = {A linear algorithm for nonhomogeneous spectra of numbers},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {2},
PAGES = {187-198},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Soisalon-Soininen-Wood/84,
AUTHOR = {Soisalon-Soininen, E. and Wood, D.},
TITLE = {Optimal algorithms to compute the closure of a set of iso-rectangles},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {2},
PAGES = {199-214},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Anstee-Farber/84,
AUTHOR = {Anstee, R.P. and Farber, M.},
TITLE = {Characterizations of totally balanced matrices},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {2},
PAGES = {215-230},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Papadimitriou-Vazirani/84,
AUTHOR = {Papadimitriou, C.H. and Vazirani, U.V.},
TITLE = {On two geometric problems related to the travelling salesman problem},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {2},
PAGES = {231-246},
YEAR = {1984, June},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Computer Sci., Nat. Tech. Univ. of Athens, Athens, Greece},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Wormald/84a,
AUTHOR = {Wormald, N.C.},
TITLE = {Generating random regular graphs},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {2},
PAGES = {247-280},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Semba/84,
AUTHOR = {Semba, I.},
TITLE = {An efficient algorithm for generating all $k$-subsets ($1\leq k\leq m\leq n$) of the set $\{1,2,\ldots,n\}$ in lexicographical order},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {2},
PAGES = {281-283},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Johnson/84a,
AUTHOR = {Johnson, D.S.},
TITLE = {The NP-completeness column: An ongoing guide},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {2},
PAGES = {284-299},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Guting/84b,
AUTHOR = {G{\"u}ting, R.H.},
TITLE = {An optimal contour algorithm for iso-oriented rectangles},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {3},
PAGES = {303-326},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Seroussi-Lempel/84,
AUTHOR = {Seroussi, G. and Lempel, A.},
TITLE = {On symmetric algorithms for bilinear forms over finite fields},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {3},
PAGES = {327-344},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Corneil-Goldberg/84,
AUTHOR = {Corneil, D. and Goldberg, M.},
TITLE = {A non-factorial algorithm for canonical numbering of a graph},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {3},
PAGES = {345-362},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Valiant/84,
AUTHOR = {Valiant, L.G.},
TITLE = {Short monotone formulae for the majority function},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {3},
PAGES = {363-366},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Perl/84,
AUTHOR = {Perl, Y.},
TITLE = {Optimum split trees},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {3},
PAGES = {367-374},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Rosenstiehl-Tarjan/84,
AUTHOR = {Rosenstiehl, P. and Tarjan, R.E.},
TITLE = {Gauss codes, planar Hamiltonian graphs, and stack-sortable permutations},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {3},
PAGES = {375-390},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Gilbert-Hutchinson-Tarjan/84,
AUTHOR = {Gilbert, J.R. and Hutchinson, J.P. and Tarjan, R.E.},
TITLE = {A separator theorem for graphs of bounded genus},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {3},
PAGES = {391-407},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Lengauer/84,
AUTHOR = {Lengauer, T.},
TITLE = {On the solution of inequality systems relevant to IC-layout},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {3},
PAGES = {408-421},
YEAR = {1984, September},
PUBLISHER = {Academic Press},
INSTITUTION = {Fachbereich 10, Saarland Univ., Saarbr{\"u}cken, Germany},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Main-Lorentz/84,
AUTHOR = {Main, M.G. and Lorentz, R.J.},
TITLE = {An $O(n\log n)$ algorithm for finding all repetitions in a string},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {3},
PAGES = {422-432},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Johnson/84b,
AUTHOR = {Johnson, D.S.},
TITLE = {The NP-completeness column: An ongoing guide},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {3},
PAGES = {433-447},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Gonnet-Munro/84,
AUTHOR = {Gonnet, G.H. and Munro, J.I.},
TITLE = {The analysis of linear probing sort by the use of a new mathematical transform},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {4},
PAGES = {451-470},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Remmel-Whitney/84,
AUTHOR = {Remmel, J.B. and Whitney, R.},
TITLE = {Multiplying Schur functions},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {4},
PAGES = {471-487},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Shamir-Upfal/84,
AUTHOR = {Shamir, E. and Upfal, E.},
TITLE = {Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {4},
PAGES = {488-501},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Assmann-Johnson-Kleitman-Leung/84,
AUTHOR = {Assmann, S.F. and Johnson, D.S. and Kleitman, D.J. and Leung, J.Y.-T.},
TITLE = {On a dual version of the one-dimensional bin packing problem},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {4},
PAGES = {502-525},
YEAR = {1984, December},
PUBLISHER = {Academic Press},
INSTITUTION = {MIT, Cambridge, MA, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Hakimi-Schmeichel/84,
AUTHOR = {Hakimi, S.L. and Schmeichel, E.F.},
TITLE = {An adaptive algorithm for system level diagnosis},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {4},
PAGES = {526-530},
YEAR = {1984, December},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Electr. Eng. and Comput. Sci., Northwestern Univ., Evanston, IL, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Gurari-Sudborough/84,
AUTHOR = {Gurari, E.M. and Sudborough, I.H.},
TITLE = {Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {4},
PAGES = {531-546},
YEAR = {1984, December},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Comput. and Inf. Sci., Ohio State Univ., Columbus, OH, USA},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Hofri/84,
AUTHOR = {Hofri, M.},
TITLE = {A probabilistic analysis of the next-fit bin packing algorithm},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {4},
PAGES = {547-556},
YEAR = {1984, December},
PUBLISHER = {Academic Press},
INSTITUTION = {Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Ramanan-Hyafil/84,
AUTHOR = {Ramanan, P.V. and Hyafil, L.},
TITLE = {New algorithms for selection},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {5},
PAGES = {557-578},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}
@article{Guibas/84a,
AUTHOR = {Guibas, Leo J.},
TITLE = {Problems},
JOURNAL = {J. Algorithms},
VOLUME = {5},
PAGES = {579-594},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Johnson/84c,
AUTHOR = {Johnson, D.S.},
TITLE = {The NP-completeness column: An ongoing guide},
JOURNAL = {J. Algorithms},
VOLUME = {5},
NUMBER = {5},
PAGES = {595-609},
YEAR = {1984},
PUBLISHER = {Academic Press},
ADDRESS = {New York-San Francisco-London-San Diego},
}