@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},
}
@article{Bodlaender/93c,
AUTHOR = {Bodlaender, Hans L.},
TITLE = {On linear time minor tests with depth-first search},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {1},
PAGES = {1-23},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Du-Leung/93,
AUTHOR = {Du, Jianzhong and Leung, Joseph Y.-T.},
TITLE = {Minimizing mean flow time in two-machine open shops and flow shops},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {1},
PAGES = {24-44},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Du-Leung/93a,
AUTHOR = {Du, Jianzhong and Leung, Joseph Y.-T.},
TITLE = {Minimizing mean flow time with release time and deadline constraints},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {1},
PAGES = {45-68},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Agarwal-Sharir/93,
AUTHOR = {Agarwal, Pankaj and Sharir, Micha},
TITLE = {Circle shooting in a simple polygon},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {1},
PAGES = {69-87},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Valiveti-Oommen/93,
AUTHOR = {Valiveti, R.S. and Oommen, B.J.},
TITLE = {Self-organizing doubly-linked lists},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {1},
PAGES = {88-114},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Hell-Kirkpatrick/93,
AUTHOR = {Hell, P. and Kirkpatrick, D.G.},
TITLE = {Algorithms for degree constrained graph factors of minimum deficiency},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {1},
PAGES = {115-138},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Doh-Chwa/93,
AUTHOR = {Doh, Jeong-In and Chwa, Kyung-Yong},
TITLE = {An algorithm for determining visibility of a simple polygon from an internal line segment},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {1},
PAGES = {139-168},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Pearson-Vazirani/93,
AUTHOR = {Pearson, David and Vazirani, Vijay V.},
TITLE = {Efficient sequential and parallel algorithms for maximal bipartite sets},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {2},
PAGES = {171-179},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Goldberg-Plotkin-Vaidya/93,
AUTHOR = {Goldberg, Andrew V. and Plotkin, Serge A. and Vaidya, Pravin M.},
TITLE = {Sublinear-time parallel algorithms for matching and related problems},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {2},
PAGES = {180-213},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Khuller-Thurimella/93,
AUTHOR = {Khuller, Samir and Thurimella, Ramakrishna},
TITLE = {Approximation algorithms for graph augmentation},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {2},
PAGES = {214-225},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Zerovnik-Pisanski/93,
AUTHOR = {{\v{Z}}erovnik, Janez and Pisanski, Toma{\v{z}}},
TITLE = {Computing the diameter in multiple-loop networks},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {2},
PAGES = {226-243},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Ibarra-Wang-Jiang/93,
AUTHOR = {Ibarra, Oscar H. and Wang, Hui and Jiang, Tao},
TITLE = {On efficient parallel algorithms for solving set recurrence equations},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {2},
PAGES = {244-257},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Diks-Djidjev-Sykora-Vrto/93,
AUTHOR = {Diks, Krzystof and Djidjev, Hristo N. and Sykora, Ondrej and Vrto, Imrich},
TITLE = {Edge separators of planar and outerplanar graphs with applications},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {2},
PAGES = {258-279},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Karpinski-Luby/93,
AUTHOR = {Karpinski, Marek and Luby, Michael},
TITLE = {Approximating the number of zeroes of a $GF[2]$ polynomial},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {2},
PAGES = {280-287},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bitan-Zaks/93,
AUTHOR = {Bitan, Sara and Zaks, Shmuel},
TITLE = {Optimal linear broadcast},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {2},
PAGES = {288-315},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Afek-Ricklin/93,
AUTHOR = {Afek, Yehuda and Ricklin, Moty},
TITLE = {Sparser: A paradigm for running distributed algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {2},
PAGES = {316-328},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Klein/93b,
AUTHOR = {Klein, Philip N.},
TITLE = {Parallelism, preprocessing, and reachability: A hybrid algorithm for directed graphs},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {3},
PAGES = {331-343},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Berkman-Schieber-Vishkin/93,
AUTHOR = {Berkman, Omer and Schieber, Baruch and Vishkin, Uzi},
TITLE = {Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {3},
PAGES = {344-370},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Ragde/93,
AUTHOR = {Ragde, Prabhakar},
TITLE = {The parallel simplicity on compaction and chaining},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {3},
PAGES = {371-380},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Devroye-Toussaint/93,
AUTHOR = {Devroye, Luc and Toussaint, Godfried},
TITLE = {Convex hulls for random lines},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {3},
PAGES = {381-394},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Levcopoulos-Petersson/93,
AUTHOR = {Levcopoulos, Christos and Petersson, Ola},
TITLE = {Adaptive heapsort},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {3},
PAGES = {395-413},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Aspnes/93,
AUTHOR = {Aspnes, James},
TITLE = {Time- and space-efficient randomized consensus},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {3},
PAGES = {414-431},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Matousek/93,
AUTHOR = {Matou{\v{s}}ek, Ji{\v{r}}{\'i}},
TITLE = {Linear optimization queries},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {3},
PAGES = {432-448},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Mansour-Patt-Shamir/93,
AUTHOR = {Mansour, Yishay and Patt-Shamir, Boaz},
TITLE = {Greedy packet scheduling on shortest paths},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {3},
PAGES = {449-465},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Wang-Chen-Park/93,
AUTHOR = {Wang, Biing-Feng and Chen, Gen-Huey and Park, Kunsoo},
TITLE = {On the set LCS and set-set LCS problems},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {3},
PAGES = {466-477},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Kalyanasundaram-Pruhs/93,
AUTHOR = {Kalyanasundaram, Bala and Pruhs, Kirk},
TITLE = {Online weighted matching},
JOURNAL = {J. Algorithms},
VOLUME = {14},
NUMBER = {3},
PAGES = {478-488},
YEAR = {1993},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}