Abstract is missing.
- Algorithms and Data Structures for Control Dependence and Related Compiler ProblemsGianfranco Bilardi. 1-2
- Embedding Interconnection Networks in Grids via the Layered Cross ProductGuy Even, Shimon Even. 3-12
- Finding Optimum ::::k::::-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for ::::k::::=3, 4, 5Yefim Dinitz, Zeev Nutov. 13-24
- The Optimum Cost Chromatic Partition ProblemKlaus Jansen. 25-36
- Fault Tolerant K-Center ProblemsSamir Khuller, Robert Pless, Yoram J. Sussmann. 37-48
- R:::SN:::::1-tt::(NP) Distinguishes Robust Many-One and Turing CompletenessEdith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel. 49-60
- Syntactic Characterization in LISP of the Polynominal Complexity Classes and HierarchySalvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino. 61-73
- On the Drift of Short SchedulesUriel Feige, Giora Rayzman. 74-85
- On Removing Non-degeneracy Assumptions in Computational GeometryFrancisco Gómez, Suneeta Ramaswami, Godfried T. Toussaint. 86-99
- Maintaining Maxima under Boundary UpdatesFabrizio d Amore, Paolo Giulio Franciosa, Roberto Giaccio, Maurizio Talamo. 100-109
- An Optimal Algorithm for One-Separation of a Set of Isothetic PolygonsAmitava Datta, Kamala Krithivasan, Thomas Ottmann. 110-121
- Nice Drawings for Planar Bipartite GraphsUlrich Fößmeier, Michael Kaufmann. 122-134
- Area Requirement of Gabriel DrawingsGiuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis, Paola Vocca. 135-146
- Design of Reliable Combinatorial Algorithms Using CertificatesFabrizio Luccio, Alberto Pedrotti. 147-158
- An Improved Deterministic Algorithms for Generalized Random SamplingAmihood Amir, Emanuel Dar. 159-170
- Polynominal Time Algorithms for Some Self-Duality ProblemsCarlos Domingo. 171-180
- A Note on Updating Suffix Tree LabelsPaolo Ferragina, Roberto Grossi, Manuela Montangero. 181-192
- Relaxed Balanced Red-Black TreesSabine Hanke, Thomas Ottmann, Eljas Soisalon-Soininen. 193-204
- The Algorithmic Complexity of Chemical Threshold TestingPeter Damaschke. 205-216
- A Meticulous Analysis of Mergesort ProgramsJyrki Katajainen, Jesper Larsson Träff. 217-228
- BSP-Like External-Memory ComputationJop F. Sibeyn, Michael Kaufmann. 229-240
- Topological Chaos for Elementary Cellular AutomataGianpiero Cattaneo, Michele Finelli, Luciano Margara. 241-252
- On the Complexity of Balanced Boolean FunctionsAnna Bernasconi. 253-263
- On Sets with Easy Certificates and the Existence of One-Way PermutationsLane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung. 264-275
- Isomorphism for Graphs of Bounded Distance WidthKoichi Yamazaki, Hans Leo Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos. 276-287
- Hardness of Approximating Problems on Cubic GraphsPaola Alimonti, Viggo Kann. 288-298
- Tree Contractions and Evolutionary TreesMing-Yang Kao. 299-310