Algorithms - ESA 2000. 8th annual European symposium, Saarbrücken, Germany, September 5--8, 2000. Proceedings (Q1582970)

The articles of mathematical interest will be reviewed individually. The preceding symposium (7th, 1999) has been reviewed (see Zbl 0918.00032). Indexed articles: \textit{Henzinger, Monika}, Web information retrieval -- an algorithmic perspective, 1-8 [Zbl 0974.68570] \textit{Lengauer, Thomas}, Computational biology -- algorithms and more, 9-19 [Zbl 0974.68549] \textit{Agarwal, Pankaj K.; Flato, Eyal; Halperin, Dan}, Polygon decomposition for efficient construction of Minkowski sums, 20-31 [Zbl 0974.68214] \textit{Ageev, Alexander A.; Sviridenko, Maxim I.}, An approximation algorithm for Hypergraph Max \(k\)-Cut with given sizes of parts, 32-41 [Zbl 0974.68248] \textit{Ambühl, Christoph}, Offline list update is NP-hard, 42-51 [Zbl 0974.68069] \textit{Ambühl, Christoph; Chakraborty, Samarjit; Gärtner, Bernd}, Computing largest common point sets under approximate congruence, 52-63 [Zbl 0974.68068] \textit{Andrews, Matthew; Munagala, Kamesh}, Online algorithms for caching multimedia streams, 64-75 [Zbl 0974.68560] \textit{Barrière, Lali; Fraigniaud, Pierre; Gavoille, Cyril; Mans, Bernard; Robson, John M.}, On recognizing Cayley graphs, 76-87 [Zbl 0974.05077] \textit{Benczúr, András A.; Fülöp, Ottilia}, Fast algorithms for even/odd minimum cuts and generalizations, 88-99 [Zbl 0974.90021] \textit{Bespamyatnikh, B.; Bhattacharya, B.; Keil, J. Mark; Kirkpatrick, D.; Segal, M.}, Efficient algorithms for centers and medians in interval and circular-arc graphs, 100-111 [Zbl 0974.90027] \textit{Brass, Peter}, Exact point pattern matching and the number of congruent triangles in a three-dimensional point set, 112-119 [Zbl 0974.68543] \textit{Buchsbaum, Adam L.; Goodrich, Michael T.; Westbrook, Jeffery R.}, Range searching over tree cross products, 120-131 [Zbl 0974.68510] \textit{Carr, Robert; Fujito, Toshihiro; Konjevod, Goran; Parekh, Ojas}, A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem, 132-142 [Zbl 0974.68249] \textit{Clementi, A. E. F.; Ferreira, A.; Penna, P.; Perennes, S.; Silvestri, R.}, The minimum range assignment problem on linear ratio networks. (Extended abstract), 143-154 [Zbl 0974.90504] \textit{Czumaj, Artur; Sohler, Christian; Ziegler, Martin}, Property testing in computational geometry. (Extended abstract), 155-166 [Zbl 0974.68542] \textit{de Berg, Mark; Gudmundsson, Joachim; Hammar, Mikael; Overmars, Mark}, On R-trees with low stabbing number, 167-178 [Zbl 0974.68541] \textit{Dickerson, Matthew; Duncan, Christian A.; Goodrich, Michael T.}, K-D trees are better when cut on the longest side, 179-190 [Zbl 0974.68508] \textit{Flammini, Michele; Nicosia, Gaia}, On multicriteria online problems, 191-201 [Zbl 0974.68243] \textit{Fleischer, Rudolf; Wahl, Michaela}, Online scheduling revisited, 202-210 [Zbl 0974.68020] \textit{Gaur, Daya Ram; Ibaraki, Toshihide; Krishnamurti, Ramesh}, Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem, 211-219 [Zbl 0974.68216] \textit{Govindarajan, Sathish; Lukovszki, Tamás; Maheshwari, Anil; Zeh, Norbert}, I/O-efficient well-separated pair decomposition and its applications. (Extended abstract), 220-231 [Zbl 0974.68574] \textit{Gudmundsson, Joachim; Hammar, Mikael; van Kreveld, Marc}, Higher order Delaunay triangulations, 232-243 [Zbl 0974.68213] \textit{Guruswami, Venkatesan; Sudan, Madhu}, On representations of algebraic-geometric codes for list decoding, 244-255 [Zbl 0974.94030] \textit{Hochbaum, Dorit S.; Queyranne, Maurice}, Minimizing a convex cost closure set, 256-267 [Zbl 0974.90016] \textit{Hoogeveen, Han; Skutella, Martin; Woeginger, Gerhard J.}, Preemptive scheduling with rejection. (Extended abstract), 268-277 [Zbl 0974.68503] \textit{Hsu, Tsan-sheng}, Simpler and faster vertex connectivity augmentation algorithms. (Extended abstract), 278-289 [Zbl 0974.68573] \textit{Kalyanasundaram, Bala; Pruhs, Kirk; Velauthapillai, Mahe}, Scheduling broadcasts in wireless networks, 290-301 [Zbl 0974.90503] \textit{Koga, Hisashi}, Jitter regulation in an Internet router with delay consideration, 302-313 [Zbl 0974.68545] \textit{Lee, Jae-Ha; Cheong, Otfried; Kwon, Woo-Cheol; Shin, Sung Yong; Chwa, Kyung-Yong}, Approximation of curvature-constrained shortest paths through a sequence of points, 314-325 [Zbl 0974.68217] \textit{Mehlhorn, Kurt; Ziegelmann, Mark}, Resource constrained shortest paths, 326-337 [Zbl 0974.68215] \textit{Munro, J. Ian}, On the competitiveness of linear search, 338-345 [Zbl 0974.68536] \textit{Nardelli, Enrico; Proietti, Guido; Widmayer, Peter}, Maintaining a minimum spanning tree under transient node failures, 346-355 [Zbl 0974.68143] \textit{Pizzonia, Maurizio; Tamassia, Roberto}, Minimum depth graph embedding, 356-367 [Zbl 0974.05076] \textit{Qin, Zhongping; Wolff, Alexander; Xu, Yinfeng; Zhu, Binhai}, New algorithms for two-label point labeling, 368-379 [Zbl 0974.68575] \textit{Rahman, Naila; Raman, Rajeev}, Analysing the cache behaviour of non-uniform distribution sorting algorithms, 380-391 [Zbl 0974.68509] \textit{Sanders, Peter; Solis-Oba, Roberto}, How helpers hasten \(h\)-relations, 392-402 [Zbl 0974.68502] \textit{Skodinis, Konstantin}, Computing optimal linear layouts of trees in linear time, 403-414 [Zbl 0974.68540] \textit{Subramanian, C. R.}, Coloring sparse random graphs in polynomial average time, 415-426 [Zbl 0974.05075] \textit{van den Akker, Marjan; Hoogeveen, Han; Vakhania, Nodari}, Restarts can help in the on-line minimization of the maximum delivery time on a single machine, 427-436 [Zbl 0974.68504] \textit{Zhou, Yunhong; Suri, Subhash}, Collision detection using bounding boxes: Convexity helps, 437-448 [Zbl 0974.68539]