@article{Culberson-Reckhow/94,
AUTHOR = {Culberson, Joseph C. and Reckhow, Robert A.},
TITLE = {Covering polygons is hard},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {1},
PAGES = {2-44},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Fredman-Goldsmith/94,
AUTHOR = {Fredman, Michael and Goldsmith, Deborah L.},
TITLE = {Three stacks},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {1},
PAGES = {45-70},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Malitz/94,
AUTHOR = {Malitz, Seth M.},
TITLE = {Graphs with $E$ edges have pagenumber $O(\sqrt{E})$},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {1},
PAGES = {71-84},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Malitz/94a,
AUTHOR = {Malitz, Seth M.},
TITLE = {Genus $g$ graphs have pagenumber $O(\sqrt{g})$},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {1},
PAGES = {85-109},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Moses-Waarts/94,
AUTHOR = {Moses, Yoram and Waarts, Orli},
TITLE = {Coordinated traversal: $(t + 1)$-round Byzantine agreement in polynomial time},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {1},
PAGES = {110-156},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Leighton-Maggs-Ranade-Rao/94,
AUTHOR = {Leighton, F.T. and Maggs, Bruce M. and Ranade, Abhiram G. and Rao, Satish B.},
TITLE = {Randomized routing and sorting on fixed-connection networks},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {1},
PAGES = {157-205},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Gavril-Laredo-Werra/94,
AUTHOR = {Gavril, F. and Laredo, V. Toledano and Werra, D. de},
TITLE = {Chordless paths, odd holes, and kernels in graphs without $m$-obstructions},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {2},
PAGES = {207-221},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Kortsarz-Peleg/94b,
AUTHOR = {Kortsarz, Guy and Peleg, David},
TITLE = {Generating sparse 2-spanners},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {2},
PAGES = {222-236},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Eppstein/94e,
AUTHOR = {Eppstein, David},
TITLE = {Offline algorithms for dynamic minimum spanning tree problems},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {2},
PAGES = {237-250},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Ma-Spinrad/94a,
AUTHOR = {Ma, Tze-Heng and Spinrad, Jeremy P.},
TITLE = {On the 2-chain subgraph cover and related problems},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {2},
PAGES = {251-268},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Kofler-Leondes/94,
AUTHOR = {Kofler, E.T. and Leondes, C.T.},
TITLE = {Algorithmic modifications to the theory of evidential reasoning},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {2},
PAGES = {269-279},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Khuller-Vishkin-Young/94,
AUTHOR = {Khuller, Samir and Vishkin, Uzi and Young, Neal},
TITLE = {A primal-dual parallel approximation technique applied to weighted set and vertex covers},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {2},
PAGES = {280-289},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Agarwal-Sharir-Toledo/94,
AUTHOR = {Agarwal, Pankaj K. and Sharir, Micha and Toledo, Sivan},
TITLE = {Applications of parametric searching in geometric optimization},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {3},
PAGES = {292-318},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bar-Eli-Berman-Fiat-Yan/94,
AUTHOR = {Bar-Eli, Eldad and Berman, Piotr and Fiat, Amos and Yan, Peiyuan},
TITLE = {Online navigation in a room},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {3},
PAGES = {319-341},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Baumgarten-Jung-Mehlhorn/94,
AUTHOR = {Baumgarten, Hanna and Jung, Hermann and Mehlhorn, Kurt},
TITLE = {Dynamic point location in general subdivisions},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {3},
PAGES = {342-380},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Berman-Ramaiyer/94,
AUTHOR = {Berman, Piotr and Ramaiyer, Viswanathan},
TITLE = {Improved approximations for the Steiner tree problem},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {3},
PAGES = {381-408},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Furer-Raghavachari/94,
AUTHOR = {F{\"u}rer, Martin and Raghavachari, Balaji},
TITLE = {Approximating the minimum-degree Steiner tree to within one of optimal},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {3},
PAGES = {409-423},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Hao-Orlin/94,
AUTHOR = {Hao, Jianxiu and Orlin, James B.},
TITLE = {A faster Algorithm for finding the minimum cut in a directed graph},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {3},
PAGES = {424-446},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{King-Rao-Tarjan/94,
AUTHOR = {King, V. and Rao, S. and Tarjan, R.},
TITLE = {A faster deterministic maximum flow algorithm},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {3},
PAGES = {447-474},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Yannakakis/94,
AUTHOR = {Yannakakis, Mihalis},
TITLE = {On the approximation of maximum satisfiability},
JOURNAL = {J. Algorithms},
VOLUME = {17},
NUMBER = {3},
PAGES = {475-502},
YEAR = {1994},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}