Algorithmica, Volume 31, 2001

Volume 31, Number 1, 2001

• Alon Efrat, Alon Itai, Matthew J. Katz:
  Geometry Helps in Bottleneck Matching and Related Problems. 1-28
  Electronic Edition (Springer LINK) BibTeX
• Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén:
  On-Line Competitive Algorithms for Call Admission in Optical Networks. 29-43
  Electronic Edition (Springer LINK) BibTeX
• J. C. Cogolludo, Sanguthevar Rajasekaran:
  Permutation Routing on Reconfigurable Meshes. 44-57
  Electronic Edition (Springer LINK) BibTeX
• R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III:
  Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. 58-78
  Electronic Edition (Springer LINK) BibTeX
• Stephan Eidenbenz, Christoph Stamm, Peter Widmayer:
  Inapproximability Results for Guarding Polygons and Terrains. 79-113
  Electronic Edition (Springer LINK) BibTeX

Volume 31, Number 2, 2001

• János Csirik, David S. Johnson:
  Bounded Space On-Line Bin Packing: Best Is Better than First. 115-138
  Electronic Edition (Springer LINK) BibTeX
• Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein:
  Uniquely Restricted Matchings. 139-154
  Electronic Edition (Springer LINK) BibTeX
• Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau:
  All-to-All Optical Routing in Chordal Rings of Degree 4. 155-178
  Electronic Edition (Springer LINK) BibTeX
• Neelima Gupta, Sandeep Sen:
  An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. 179-207
  Electronic Edition (Springer LINK) BibTeX
• Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda:
  Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers. 208-236
  Electronic Edition (Springer LINK) BibTeX

Volume 31, Number 3, 2001

• Vicky Siu-Ngan Choi, Mordecai J. Golin:
  Lopsided Trees, I: Analyses. 240-290
  Electronic Edition (Springer LINK) BibTeX
• Luc Devroye:
  On the Probablistic Worst-Case Time of ``Find''. 291-303
  Electronic Edition (Springer LINK) BibTeX
• Michael Drmota:
  The Asymptotic Number of Leftist Trees. 304-317
  Electronic Edition (Springer LINK) BibTeX
• Philippe Jacquet, Wojciech Szpankowski, Jing Tang:
  Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source. 318-360
  Electronic Edition (Springer LINK) BibTeX
• Philippe Flajolet, Guy Louchard:
  Analytic Variations on the Airy Distribution. 361-377
  Electronic Edition (Springer LINK) BibTeX
• Micha Hofri, Hadas Shachnai:
  Efficient Reorganization of Binary Search Trees. 378-402
  Electronic Edition (Springer LINK) BibTeX
• Tatsuie Tsukiji, Hosam M. Mahmoud:
  A Limit Law for Outputs in Random Recursive Circuits. 403-412
  Electronic Edition (Springer LINK) BibTeX
• Daniel Panario, L. Bruce Richmond:
  Exact Largest and Smallest Size of Components. 413-432
  Electronic Edition (Springer LINK) BibTeX
• Helmut Prodinger:
  A q-Analogue of the Path Length of Binary Search Trees. 433-441
  Electronic Edition (Springer LINK) BibTeX
• Robert T. Smythe, J. Wellner:
  Stochastic Analysis of Shell Sort. 442-457
  Electronic Edition (Springer LINK) BibTeX

Volume 31, Number 4, 2001

• Peter A. Beling:
  Exact Algorithms for Linear Programming over Algebraic Extensions. 459-478
  Electronic Edition (Springer LINK) BibTeX
• Guoliang Xue, Guo-Hui Lin, Ding-Zhu Du:
  Grade of Service Steiner Minimum Trees in the Euclidean Plane. 479-500
  Electronic Edition (Springer LINK) BibTeX
• Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer:
  Relaxed Balance Using Standard Rotations. 501-512
  Electronic Edition (Springer LINK) BibTeX
• Ruy Luiz Milidiú, Eduardo Sany Laber:
  Bounding the Inefficiency of Length-Restricted Prefix Codes. 513-529
  Electronic Edition (Springer LINK) BibTeX
• B. Das, Michael C. Loui:
  Reconstructing a Minimum Spanning Tree after Deletion of Any Node. 530-547
  Electronic Edition (Springer LINK) BibTeX