Abstract is missing.
- An Extension of the Lovász Local Lemma, and its Applications to Integer ProgrammingAravind Srinivasan. 6-15
- A Better Approximation Algorithm for Finding Planar SubgraphsGruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff. 16-25
- Improving Biconnectivity Approximation via Local OptimizationKa Wong Chong, Tak Wah Lam. 26-35
- Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search TreesMarek Karpinski, Lawrence L. Larmore, Wojciech Rytter. 36-41
- Time and Space Efficient Method-Lookup for Object-Oriented Programs (Extended Abstract)S. Muthukrishnan, Martin Müller 0002. 42-51
- Worst-Case Efficient Priority QueuesGerth Stølting Brodal. 52-58
- On-line Generalized Steiner ProblemBaruch Awerbuch, Yossi Azar, Yair Bartal. 68-74
- Randomized Robot Navigation AlgorithmsPiotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks. 75-84
- Scheduling with Conflicts, and Applications to Traffic Signal ControlSandy Irani, Vitus J. Leung. 85-94
- Multiprocessor Scheduling with RejectionYair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie. 95-103
- Polynomial-Time Solutions to Image SegmentationTetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama. 104-113
- Optimal Placement of Convex Polygons to Maximize Point ContainmentMatthew Dickerson, Daniel Scharstein. 114-121
- Efficient Generation of k-Directional Assembly SequencesPankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir. 122-131
- Fixed-Dimensional Parallel Linesr Programming via epsilon-Relative-ApproximationsMichael T. Goodrich. 132-141
- Scheduling to Minimize Average Completion Time: Off-line and On-line AlgorithmsLeslie A. Hall, David B. Shmoys, Joel Wein. 142-151
- Preemptive Scheduling of Parallel Jobs on MultiprocessorsXiaotie Deng, Nian Gu, Tim Brecht, KaiCheng Lu. 159-167
- Tiling a Figure Using a Height in a TreeEric Rémila. 168-174
- The Complexity of Flat OrigamiMarshall W. Bern, Barry Hayes. 175-183
- Electrostatic Fields without Singularities: Theory and AlgorithmsMarco Pellegrini. 184-191
- Isomorphism Testing and Display of Symmetries in Dynamic TreesSiu-Wing Cheng, Moon-Pun Ng. 202-211
- Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract)Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni. 212-221
- On Certificates and Lookahead in Dynamic Graph ProblemsSanjeev Khanna, Rajeev Motwani, Randall H. Wilson. 222-231
- Matching Nuts and Bolts in O(n log n) Time (Extended Abstract)János Komlós, Yuan Ma, Endre Szemerédi. 232-241
- Depth Optimal Sorting Networks Resistant to k Passive FaultsMarek Piotrów. 242-251
- An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random GraphsAndrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal. 261-268
- Routing and Admission Control in General Topology Networks with Poisson ArrivalsAnil Kamath, Omri Palmon, Serge A. Plotkin. 269-278
- A Commercial Application of Survivable Network Design: ITP/INPLANS CCS Network Topology AnalyzerMilena Mihail, David Shallcross, Nate Dean, Marco Mostrel. 279-287
- Selecting Training Inputs via Greedy Rank CoveringAdam L. Buchsbaum, Jan P. H. van Santen. 288-295
- Data Collection for the Sloan Digital Sky Survey - A Network-Flow HeuristicRobert Lupton, F. Miller Maley, Neal E. Young. 296-303
- Reconstructing the Evolutionary History of Natural LanguagesTandy Warnow, Donald Ringe, Ann Taylor. 314-322
- An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary TreesRichard Cole, Ramesh Hariharan. 323-332
- Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman BoundDavid S. Johnson, Lyle A. McGeoch, Edward E. Rothberg. 341-350
- Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version)Claire Kenyon, Yuval Rabani, Alistair Sinclair. 351-358
- Best-Fit Bin-Packing with Random OrderClaire Kenyon. 359-364
- On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)Richa Agarwala, Vineet Bafna, Martin Farach, Babu O. Narayanan, Mike Paterson, Mikkel Thorup. 365-372
- Efficient Suffix Trees on Secondary Storage (extended Abstract)David R. Clark, J. Ian Munro. 383-391
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple New Method for the Geometric k-MST ProblemJoseph S. B. Mitchell. 402-408
- Optimization Problems Related to Zigzag Pocket Machining (Extended Abstract)Esther M. Arkin, Martin Held, Christopher L. Smith. 419-428
- RNC Algorithms for the Uniform Generation of Combinatorial StructuresMichele Zito, Ida Pu, Martyn Amos, Alan Gibbons. 429-437
- How to Get an Exact Sample From a Generic Markov Chain and Sample a Random Spanning Tree From a Directed Graph, Both Within the Cover TimeDavid Bruce Wilson, James Gary Propp. 448-457
- Error-Resilient DNA ComputationRichard M. Karp, Claire Kenyon, Orli Waarts. 458-467
- Games, Computers, and O.REhud Kalai. 468-473
- A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows (An Extended Abstract)James B. Orlin. 474-481
- A Capacity Scaling Algorithm for Convex Cost Submodular FlowsSatoru Iwata. 482-489
- A Polynomial Algorithm for Abstract Maximum FlowS. Thomas McCormick. 490-497
- Multiplicative Equations over Commuting MatricesLászló Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks. 498-507
- Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with ApplicationsMing-Deh A. Huang, Ashwin J. Rao. 508-517
- A New Approach to Parallel Computation of Polynomial GCD and to Related Parallel Computations over Fields and Integer RingsVictor Y. Pan. 518-527
- Perfect Arborescence Packing in Preflow Mincut GraphsHarold N. Gabow. 528-538
- Increasing the Weight of Minimum Spanning TreesGreg N. Frederickson, Roberto Solis-Oba. 539-546
- Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication)Donald Aingworth, Chandra Chekuri, Rajeev Motwani. 547-553
- Analysis of Practical Backoff Protocols for Contention Resolution with Multiple ServersLeslie Ann Goldberg, Philip D. MacKenzie. 554-563
- Self-Stabilizing Algorithms for Synchronous Unidirectional RingsAlain J. Mayer, Rafail Ostrovsky, Moti Yung. 564-573
- Distributed Paging for General NetworksBaruch Awerbuch, Yair Bartal, Amos Fiat. 574-583