@article{Berger-Shor/97,
AUTHOR = {Berger, Bonnie and Shor, Peter W.},
TITLE = {Tight bounds for the maximum acyclic subgraph problem},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {1},
PAGES = {1-18},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Dietzfelbinger-Hagerup-Katajainen-Penttonen/97,
AUTHOR = {Dietzfelbinger, Martin and Hagerup, Torben and Katajainen, Jyrki and Penttonen, Martti},
TITLE = {A reliable randomized algorithm for the closest-pair problem},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {1},
PAGES = {19-51},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Habib-Nourine-Steiner/97,
AUTHOR = {Habib, Michel and Nourine, Lhouari and Steiner, George},
TITLE = {Gray codes for the ideals of interval orders},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {1},
PAGES = {52-66},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Heydari-Sudborough/97,
AUTHOR = {Heydari, Mohammad H. and Sudborough, I. Hal},
TITLE = {On the diameter of the pancake network},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {1},
PAGES = {67-94},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Afek-Stupp/97,
AUTHOR = {Afek, Yehuda and Stupp, Gideon},
TITLE = {Optimal time-space tradeoff for shared memory leader election},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {1},
PAGES = {95-117},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Krivelevich/97a,
AUTHOR = {Krivelevich, Michael},
TITLE = {Approximate set covering in uniform hypergraphs},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {1},
PAGES = {118-143},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Barbeau-Kabanza-St-Denis/97,
AUTHOR = {Barbeau, M. and Kabanza, F. and St-Denis, R.},
TITLE = {An efficient algorithm for controller synthesis under full observation},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {1},
PAGES = {144-161},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Alon-Kozlov/97,
AUTHOR = {Alon, Noga and Kozlov, Dmitry N.},
TITLE = {Coins with arbitrary weights},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {1},
PAGES = {162-176},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bhattacharya-Sen/97,
AUTHOR = {Bhattacharya, Binay K. and Sen, Sandeep},
TITLE = {On a simple, practical, optimal, output-sensitive randomized planar convex hull algorithm},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {1},
PAGES = {177-193},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Yao-Yao/97,
AUTHOR = {Yao, Andrew C. and Yao, Frances F.},
TITLE = {Dictionary look-up with one error},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {1},
PAGES = {194-202},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Klein-Subramanian/97,
AUTHOR = {Klein, Philip N. and Subramanian, Sairam},
TITLE = {A randomized parallel algorithm for single-source shortest paths},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {2},
PAGES = {205-220},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Hare/97,
AUTHOR = {Hare, D.E.G.},
TITLE = {Computing the principal branch of log-Gamma},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {2},
PAGES = {221-236},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Slavik/97a,
AUTHOR = {Slav{\'{i}}k, Petr},
TITLE = {A tight analysis of the greedy algorithm for set cover},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {2},
PAGES = {237-254},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Wang-Gusfield/97,
AUTHOR = {Wang, Lusheng and Gusfield, Dan},
TITLE = {Improved approximation algorihtms for tree alignment},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {2},
PAGES = {255-273},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bekesi-Galambos-Pferschy-Woeginger/97,
AUTHOR = {B{\'{e}}k{\'{e}}si, J{\'o}zsef and Galambos, G{\'{a}}bor and Pferschy, Ulrich and Woeginger, Gerhard J.},
TITLE = {Greedy algorithms for on-line data compression},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {2},
PAGES = {274-289},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Azar-Epstein/97a,
AUTHOR = {Azar, Yossi and Epstein, Leah},
TITLE = {On two dimensional packing},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {2},
PAGES = {290-310},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Luczak-Szymanska/97,
AUTHOR = {{\L}uczak, Tomasz and Szyma{\'n}ska, Edyta},
TITLE = {A parallel randomized algorithm for finding a maximal independent set in a linear hypergraph},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {2},
PAGES = {311-320},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Korsh-Lipschutz/97,
AUTHOR = {Korsh, James and Lipschutz, Seymour},
TITLE = {Generating multiset permutations in constant time},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {2},
PAGES = {321-335},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bhattacharya-Kaller/97,
AUTHOR = {Bhattacharya, Binay K. and Kaller, Damon},
TITLE = {An $O(m+n\log n)$ algorithm for the maximum-clique problem in circular-arc graphs},
JOURNAL = {J. Algorithms},
VOLUME = {25},
NUMBER = {2},
PAGES = {336-358},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Moran-Taubenfeld/97,
AUTHOR = {Moran, Shlomo and Taubenfeld, Gadi},
TITLE = {A lower bound on wait-free counting},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {1-19},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Haldar/97,
AUTHOR = {Haldar, S.},
TITLE = {An ``All pairs shortest paths'' distributed algorithm using $2n^2$ messages},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {20-36},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Frederickson/97,
AUTHOR = {Frederickson, Greg N.},
TITLE = {A data structure for dynamically maintaining rooted trees},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {37-65},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Hambrusch-Tu/97a,
AUTHOR = {Hambrusch, Susanne E. and Tu, Hung-Yi},
TITLE = {Edge weight reduction problems in directed acyclic graphs},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {66-93},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bodlaender-Engelfriet/97,
AUTHOR = {Bodlaender, Hans L. and Engelfriet, Joost},
TITLE = {Domino treewidth},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {94-123},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Chrobak-Larmore-Reingold-Westbrook/97,
AUTHOR = {Chrobak, Marek and Larmore, Lawrence L. and Reingold, Nick and Westbrook, Jeffery},
TITLE = {Page migration algorithms using work functions},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {124-157},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Even-Litman-Winkler/97,
AUTHOR = {Even, Shimon and Litman, Ami and Winkler, Peter},
TITLE = {Computing with snakes in directed networks of automata},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {158-170},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Broder-Mayr/97,
AUTHOR = {Broder, Andrei Z. and Mayr, Ernst W.},
TITLE = {Counting minimum weight spanning trees},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {171-176},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Eppstein-Hirschberg/97,
AUTHOR = {Eppstein, David and Hirschberg, Daniel S.},
TITLE = {Choosing subsets with maximum weighted average},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {177-193},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Rauch_Henzinger/97,
AUTHOR = {Rauch Henzinger, Monika},
TITLE = {A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {1},
PAGES = {194-220},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Giancarlo-Grossi/97,
AUTHOR = {Giancarlo, Raffaele and Grossi, Roberto},
TITLE = {Multi-dimensional pattern matching with dimensional wildcards: Data structures and optimal on-line search algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {223-265},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Guttmann-Beck-Hassin/97,
AUTHOR = {Guttmann-Beck, Nili and Hassin, Refael},
TITLE = {Approximation algorithms for min-max tree partition},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {266-286},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Fingerhut-Suri-Turner/97,
AUTHOR = {Fingerhut, J. Andrew and Suri, Subhash and Turner, Jonathan S.},
TITLE = {Designing least-cost nonblocking broadband networks},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {287-309},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Fekete-Khuller-Klemmstein-Raghavachari-Young/97,
AUTHOR = {Fekete, S{\'{a}}ndor P. and Khuller, Samir and Klemmstein, Monika and Raghavachari, Balaji and Young, Neal},
TITLE = {A network-flow technique for finding low-weight bounded-degree spanning trees},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {310-324},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Amir-Apostolico-Lewenstein/97,
AUTHOR = {Amir, Amihood and Apostolico, Alberto and Lewenstein, Moshe},
TITLE = {Inverse pattern matching},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {325-339},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Breslauer-Jiang-Jiang/97,
AUTHOR = {Breslauer, Dany and Jiang, Tao and Jiang, Zhigen},
TITLE = {Rotations of periodic strings and short superstrings},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {340-353},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Amir-Benson-Farach/97,
AUTHOR = {Amir, Amihood and Benson, Gary and Farach, Martin},
TITLE = {Optimal two-dimensional compressed matching},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {354-379},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Balasubramanian-Raman-Srinivasaragavan/97,
AUTHOR = {Balasubramanian, R. and Raman, Venkatesh and Srinivasaragavan, G.},
TITLE = {Finding scores in tournaments},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {380-394},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Dubois-Boufkhad/97,
AUTHOR = {Dubois, O. and Boufkhad, Y.},
TITLE = {A general upper bound for the satisfiability threshold of random $r$-SAT formulae},
JOURNAL = {J. Algorithms},
VOLUME = {24},
NUMBER = {2},
PAGES = {395-420},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Ramachandran/97,
AUTHOR = {Ramachandran, Vijaya},
TITLE = {Parallel algorithms for reducible flow graphs},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {1-31},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Kranakis-Krizanc/97,
AUTHOR = {Kranakis, Evangelos and Krizanc, Danny},
TITLE = {Distributed computing on anonymous hypercube networks},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {32-50},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Goodrich-Tamassia/97,
AUTHOR = {Goodrich, Michael T. and Tamassia, Roberto},
TITLE = {Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {51-73},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Czumaj-Gasieniec-Piotrow-Rytter/97,
AUTHOR = {Czumaj, Artur and G{\c{a}}sieniec, Leszek and Piotr{\'{o}}w, Marek and Rytter, Wojciech},
TITLE = {Sequential and parallel approximation of shortest superstrings},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {74-100},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Aroya-Newman-Schuster/97,
AUTHOR = {Aroya, Ishai Ben and Newman, Ilan and Schuster, Assaf},
TITLE = {Randomized single-target hot-potato routing},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {101-120},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Weihe/97a,
AUTHOR = {Weihe, Karsten},
TITLE = {Edge-disjoint $(s,t)$-paths in undirected planar graphs in linear time},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {121-138},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Thorup/97a,
AUTHOR = {Thorup, Mikkel},
TITLE = {Parallel shortcutting of rooted trees},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {139-159},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Thurimella/97,
AUTHOR = {Thurimella, Ramakrishna},
TITLE = {Sub-linear distributed algorithms for sparse certificates and biconnected components},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {160-179},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Garay-Gopal-Kutten-Mansour-Yung/97,
AUTHOR = {Garay, Juan A. and Gopal, Inder S. and Kutten, Shay and Mansour, Yishay and Yung, Moti},
TITLE = {Efficient on-line call control algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {180-194},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Pittel-Weishaar/97,
AUTHOR = {Pittel, Boris and Weishaar, Robert S.},
TITLE = {On-line coloring of sparse random graphs and random trees},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {1},
PAGES = {195-205},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Loebl-Nesetril/97,
AUTHOR = {Loebl, Martin and Ne{\u{s}}et{\u{r}}il, Jaroslav},
TITLE = {Linearity and unprovability of set union problem strategies --- I. Linearity of strong postorder},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {207-220},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Plaxton-Suel/97,
AUTHOR = {Plaxton, C. Greg and Suel, Torsten},
TITLE = {Lower bounds for Shellsort},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {221-240},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bartal-Rosen/97,
AUTHOR = {Bartal, Yair and Ros{\'{e}}n, Adi},
TITLE = {The distributed $k$-server problem --- A competitive distributed translator for $k$-server algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {241-264},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Halldorsson/97,
AUTHOR = {Halld{\'{o}}rsson, Magn{\'{u}}s M.},
TITLE = {Parallel and on-line graph coloring},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {265-280},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Shioura-Uno/97,
AUTHOR = {Shioura, Akiyoshi and Uno, Takeaki},
TITLE = {A linear time algorithm for finding a $k$-tree core},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {281-290},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Higham-Kirkpatrick-Abrahamson-Adler/97,
AUTHOR = {Higham, Lisa and Kirkpatrick, David and Abrahamson, Karl and Adler, Andrew},
TITLE = {Optimal algorithms for probabilistic solitude detection on anonymous rings},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {291-328},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Wang/97d,
AUTHOR = {Wang, Biing-Feng},
TITLE = {Tighter bounds on the solution of a divide-and-conquer maximin recurrence},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {329-344},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Brinkmann-Dress/97,
AUTHOR = {Brinkmann, Gunnar and Dress, Andreas W.M.},
TITLE = {A constructive enumeration of fullerenes},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {345-358},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Zhou-Suzuki-Nishizeki/97,
AUTHOR = {Zhou, Xiao and Suzuki, Hitoshi and Nishizeki, Takao},
TITLE = {An $NC$ parallel algorithm for edge-coloring series ---- Parallel multigraphs},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {359-374},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Eppstein/97a,
AUTHOR = {Eppstein, David},
TITLE = {Minimum range balanced cuts via dynamic subset sums},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {375-385},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Bradford-Fleischer-Smid/97,
AUTHOR = {Bradford, Phillip G. and Fleischer, Rudolf and Smid, Michiel},
TITLE = {More efficient parallel totally monotone matrix searching},
JOURNAL = {J. Algorithms},
VOLUME = {23},
NUMBER = {2},
PAGES = {386-400},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Goldberg/97,
AUTHOR = {Goldberg, Andrew V.},
TITLE = {An efficient implementation of a scaling minimum-cost flow algorithm},
JOURNAL = {J. Algorithms},
VOLUME = {22},
NUMBER = {1},
PAGES = {1-29},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Cohen/97a,
AUTHOR = {Cohen, Edith},
TITLE = {Using selective path-doubling for parallel shortest-path computations},
JOURNAL = {J. Algorithms},
VOLUME = {22},
NUMBER = {1},
PAGES = {30-56},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Palios/97,
AUTHOR = {Palios, Leonidas},
TITLE = {Connecting the maximum number of nodes in the grid to the boundary with nonintersecting line segments},
JOURNAL = {J. Algorithms},
VOLUME = {22},
NUMBER = {1},
PAGES = {57-92},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Azar-Kalyanasundaram-Plotkin-Pruhs-Waarts/97,
AUTHOR = {Azar, Yossi and Kalyanasundaram, Bala and Plotkin, Serge and Pruhs, Kirk R. and Waarts, Orli},
TITLE = {On-line load balancing of temporary tasks},
JOURNAL = {J. Algorithms},
VOLUME = {22},
NUMBER = {1},
PAGES = {93-110},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Sibeyn-Chlebus-Kaufmann/97,
AUTHOR = {Sibeyn, Jop F. and Chlebus, Bogdan S. and Kaufmann, Michael},
TITLE = {Deterministic permutation routing on meshes},
JOURNAL = {J. Algorithms},
VOLUME = {22},
NUMBER = {1},
PAGES = {111-141},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Gupta-Wenger/97,
AUTHOR = {Gupta, Himanshu and Wenger, Rephael},
TITLE = {Constructing piecewise linear homeomorphisms of simple polygons},
JOURNAL = {J. Algorithms},
VOLUME = {22},
NUMBER = {1},
PAGES = {142-157},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Afek-Awerbuch-Gafni-Mansour-Rosen-Shavit/97,
AUTHOR = {Afek, Yehuda and Awerbuch, Baruch and Gafni, Eli and Mansour, Yishay and Ros{\'{e}}n, Adi and Shavit, Nir},
TITLE = {Slide --- The key to polynomial end-to-end communication},
JOURNAL = {J. Algorithms},
VOLUME = {22},
NUMBER = {1},
PAGES = {158-186},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Penn-Shasha-Krupnik/97,
AUTHOR = {Penn, Michal and Shasha-Krupnik, Haya},
TITLE = {Improved approximation algorithms for weighted 2- and 3-vertex connectivity augmentation problems},
JOURNAL = {J. Algorithms},
VOLUME = {22},
NUMBER = {1},
PAGES = {187-196},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Berman-Diks-Pelc/97,
AUTHOR = {Berman, Piotr and Diks, Krzysztof and Pelc, Andrzej},
TITLE = {Reliable broadcasting in logarithmic time with Byzantine link failures},
JOURNAL = {J. Algorithms},
VOLUME = {22},
NUMBER = {2},
PAGES = {199-211},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Fernandez-Baca-Slutzki/97,
AUTHOR = {Fern{\'{a}}ndez-Baca, David and Slutzki, Giora},
TITLE = {Optimal parametric search on graphs of bounded tree-width},
JOURNAL = {J. Algorithms},
VOLUME = {22},
NUMBER = {2},
PAGES = {212-240},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Klein-Plotkin-Rao-Tardos/97,
AUTHOR = {Klein, Philip N. and Plotkin, Serge A. and Rao, Satish and Tardos, {\'{E}}va},
TITLE = {Approximation algorithms for Steiner and directed multicuts},
JOURNAL = {J. Algorithms},
VOLUME = {22},
NUMBER = {2},
PAGES = {241-269},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{de_la_Torre-Kao/97,
AUTHOR = {de la Torre, Pilar and Kao, David T.},
TITLE = {A uniform approach to the analysis of trie structures that store prefixing-keys},
JOURNAL = {J. Algorithms},
VOLUME = {22},
NUMBER = {2},
PAGES = {270-295},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Ferragina/97,
AUTHOR = {Ferragina, Paolo},
TITLE = {Dynamic text indexing under string updates},
JOURNAL = {J. Algorithms},
VOLUME = {22},
NUMBER = {2},
PAGES = {296-328},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Rub/97,
AUTHOR = {R{\"u}b, Christine},
TITLE = {On the average running time of odd-even merge sort},
JOURNAL = {J. Algorithms},
VOLUME = {22},
NUMBER = {2},
PAGES = {329-346},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Reif-Tate/97,
AUTHOR = {Reif, John H. and Tate, Stephen R.},
TITLE = {On dynamic algorithms for algebraic problems},
JOURNAL = {J. Algorithms},
VOLUME = {22},
NUMBER = {2},
PAGES = {347-371},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}
@article{Fu/97,
AUTHOR = {Fu, James Jianghai},
TITLE = {Directed graph pattern matching and topological embedding},
JOURNAL = {J. Algorithms},
VOLUME = {22},
NUMBER = {2},
PAGES = {372-391},
YEAR = {1997},
PUBLISHER = {Academic Press},
ADDRESS = {New York-London-Toronto-Sydney-San Francisco},
}