Algorithmica, Volume 4, 1989

Volume 4, Number 1, 1989

• Chee-Keng Yap: Editor's Foreword: Special Issue on Computational Geometry. 1-2
• David P. Dobkin, Michael J. Laszlo: Primitives for the Manipulation of Three-Dimensional Subdivisions. 3-32
• Robert L. (Scot) Drysdale III, Robert B. Jerard, Barry Schaudt, Ken Hauck: Discrete Simulation of NC Machining. 33-60
• Masato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano: A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency. 61-76
• Hiroshi Imai, Kenji Kato, Peter Yamamoto: A Linear-Time Algorithm for Linear L_1 Approximation of Points. 77-96
• L. Paul Chew: Constrained Delaunay Triangulations. 97-108
• Boris Aronov: On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon. 109-140
• John Hershberger: An Optimal Visibility Graph Algorithm for Triangulated Simple Polygons. 141-155

Volume 4, Number 2, 1989

• Chandrajit L. Bajaj, Myung-Soo Kim: Generation of Configuration Space Obstacles: The Case of Moving Algebraic Curves. 157-172
• David Fernández-Baca, Charles U. Martel: On the Efficiency of Maximum-Flow Algorithms on Networks with Small Integer Capacities. 173-189
• Dana S. Richards: Fast Heuristic Algorithms for Rectilinear Steiner Trees. 191-207
• Joseph Y.-T. Leung: A New Algorithm for Scheduling Periodic Real-Time Tasks. 209-219
• Mikhail J. Atallah, S. Rao Kosaraju: An Efficient Algorithm for Maxdominance, with Applications. 221-236
• Shang-Ching Chou, Jin-Gen Yang: On the Algebraic Formulation of Certain Geometry Statements and Mechanical Geometry Theorem Proving. 237-262
• D. F. Wong, C. L. Liu: Floorplan Design of VLSI Circuits. 263-291
• Andrew Chi-Chih Yao: On Selecting the k Largest with Median Tests. 293-300

Volume 4, Number 3, 1989

• Israel Cidon, Inder S. Gopal: Editor's Foreword: Special Issue on Algorithmic Aspects of Communications. 301-302
• Sergio Verdú: Computational Complexity of Optimum Multiuser Detection. 303-312
• Michael Paterakis, Leonidas Georgiadis, Panayota Papantoni-Kazakos: A Full Sensing Window Random-Access Algorithm for Messages with Strict Delay Constraints. 313-328
• Yaron I. Gold, Shlomo Moran: A Correction Algorithm for Token-Passing Sequences in Mobile Communication Networks. 329-341
• Jeffrey M. Jaffe, Zvi Rosberg: Maximal Selection in Tandem Networks with Symmetric Hearing Range. 343-364
• M. J. Post, Aaron Kershenbaum, P. E. Sarachik: Scheduling Multihop CDMA Networks in the Presence of Secondary Conflicts. 365-393
• Jonathan L. Wang, John A. Silvester: Optimizing Responses to Broadcast Messages in Radio Networks. 395-416
• Jeffrey M. Jaffe, Moshe Sidi: Distributed Deadlock Resolution in Store-and-Forward Networks. 417-436
• Hagit Attiya, Jan van Leeuwen, Nicola Santoro, Shmuel Zaks: Efficient Elections in Chordal Ring Networks. 437-446

Volume 4, Number 4, 1989

• Sanjiv Kapoor, Prakash V. Ramanan: Lower Bounds for Maximal and Convex Layers Problems. 447-459
• Kenneth L. Clarkson: An Algorithm for Geometric Minimum Spanning Trees Requiring Nearly Linear Expected Time. 461-469
• Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito: Algorithms for Multicommodity Flows in Planar Graphs. 471-501
• Daniel S. Hirschberg, Lawrence L. Larmore: The Set-Set LCS Problem. 503-510
• Nimrod Megiddo: Extending NC and RNC Algorithms. 501-517
• Prakash V. Ramanan, Kazuhiro Tsuga: Average-Case Analysis of the Modified Harmonic Algorithm. 519-533
• Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood: A Dynamic Fixed Windowing Problem. 535-550
• Michael Luby, Prabhakar Ragde: A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior. 551-567
• Pravin M. Vaidya: Approximate Minimum Weight Matching on Points in k-Dimensional Space. 569-583
• Elena Lodi, Fabrizio Luccio, Linda Pagli: A Preliminary Study of a Diagonal Channel-Routing Model. 585-597
• Steven Skiena: Problems in Geometric Probing. 599-605