Algorithm theory - SWAT 2002. 8th Scandinavian workshop, Turku, Finland, July 3--5, 2002. Proceedings (Q1611722)

The articles of mathematical interest will be reviewed individually. The preceding workshop (7th, 2000) has been reviewed (see Zbl 0941.00039). Indexed articles: \textit{Hagerup, Torben; Raman, Rajeev}, An efficient quasidictionary, 1-18 [Zbl 1078.68615] \textit{Mannila, Heikki}, Combining pattern discovery and probabilistic modeling in data mining, 19 [Zbl 1078.68624] \textit{Alstrup, Stephen; Brodal, Gerth Stølting; Li Gørtz, Inge; Rauhe, Theis}, Time and space efficient multi-method dispatching, 20-29 [Zbl 1078.68614] \textit{Augustine, John E.; Seiden, Steven S.}, Linear time approximation schemes for vehicle scheduling, 30-39 [Zbl 1078.90060] \textit{Hepner, Clint; Stein, Cliff}, Minimizing makespan for the lazy bureaucrat problem, 40-50 [Zbl 1078.90530] \textit{Mastrolilli, Monaldo}, A PTAS for the single machine scheduling problem with controllable processing times, 51-59 [Zbl 1078.90531] \textit{Eidenbenz, Stephan}, Optimum inapproximability results for finding minimum hidden guard sets in polygons and terrains, 60-68 [Zbl 1078.68799] \textit{Goswami, Partha P.; Das, Sandip; Nandy, Subhas C.}, Simplex range searching and \(k\) nearest neighbors of a line segment in 2D, 69-79 [Zbl 1078.68801] \textit{Levcopoulos, Christos; Lingas, Andrzej; Mitchell, Joseph S. B.}, Adaptive algorithms for constructing convex hulls and triangulations of polygonal chains, 80-89 [Zbl 1078.68803] \textit{Lev-Tov, Nissan; Peleg, David}, Exact algorithms and approximation schemes for base station placement problems, 90-99 [Zbl 1078.68802] \textit{Qin, Zhongping; Zhu, Binhai}, A factor-2 approximation for labeling points with maximum sliding labels, 100-109 [Zbl 1078.68829] \textit{Roy, Sasanka; Goswami, Partha P.; Das, Sandip; Nandy, Subhas C.}, Optimal algorithm for a special point-labeling problem, 110-120 [Zbl 1078.68830] \textit{Sanders, Peter; Vöcking, Berthold}, Random arc allocation and applications, 121-130 [Zbl 1078.68808] \textit{Sharir, Micha; Smorodinsky, Shakhar}, On neighbors in geometric permutations, 131-139 [Zbl 1078.68809] \textit{Agnarsson, Geir; Damaschke, Peter; Halldórsson, Magnús M.}, Powers of geometric intersection graphs and dispersion algorithms, 140-149 [Zbl 1078.68669] \textit{Alber, Jochen; Fellows, Michael R.; Niedermeier, Rolf}, Efficient data reduction for DOMINATING SET: A linear problem kernel for the planar case, 150-159 [Zbl 1078.68638] \textit{Broersma, Hajo; Fomin, Fedor V.; Kratochvíl, Jan; Woeginger, Gerhard J.}, Planar graph coloring with forbidden subgraphs: Why trees and paths are dangerous, 160-169 [Zbl 1078.68673] \textit{Chlebík, Miroslav; Chlebíková, Janka}, Approximation hardness of the Steiner tree problem on graphs, 170-179 [Zbl 1078.68637] \textit{Ellis, J.; Fan, H.; Fellows, Michael R.}, The dominating set problem is fixed parameter tractable for graphs of bounded genus, 180-189 [Zbl 1078.68639] \textit{Gabow, Harold N.; Pettie, Seth}, The dynamic vertex minimum problem and its application to clustering-type approximation algorithms, 190-199 [Zbl 1078.68827] \textit{Golynski, Alexander; Horton, Joseph D.}, A polynomial time algorithm to find the minimum cycle basis of a regular matroid, 200-209 [Zbl 1078.68833] \textit{Könemann, Jochen; Li, Yanjun; Parekh, Ojas; Sinha, Amitabh}, Approximation algorithms for edge-dilation \(k\)-center problems, 210-219 [Zbl 1078.68828] \textit{Ramnath, Sarnath}, Forewarned is fore-armed: Dynamic digraph connectivity with lookahead speeds up a static clustering algorithm, 220-229 [Zbl 1078.68677] \textit{Shamir, Ron; Tsur, Dekel}, Improved algorithms for the random cluster graph model, 230-239 [Zbl 1078.68678] \textit{Skulrattanakulchai, San}, \(\Delta\)-list vertex coloring in linear time, 240-248 [Zbl 1078.05529] \textit{Demaine, Erik D.; López-Ortiz, Alejandro; Munro, J. Ian}, Robot localization without depth perception, 249-259 [Zbl 1078.68786] \textit{López-Ortiz, Alejandro; Schuierer, Sven}, Online parallel heuristics and robot searching under the competitive framework, 260-269 [Zbl 1078.68755] \textit{Sztainberg, Marcelo O.; Arkin, Esther M.; Bender, Michael A.; Mitchell, Joseph S. B.}, Analysis of heuristics for the freeze-tag problem, 270-279 [Zbl 1078.68762] \textit{Arkin, Esther M.; Hassin, Refael; Rubinstein, Shlomi; Sviridenko, Maxim}, Approximations for maximum transportation problem with permutable supply vector and other capacitated star packing problems, 280-287 [Zbl 1078.90511] \textit{Azar, Yossi; Epstein, Leah; Richter, Yossi; Woeginger, Gerhard J.}, All-norm approximation algorithms, 288-297 [Zbl 1078.90527] \textit{Bazgan, Cristina; Fernandez de la Vega, W.; Karpinski, Marek}, Approximability of dense instances of NEAREST CODEWORD problem, 298-307 [Zbl 1078.68826] \textit{Anand, R. Sai; Erlebach, Thomas; Hall, Alexander; Stefanakos, Stamatis}, Call control with \(k\) rejections, 308-317 [Zbl 1078.68533] \textit{Even, Guy; Kortsarz, Guy; Slany, Wolfgang}, On network design problems: Fixed cost flows and the covering Steiner problem, 318-327 [Zbl 1078.68536] \textit{Frederiksen, Jens S.; Larsen, Kim S.}, Packet bundling, 328-337 [Zbl 1078.68538] \textit{Puri, Anuj; Tripakis, Stavros}, Algorithms for the multi-constrained routing problem, 338-347 [Zbl 1078.68545] \textit{Kärkkäinen, Juha}, Computing the threshold for \(q\)-gram filters, 348-357 [Zbl 1078.68823] \textit{Pe'er, Itsik; Shamir, Ron; Sharan, Roded}, On the generality of phylogenies from incomplete directed characters, 358-367 [Zbl 1078.92503] \textit{Albert, M. H.; Atkinson, M. D.}, Sorting with a forklift, 368-377 [Zbl 1078.68618] \textit{Bodlaender, Hans L.; Fomin, Fedor V.}, Tree decompositions with small cost, 378-387 [Zbl 1078.68671] \textit{Bodlaender, Hans L.; Rotics, Udi}, Computing the treewidth and the minimum fill-in with the modular decomposition, 388-397 [Zbl 1078.68672] \textit{Katajainen, Jyrki; Madsen, Jeppe Nejsum}, Performance tuning an algorithm for compressing relational tables, 398-407 [Zbl 1078.68616] \textit{Katajainen, Jyrki; Pasanen, Tomi A.}, A randomized in-place algorithm for positioning the \(k\)th element in a multiset, 408-417 [Zbl 1078.68825] \textit{Lai, Tony W.}, Paging on a RAM with limited resources, 418-427 [Zbl 1078.68608] \textit{Dal Palú, A.; Pontelli, E.; Ranjan, D.}, An optimal algorithm for finding NCA on pure pointer machines, 428-438 [Zbl 1061.68588] \textit{Soisalon-Soininen, Eljas; Widmayer, Peter}, Amortized complexity of bulk updates in AVL-trees, 439-448 [Zbl 1078.68617]