Algorithms -- ESA '98. 6th annual European symposium, Venice, Italy, August 24--26, 1998. Proceedings (Q1264335)

The articles of mathematical interest will be reviewed individually. For the preceding symposium see [Zbl 1476.68010]. Indexed articles: \textit{Bradford, Phil; Golin, Mordecai J.; Larmore, Lawrence L.; Rytter, Wojciech}, Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property, 43-54 [Zbl 0933.94020] \textit{Nardelli, Enrico; Proietti, Guido; Widmayer, Peter}, Finding all the best swaps of a minimum diameter spanning tree under transient edge failures, 55-66 [Zbl 0932.68065] \textit{Baker, Brenda S.; Giancarlo, Raffaele}, Longest common subsequence from fragments via sparse dynamic programming, 79-90 [Zbl 0929.68073] \textit{Klein, Philip N.}, Computing the edit-distance between unrooted ordered trees, 91-102 [Zbl 0932.68066] \textit{Fellows, Michael; Hallett, Michael; Korostensky, Chantal; Stege, Ulrike}, Analogs and duals of the MAST problem for sequences and trees, 103-114 [Zbl 0929.68074] \textit{Cucker, Felipe; Smale, Steve}, Complexity estimates depending on condition and round-of error, 115-126 [Zbl 0929.65027] \textit{Rojas, J. Maurice}, Intrinsic near quadratic complexity bounds for real multivariate root counting, 127-138 [Zbl 0929.65028] \textit{Storjohann, Arne; Mulders, Thom}, Fast algorithms for linear algebra modulo \(N\), 139-150 [Zbl 0929.65019] \textit{Blömer, Johannes}, A probabilistic zero-test for expressions involving roots of rational numbers, 151-162 [Zbl 0929.65026] \textit{Kannan, Ravi; Nolte, Andreas}, A fast random greedy algorithm for the component commonality problem, 223-234 [Zbl 0929.90063] \textit{Kolman, Petr}, On nonblocking properties of Beneš network, 259-270 [Zbl 0983.94068] \textit{Frigioni, Daniele; Marchetti-Spaccamela, Alberto; Nanni, Umberto}, Fully dynamic shortest paths and negative cycles detection on digraphs with arbitrary arc weights, 320-331 [Zbl 0932.68067] \textit{Abello, James; Buchsbaum, Adam L.; Westbrook, Jeffery R.}, A functional approach to external graph algorithms, 332-343 [Zbl 0932.68068] \textit{Bouchitté, Vincent; Todinca, Ioan}, Minimal triangulations for graphs with ``few'' minimal separators, 344-355 [Zbl 0929.68095] \textit{Chen, Danny Z.; Daescu, Ovidiu; Hu, Xiaobo; Xu, Jinhui}, Finding an optimal path without growing the tree, 356-367 [Zbl 0926.68098] \textit{Irving, Robert W.}, Matching medical students to pairs of hospitals: A new variation on a well-known theme, 381-392 [Zbl 0929.90074] \textit{Meyer, Ulrich; Sanders, Peter}, \(\Delta\)-stepping: A parallel single source shortest path algorithm, 393-404 [Zbl 0932.68136] \textit{Diekmann, Ralf; Frommer, Andreas; Monien, Burkhard}, Nearest neighbor load balancing on graphs, 429-440 [Zbl 0927.90103] \textit{Solis-Oba, Roberto}, 2-approximation algorithm for finding a spanning tree with maximum number of leaves, 441-452 [Zbl 0932.68069] \textit{Helvig, C. S.; Robins, Gabriel; Zelikovsky, Alex}, Moving-target TSP and related problems, 453-464 [Zbl 0929.90087] \textit{Håstad, Johan; Ivansson, Lars; Lagergren, Jens}, Fitting points on the real line and its application to RH mapping, 465-476 [Zbl 0926.68058] \textit{Krivelevich, Michael; Sudakov, Benny}, Approximate coloring of uniform hypergraphs (extended abstract), 477-489 [Zbl 0928.05027] \textit{Sevastianov, S. V.; Tchernykh, I. D.}, Computer-aided way to prove theorems in scheduling, 502-513 [Zbl 0929.90040]