Abstract is missing.
- Maintenance of a Minimum Spanning Forest in a Dynamic Planar GraphDavid Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung. 1-11
- Incremental Algorithms for Minimal Length PathsGiorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni. 12-21
- A Data Structure for Arc Insertion and Regular Path FindingAdam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter. 22-31
- Incremental Evaluation of Computational CircuitsBowen Alpern, Roger Hoover, Barry K. Rosen, Peter F. Sweeney, F. Kenneth Zadeck. 32-42
- Multilevel Adaptive HashingAndrei Z. Broder, Anna R. Karlin. 43-53
- Representing Sets with Constant Time Equality TestingDaniel M. Yellin. 64-73
- Efficient Maintenance of the Union Intervals on a Line, with ApplicationsSiu-Wing Cheng, Ravi Janardan. 74-83
- New Techniques for Some Dynamic Closest-Point and Farthest-Point ProblemsKenneth J. Supowit. 84-90
- Experiments on Traveling Salesman HeuristicsJon Louis Bentley. 91-99
- Visibility with a Moving Point of ViewMarshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman. 107-117
- Applying Parallel Processing Techniques to Classification Problems in Constructive Solid GeometryMichael T. Goodrich. 118-128
- An Efficiently Computable Metric for Comparing Polygonal ShapesEsther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell. 129-137
- Embedding Planar Graphs on the GridWalter Schnyder. 138-148
- An Optimal Algorithm for the Maximum Two-Chain ProblemRuey-Der Lou, Majid Sarrafzadeh, D. T. Lee. 149-158
- A Practical Algorithm for Computing the Delaunay Triangulation for Convex Distance FunctionsRobert L. (Scot) Drysdale III. 159-168
- Compact Interval Trees: A Data Structure for Convex HullsLeonidas J. Guibas, John Hershberger, Jack Snoeyink. 169-178
- Fast Linear Expected-Time Algorithms for Computing Maxima and Convex HullsJon Louis Bentley, Kenneth L. Clarkson, David B. Levine. 179-187
- Asymptotically Fast Triangularization of Matrices Over RingsJames L. Hafner, Kevin S. McCurley. 194-200
- Factor RefinementEric Bach, James R. Driscoll, Jeffrey Shallit. 201-211
- Parallel Search for Maximal Independence Given Minimal DependencePaul Beame, Michael Luby. 212-218
- An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed SizeMark K. Goldberg, Thomas H. Spencer. 219-225
- Coloration Neighborhood Structures for General Graph ColoringCraig A. Morgenstern, Harry Shapiro. 226-235
- Approximation Algorithms for the Maximum Acyclic Subgraph ProblemBonnie Berger, Peter W. Shor. 236-243
- Fast Parallel Algorithms for the Clique Separator DecompositionElias Dahlhaus, Marek Karpinski, Mark B. Novick. 244-251
- Split Decomposition of Undirected GraphsTze-Heng Ma, Jeremy Spinrad. 252-260
- First-Fit Storage of Linear Lists: Tight Probabilistic Bounds on Wasted SpaceEdward G. Coffman Jr., Leopold Flatto, Frank Thomson Leighton. 272-279
- A Competitive 3-Server AlgorithmPiotr Berman, Howard J. Karloff, Gábor Tardos. 280-290
- title=New Results on Server ProblemsMarek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan. 291-300
- Competitive Randomized Algorithms for Non-Uniform ProblemsAnna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki. 301-309
- Length-Limited CodingLawrence L. Larmore, Daniel S. Hirschberg. 310-318
- Suffix Arrays: A New Method for On-Line String SearchesUdi Manber, Gene Myers. 319-327
- Analysis of Boyer-Moore-Type String Searching AlgorithmsRicardo A. Baeza-Yates, Gaston H. Gonnet, Mireille Régnier. 328-343
- Efficient Pattern Matching with ScalingAmihood Amir, Gad M. Landau, Uzi Vishkin. 344-357
- Characterization and Algorithms for Greedily Solvable Transportation ProblemsRon Shamir, Brenda L. Dietrich. 358-366
- Improved Dual Network SimplexSerge A. Plotkin, Éva Tardos. 367-376
- Using Separation Algorithms in Fixed DimensionCarolyn Haibt Norton, Serge A. Plotkin, Éva Tardos. 377-387
- Stable HusbandsDonald E. Knuth, Rajeev Motwani, Boris Pittel. 397-404
- On the Number of Minimum Size Separating Vertex Sets in a Graph and How to Find All of ThemArkady Kanevsky. 411-421
- Efficient Algorithms for Generalized Cut TreesDan Gusfield, Dalit Naor. 422-433
- Data Structures for Weighted Matching and Nearest Common Ancestors with LinkingHarold N. Gabow. 434-443
- Determining the Evolutionary TreeSampath Kannan, Eugene L. Lawler, Tandy Warnow. 475-484
- Superlinear Bounds on Matrix SearchingMaria M. Klawe. 485-493
- Selection and Sorting in Totally Monotone ArraysDina Kravets, James K. Park. 494-502
- On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary StructureLawrence L. Larmore, Baruch Schieber. 503-512
- Sparse Dynamic ProgrammingDavid Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano. 513-522