@article{Efrat-Itai-Katz/01,
AUTHOR = {Efrat, A. and Itai, A. and Katz, M.J.},
TITLE = {Geometry helps in bottleneck matching and related problems},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {1},
PAGES = {1-28},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Awerbuch-Azar-Fiat-Leonardi-Rosen/01,
AUTHOR = {Awerbuch, B. and Azar, Y. and Fiat, A. and Leonardi, S. and Ros{\'{e}}n, A.},
TITLE = {On-line competitive algorithms for call admission in optical networks},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {1},
PAGES = {29-43},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cogolludo-Rajasekaran/01,
AUTHOR = {Cogolludo, J.C. and Rajasekaran, S.},
TITLE = {Permutation routing on reconfigurable meshes},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {1},
PAGES = {44-57},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ravi-Marathe-Ravi-Rosenkrantz-Hunt/01,
AUTHOR = {Ravi, R. and Marathe, M.V. and Ravi, S.S. and Rosenkrantz, D.J. and Hunt III, H.B.},
TITLE = {Approximation algorithms for degree-constrained minimum-cost network-design problems},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {1},
PAGES = {58-78},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Eidenbenz-Stamm-Widmayer/01,
AUTHOR = {Eidenbenz, S. and Stamm, C. and Widmayer, P.},
TITLE = {Inapproximability results for guarding polygons and terrains},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {1},
PAGES = {79-113},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Csirik-Johnson/01,
AUTHOR = {Csirik, J. and Johnson, D.S.},
TITLE = {Bounded space on-line bin packing: Best is better than first},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {2},
PAGES = {115-138},
YEAR = {2001},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=31&issue=2&spage=115},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Golumbic-Hirst-Lewenstein/01,
AUTHOR = {Golumbic, M.C. and Hirst, T. and Lewenstein, M.},
TITLE = {Uniquely restricted matchings},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {2},
PAGES = {139-154},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Narayanan-Opatrny-Sotteau/01,
AUTHOR = {Narayanan, L. and Opatrny, J. and Sotteau, D.},
TITLE = {All-to-all optical routing in chordal rings of degree 4},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {2},
PAGES = {155-178},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Gupta-Sen/01,
AUTHOR = {Gupta, N. and Sen, S.},
TITLE = {An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {2},
PAGES = {179-207},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Yamashita-Umemoto-Suzuki-Kameda/01,
AUTHOR = {Yamashita, M. and Umemoto, H. and Suzuki, I. and Kameda, T.},
TITLE = {Searching for mobile intruders in a polygonal region by a group of mobile searchers},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {2},
PAGES = {208-236},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Choi-Golin/01,
AUTHOR = {Choi, V. and Golin, M.J.},
TITLE = {Lopsided trees --- I: Analysis},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {3},
PAGES = {240-290},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Devroye/01,
AUTHOR = {Devroye, L.},
TITLE = {On the probabilistic worst-case time of ``find''},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {3},
PAGES = {291-303},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Drmota/01b,
AUTHOR = {Drmota, M.},
TITLE = {The asymptotic number of leftist trees},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {3},
PAGES = {304-317},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Jacquet-Szpankowski-Tang/01,
AUTHOR = {Jacquet, P. and Szpankowski, W. and Tang, J.},
TITLE = {Average profile of the Lempel-Ziv parsing scheme for a Markovian source},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {3},
PAGES = {318-360},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Flajolet-Louchard/01,
AUTHOR = {Flajolet, P. and Louchard, G.},
TITLE = {Analytic variations on the airy distribution},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {3},
PAGES = {361-377},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Hofri-Schachnai/01,
AUTHOR = {Hofri, M. and Schachnai, H.},
TITLE = {Efficient reorganization of binary search trees},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {3},
PAGES = {378-402},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Tsukiji-Mahmoud/01,
AUTHOR = {Tsukiji, T. and Mahmoud, H.},
TITLE = {A limit law for outputs in random recursive circuits},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {3},
PAGES = {403-412},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Panario-Richmond/01a,
AUTHOR = {Panario, D. and Richmond, B.},
TITLE = {Exact largest and smallest size of components},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {3},
PAGES = {413-432},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Prodinger/01,
AUTHOR = {Prodinger, H.},
TITLE = {A $q$-analogue of the path length of binary search trees},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {3},
PAGES = {433-441},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Smythe-Wellner/01,
AUTHOR = {Smythe, R.T. and Wellner, J.},
TITLE = {Stochastic analysis of Shell Sort},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {3},
PAGES = {442-457},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Beling/01,
AUTHOR = {Beling, P.A.},
TITLE = {Exact algorithms for linear programming over algebraic extensions},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {4},
PAGES = {459-478},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Xue-Lin-Du/01,
AUTHOR = {Xue, G. and Lin, G.-H. and Du, D.-Z.},
TITLE = {Grade of service Steiner minimum trees in the Euclidean plane},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {4},
PAGES = {479-500},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Larsen-Soisalon-Soininen-Widmayer/01,
AUTHOR = {Larsen, K.S. and Soisalon-Soininen, E. and Widmayer, P.},
TITLE = {Relaxed balance using standard rotations},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {4},
PAGES = {501-512},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Milidiu-Laber/01,
AUTHOR = {Milidi{\'u}, R.L. and Laber, E.S.},
TITLE = {Bounding the inefficiency of lenght-restricted prefix codes},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {4},
PAGES = {513-529},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Das-Loui/01,
AUTHOR = {Das, B. and Loui, M.C.},
TITLE = {Reconstructing a minimum spanning tree after deletion of any node},
JOURNAL = {Algorithmica},
VOLUME = {31},
NUMBER = {4},
PAGES = {530-547},
YEAR = {2001},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}