@article{Csirik/93,
AUTHOR = {Csirik, J.},
TITLE = {The parametric behavior of the first-fit decreasing bin packing algorithm},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {1},
PAGES = {1-28},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Frederickson-Guan/93,
AUTHOR = {Frederickson, Greg N. and Guan, D.J.},
TITLE = {Nonpreemptive ensemble motion planning on a tree},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {1},
PAGES = {29-60},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Thomassen/93,
AUTHOR = {Thomassen, Carsten},
TITLE = {The even cycle problem for planar digraphs},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {1},
PAGES = {61-75},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Schaffer-Sedgewick/93,
AUTHOR = {Schaffer, Russel and Sedgewick, Robert},
TITLE = {The analysis of heapsort},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {1},
PAGES = {76-100},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Poonen/93,
AUTHOR = {Poonen, Bjorn},
TITLE = {The worst case in Shellsort and related algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {1},
PAGES = {101-124},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Hartvigsen/93,
AUTHOR = {Hartvigsen, David},
TITLE = {Minimum path bases},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {1},
PAGES = {125-142},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Peng-Stephens-Yesha/93,
AUTHOR = {Peng, Shietung and Stephens, A.B. and Yesha, Yelena},
TITLE = {Algorithms for a core and $k$-tree core of a tree},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {1},
PAGES = {143-159},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bodlaender-Kloks/93,
AUTHOR = {Bodlaender, Hans and Kloks, Ton},
TITLE = {A simple linear time algorithm for triangulating three-colored graphs},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {1},
PAGES = {160-172},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Althofer/93,
AUTHOR = {Alth{\"o}fer, Ingo},
TITLE = {A parallel game tree search algorithm with a linear speedup},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {2},
PAGES = {175-198},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bach-Driscoll-Shallit/93,
AUTHOR = {Bach, Eric and Driscoll, James and Shallit, Jeffrey},
TITLE = {Factor refinement},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {2},
PAGES = {199-222},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Joichi-Stanton/93,
AUTHOR = {Joichi, Jim and Stanton, Dennis},
TITLE = {An algorithmic involution for $p(n)$},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {2},
PAGES = {223-228},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Agarwal-Kreveld-Overmars/93,
AUTHOR = {Agarwal, Pankaj K. and Kreveld, Marc van and Overmars, Mark},
TITLE = {Intersection queries in curved objects},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {2},
PAGES = {229-266},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Formann-Wagner-Wagner/93,
AUTHOR = {Formann, Michael and Wagner, Dorothea and Wagner, Frank},
TITLE = {Routing through a dense channel with minimum total wire length},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {2},
PAGES = {267-283},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{He/93a,
AUTHOR = {He, Xin},
TITLE = {Parallel algorithm for cograph recognition with applications},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {2},
PAGES = {284-313},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Agarwal-Efrat-Sharir-Toledo/93,
AUTHOR = {Agarwal, Pankaj K. and Efrat, Alon and Sharir, Micha and Toledo, Sivan},
TITLE = {Computing a segment center for a planar point set},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {2},
PAGES = {314-323},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Koda-Ruskey/93,
AUTHOR = {Koda, Yasunori and Ruskey, Frank},
TITLE = {A Gray code for the ideals of a forest poset},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {2},
PAGES = {324-340},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Lucas-Roelants_van_Baronaigien-Ruskey/93,
AUTHOR = {Lucas, Joan M. and Roelants van Baronaigien, D. and Ruskey, Frank},
TITLE = {On rotations and the generation of binary trees},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {3},
PAGES = {343-366},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Dahlhaus-Hajnal-Karpinski/93,
AUTHOR = {Dahlhaus, Elias and Hajnal, P{\'e}ter and Karpinski, Marek},
TITLE = {On the parallel complexity of Hamiltonian cycle and matching problem on dense graphs},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {3},
PAGES = {367-384},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bar-Ilan-Kortsarz-Peleg/93,
AUTHOR = {Bar-Ilan, Judit and Kortsarz, Guy and Peleg, David},
TITLE = {How to allocate network centers},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {3},
PAGES = {385-415},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Booth-Tarjan/93,
AUTHOR = {Booth, Heather and Tarjan, Robert E.},
TITLE = {Finding the minimum-cost maximum flow in a series-parallel network},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {3},
PAGES = {416-446},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Martel-Hui/93,
AUTHOR = {Martel, Charles and Hui, Lucas Chi Kwong},
TITLE = {Unsuccessful search in self-adjusting data structures},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {3},
PAGES = {447-481},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Mohar/93b,
AUTHOR = {Mohar, Bojan},
TITLE = {Projective planarity in linear time},
JOURNAL = {J. Algorithms},
VOLUME = {15},
NUMBER = {3},
PAGES = {482-502},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}