Abstract is missing.
- Optimization over k-set Polytopes and Efficient k-set EnumerationArtur Andrzejak, Komei Fukuda. 1-12 [doi]
- Line Simplification with Restricted OrientationsGabriele Neyer. 13-24 [doi]
- The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask LayoutPiotr Berman, Andrew B. Kahng, Devendra Vidhani, Alexander Zelikovsky. 25-36 [doi]
- Resizable Arrays in Optimal Time and SpaceAndrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick. 37-48 [doi]
- Hash and Displace: Efficient Evaluation of Minimal Perfect Hash FunctionsRasmus Pagh. 49-54 [doi]
- Design and Analysis of Algorithms for Shared-Memory Multiprocessors (Abstract)Charles E. Leiserson. 55 [doi]
- On the Complexity of Orthogonal CompactionMaurizio Patrignani. 56-61 [doi]
- Optimizing Constrained Offset and Scaled Polygonal Annuli62-73 [doi]
- The Accommodating Function - A Generalization of the Competitive RatioJoan Boyar, Kim S. Larsen, Morten N. Nielsen. 74-79 [doi]
- Performance Guarantees for the TSP with a Parameterized Triangle InequalityMichael A. Bender, Chandra Chekuri. 80-85 [doi]
- Robot Map Verification of a Graph WorldXiaotie Deng, Evangelos E. Milios, Andy Mirzaian. 86-97 [doi]
- Searching Rectilinear Streets CompletelyChristoph A. Bröcker, Sven Schuierer. 98-109 [doi]
- General Multiprocessor Task Scheduling: Approximate Solutions in Linear TimeKlaus Jansen, Lorant Porkolab. 110-121 [doi]
- The Lazy Bureaucrat Scheduling ProblemEsther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena. 122-133 [doi]
- Generating 3D Virtual Populations from Pictures of a Few IndividualsWon-Sook Lee, Pierre Beylot, David Sankoff, Nadia Magnenat-Thalmann. 134-144 [doi]
- Testing the Quality of Manufactured BallsProsenjit Bose, Pat Morin. 145-156 [doi]
- On an Optimal Split Tree ProblemS. Rao Kosaraju, Teresa M. Przytycka, Ryan S. Borgstrom. 157-168 [doi]
- Representing Trees of Higer DegreeDavid Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman. 169-180 [doi]
- Indexing and Dictionary Matching with One ErrorAmihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh. 181-192 [doi]
- New Results of Fault Tolerant Geometric SpannersTamás Lukovszki. 193-204 [doi]
- Tiered Vectors: Efficient Dynamic Arrays for Rank-Based SequencesMichael T. Goodrich, John G. Kloss II. 205-216 [doi]
- Go-With-The-Winners HeuristicUmesh V. Vazirani. 217-218 [doi]
- 2-Point Site Voronoi DiagramsGill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III. 219-230 [doi]
- A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the PlaneFrancis Y. L. Chin, Der-Tsai Lee, Cao An Wang. 231-240 [doi]
- Position-Independent Street SearchingChristoph A. Bröcker, Alejandro López-Ortiz. 241-252 [doi]
- Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein MoleculesSamarjit Chakraborty, Somenath Biswas. 253-264 [doi]
- A Tight Bound for ß-SKeleton of Minimum Weight TriangulationsCao An Wang, Bo-Ting Yang. 265-275 [doi]
- Rectilinear Static and Dynamic Discrete 2-center ProblemsSergei Bespamyatnikh, Michael Segal. 276-287 [doi]
- Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter TractableUlrike Stege. 288-293 [doi]
- Efficient Web Searching Using Temporal FactorsArtur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito. 294-305 [doi]
- Elastic Labels Around the Perimeter of a MapClaudia Iturriaga, Anna Lubiw. 306-317 [doi]
- Optimal Facility Location under Various Distance FunctionsSergei Bespamyatnikh, Klara Kedem, Michael Segal. 318-329 [doi]
- Tresholds for Sports Elimination Numbers Algorithms and ComplexityDan Gusfield, Charles U. Martel. 330-341 [doi]
- Dynamic Representation of Sparse GraphsGerth Stølting Brodal, Rolf Fagerberg. 342-351 [doi]
- Online Data Structures in External MemoryJeffrey Scott Vitter. 352-366 [doi]