Abstract is missing.
- On Salesmen, Repairmen, Spiders, and Other Traveling AgentsGiorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela. 1-16 [doi]
- Computing a Diameter-Constrained Minimum Spanning Tree in ParallelNarsingh Deo, Ayman Abdalla. 17-31 [doi]
- Algorithms for a Simple Point Placement ProblemJoshua Redstone, Walter L. Ruzzo. 32-43 [doi]
- Duality in ATM Layout ProblemsShmuel Zaks. 44-58 [doi]
- The Independence Number of Random Interval GraphsWenceslas Fernandez de la Vega. 59-62 [doi]
- Online Strategies for BackupsPeter Damaschke. 63-71 [doi]
- Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman ProblemHans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger. 72-86 [doi]
- Semantical Counting CircuitsFabrice Noilhan, Miklos Santha. 87-101 [doi]
- The Hardness of Placing Street Names in a Manhattan Type MapSebastian Seibert, Walter Unger. 102-112 [doi]
- Labeling DowntownGabriele Neyer, Frank Wagner. 113-124 [doi]
- The Online Dial-a-Ride Problem under Reasonable LoadDietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau. 125-136 [doi]
- The Online-TSP against Fair AdversariesMichiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie. 137-149 [doi]
- QuickHeapsort, an Efficient Mix of Classical Sorting AlgorithmsDomenico Cantone, Gianluca Cincotti. 150-162 [doi]
- Triangulations without Minimum-Weight DrawingCao An Wang, Francis Y. L. Chin, Bo-Ting Yang. 163-173 [doi]
- Faster Exact Solutions for MAX2SATJens Gramm, Rolf Niedermeier. 174-186 [doi]
- Dynamically Maintaining the Widest k -Dense CorridorSubhas C. Nandy, Tomohiro Harayama, Tetsuo Asano. 187-198 [doi]
- Reconstruction of Discrete Sets from Three or More X-RaysElena Barcucci, Sara Brunetti, Alberto Del Lungo, Maurice Nivat. 199-210 [doi]
- Modified Binary Searching for Static TablesDonatella Merlini, Renzo Sprugnoli, M. Cecilia Verri. 211-225 [doi]
- An Efficient Algorithm for the Approximate Median Selection ProblemSebastiano Battiato, Domenico Cantone, Dario Catalano, Gianluca Cincotti, Micha Hofri. 226-238 [doi]
- Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space ClassesEmanuele Covino, Giovanni Pani, Salvatore Caporaso. 239-252 [doi]
- Group Updates for Red-Black TreesSabine Hanke, Eljas Soisalon-Soininen. 253-262 [doi]
- Approximating SVP::infty:: to within Almost-Polynomial Factors Is NP-HardIrit Dinur. 263-276 [doi]
- Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling ProblemsKathleen Steinhöfel, Andreas Alexander Albrecht, Chak-Kuen Wong. 277-290 [doi]
- On the Lovász Number of Certain Circulant GraphsValentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Mauro Leoncini. 291-305 [doi]
- Speeding Up Pattern Matching by Text CompressionYusuke Shibata, Takuya Kida, Shuichi Fukamachi, Masayuki Takeda, Ayumi Shinohara, Takeshi Shinohara, Setsuo Arikawa. 306-315 [doi]