Algorithms -- ESA 2004. 12th annual European symposium, Bergen, Norway, September 14--17, 2004. Proceedings. (Q1774487)

The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 1024.00048). Indexed articles: \textit{Fellows, Michael R.}, A survey of FPT algorithm design techniques with an emphasis on recent advances and connections to practical computing, 1-2 [Zbl 1111.68764] \textit{Agarwal, Pankaj K.; Arge, Lars; Erickson, Jeff; Yu, Hai}, Efficient tradeoff schemes in data structures for querying moving objects, 4-15 [Zbl 1111.68402] \textit{Amir, Amihood; Eisenberg, Estrella; Porat, Ely}, Swap and mismatch edit distance, 16-27 [Zbl 1111.68790] \textit{Anshelevich, Elliot; Zhang, Lisa}, Path decomposition under a new cost measure with applications to optical network design, 28-39 [Zbl 1111.68304] \textit{Arge, Lars; Samoladas, Vasilis; Yi, Ke}, Optimal external memory planar point enclosure, 40-52 [Zbl 1111.68403] \textit{Azar, Yossi; Litichevskey, Arik}, Maximizing throughput in multi-queue switches, 53-64 [Zbl 1111.68357] \textit{Azar, Yossi; Richter, Yossi}, An improved algorithm for CIOQ switches, 65-76 [Zbl 1110.68309] \textit{Bansal, Vikas; Meyer auf der Heide, Friedhelm; Sohler, Christian}, Labeling smart dust, 77-88 [Zbl 1110.68386] \textit{Bartal, Yair}, Graph decomposition lemmas and their role in metric embedding methods, 89-97 [Zbl 1111.68555] \textit{Becchetti, Luca}, Modeling locality: A probabilistic analysis of LRU and FWF, 98-109 [Zbl 1111.68791] \textit{Bhargava, Ankur; Kosaraju, S. Rao}, An algorithm for computing DNA walks, 110-121 [Zbl 1111.68657] \textit{Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir}, Algorithms for generating minimal blockers of perfect matchings in bipartite graphs and related problems, 122-133 [Zbl 1111.05303] \textit{Busch, Costas; Magdon-Ismail, Malik; Mavronicolas, Marios; Spirakis, Paul}, Direct routing: Algorithms and complexity, 134-145 [Zbl 1111.68358] \textit{Carroll, Douglas E.; Goel, Ashish}, Lower bounds for embedding into distributions over excluded minor graph families, 146-156 [Zbl 1111.68457] \textit{Chan, Hubert}, A parameterized algorithm for upward planarity testing, 157-168 [Zbl 1111.68563] \textit{Chen, Ning; Deng, Xiaotie; Sun, Xiaoming; Yao, Andrew Chi-Chih}, Fisher equilibrium price with a class of concave utility functions, 169-179 [Zbl 1111.91314] \textit{Cheriyan, Joseph; Salavatipour, Mohammad R.}, Hardness and approximation results for packing Steiner trees, 180-191 [Zbl 1111.68781] \textit{Chlebík, Miroslav; Chlebíková, Janka}, Approximation hardness of dominating set problems, 192-203 [Zbl 1111.68782] \textit{Chrobak, Marek; Jawor, Wojciech; Sgall, Jiří; Tichý, Tomáš}, Improved online algorithms for buffer management in QoS switches, 204-215 [Zbl 1111.68792] \textit{Cohen, Rami; Rawitz, Dror; Raz, Danny}, Time dependent multi scheduling of multicast, 216-227 [Zbl 1111.68359] \textit{Cohen, Reuven; Peleg, David}, Convergence properties of the gravitational algorithm in asynchronous robot systems, 228-239 [Zbl 1111.68707] \textit{Cole, Richard; Kandathil, David C.}, The average case analysis of partition sorts, 240-251 [Zbl 1111.68411] \textit{Czygrinow, Andrzej; Hańćkowiak, Michał; Szymańska, Edyta}, A fast distributed algorithm for approximating the maximum matching, 252-263 [Zbl 1111.68779] \textit{Damerow, Valentina; Sohler, Christian}, Extreme points under random noise, 264-274 [Zbl 1111.68722] \textit{Díaz, Josep; Serna, Maria; Thilikos, Dimitrios M.}, Fixed parameter algorithms for counting and deciding bounded restrictive list \(H\)-colorings, 275-286 [Zbl 1111.68569] \textit{Epstein, Leah; van Stee, Rob}, On variable-sized multidimensional packing, 287-298 [Zbl 1111.68793] \textit{Fekete, Zsolt; Jordán, Tibor; Whiteley, Walter}, An inductive construction for plane Laman graphs via vertex splitting, 299-310 [Zbl 1110.68423] \textit{Fellows, Michael R.; Knauer, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Stege, U.; Thilikos, Dimitrios M.; Whitesides, S.}, Faster fixed-parameter tractable algorithms for matching and packing problems, 311-322 [Zbl 1111.68794] \textit{Fischer, Simon; Vöcking, Berthold}, On the evolution of selfish routing, 323-334 [Zbl 1111.68312] \textit{Fleischer, Rudolf; Kamphans, Tom; Klein, Rolf; Langetepe, Elmar; Trippen, Gerhard}, Competitive online approximation of the optimal search ratio, 335-346 [Zbl 1111.68659] \textit{Fotakis, Dimitris}, Incremental algorithms for facility location and \(k\)-median, 347-358 [Zbl 1097.68669] \textit{Gagie, Travis}, Dynamic Shannon coding, 359-370 [Zbl 1111.94327] \textit{Garg, Naveen; Khandekar, Rohit}, Fractional covering with upper bounds on the variables: Solving LPs with negative entries, 371-382 [Zbl 1111.90347] \textit{Gonen, Rica}, Negotiation-range mechanisms: Coalition-resistant markets, 383-394 [Zbl 1111.91317] \textit{Hassin, Refael; Levin, Asaf}, Approximation algorithms for quickest spanning tree problems, 395-402 [Zbl 1111.68783] \textit{Hassin, Refael; Rubinstein, Shlomi}, An approximation algorithm for maximum triangle packing, 403-413 [Zbl 1111.68784] \textit{Hazay, Carmit; Lewenstein, Moshe; Sokol, Dina}, Approximate parameterized matching, 414-425 [Zbl 1111.68795] \textit{Kovaleva, Sofia; Spieksma, Frits C. R.}, Approximation of rectangle stabbing and interval stabbing problems, 426-435 [Zbl 1110.68549] \textit{Kowalik, Łukasz}, Fast 3-coloring triangle-free planar graphs, 436-447 [Zbl 1111.68589] \textit{van Kreveld, Marc; van der Stappen, A. Frank}, Approximate unions of lines and Minkowski sums, 448-459 [Zbl 1111.68730] \textit{Kuhn, Fabian; Moscibroda, Thomas; Wattenhofer, Roger}, Radio network clustering from scratch, 460-471 [Zbl 1111.68320] \textit{Kulkarni, Raghav; Mahajan, Meena}, Seeking a vertex of the planar matching polytope in NC, 472-483 [Zbl 1111.68590] \textit{Lee, Jae-Ha; Park, Sang-Min; Chwa, Kyung-Yong}, Equivalence of search capability among mobile guards with various visibilities, 484-495 [Zbl 1111.68726] \textit{Liu, Junning; Adler, Micah}, Load balancing in hypercubic distributed hash tables with heterogeneous processors, 496-507 [Zbl 1111.68322] \textit{Malhotra, Varun S.}, On the stability of multiple partner stable marriages with ties, 508-519 [Zbl 1111.05305] \textit{Martens, Maren; Skutella, Martin}, Flows on few paths: Algorithms and lower bounds, 520-531 [Zbl 1111.68786] \textit{Mucha, Marcin; Sankowski, Piotr}, Maximum matchings in planar graphs via Gaussian elimination, 532-543 [Zbl 1111.05304] \textit{Nüsken, Michael; Ziegler, Martin}, Fast multipoint evaluation of bivariate polynomials, 544-555 [Zbl 1111.68789] \textit{Pagh, Anna; Pagh, Rasmus; Thorup, Mikkel}, On adaptive integer sorting, 556-567 [Zbl 1111.68413] \textit{Rémila, Eric}, Tiling a polygon with two kinds of rectangles, 568-579 [Zbl 1111.52301] \textit{Roditty, Liam; Zwick, Uri}, On dynamic shortest paths problems, 580-591 [Zbl 1111.68599] \textit{Ružić, Milan}, Uniform algorithms for deterministic construction of efficient dictionaries, 592-603 [Zbl 1111.68408] \textit{Yuster, Raphael; Zwick, Uri}, Fast sparse matrix multiplication, 604-615 [Zbl 1111.65301] \textit{Beier, Rene; Vöcking, Berthold}, An experimental study of random knapsack problems, 616-627 [Zbl 1111.90355] \textit{Bodlaender, Hans L.; Koster, Arie M. C. A.; Wolle, Thomas}, Contraction and treewidth lower bounds, 628-639 [Zbl 1111.68558] \textit{Elsässer, Robert; Monien, Burkhard; Schamberger, Stefan}, Load balancing of indivisible unit size tokens in dynamic and heterogeneous networks, 640-651 [Zbl 1111.68360] \textit{Emiris, Ioannis Z.; Tsigaridas, Elias P.}, Comparing real algebraic numbers of small degree, 652-663 [Zbl 1111.68788] \textit{Fogel, Efi; Wein, Ron; Halperin, Dan}, Code flexibility and program efficiency by genericity: Improving Cgal's arrangements, 664-676 [Zbl 1111.68723] \textit{Georgiadis, Loukas; Werneck, Renato F.; Tarjan, Robert E.; Triantafyllis, Spyridon; August, David I.}, Finding dominators in practice, 677-688 [Zbl 1111.68769] \textit{Golubchik, Leana; Khuller, Samir; Kim, Yoo-Ah; Shargorodskaya, Svetlana; Wan, Yung-Chun (Justin)}, Data migration on parallel disks, 689-701 [Zbl 1111.68431] \textit{Kettner, Lutz; Mehlhorn, Kurt; Pion, Sylvain; Schirra, Stefan; Yap, Chee}, Classroom examples of robustness problems in geometric computations, 702-713 [Zbl 1111.68725] \textit{Kim, Pok-Son; Kutzner, Arne}, Stable minimum storage merging by symmetric comparisons, 714-723 [Zbl 1111.68771] \textit{van Kreveld, Marc; Speckmann, Bettina}, On rectangular cartograms, 724-735 [Zbl 1111.68775] \textit{Larsson, Andreas; Gidenstam, Anders; Ha, Phuong H.; Papatriantafilou, Marina; Tsigas, Philippas}, Multi-word atomic read/write registers on multiprocessor systems, 736-748 [Zbl 1111.68371] \textit{Lorenz, Ulf}, Beyond optimal play in two-person-zerosum games, 749-759 [Zbl 1111.68412] \textit{Mecke, Steffen; Wagner, Dorothea}, Solving geometric covering problems by data reduction, 760-771 [Zbl 1111.68728] \textit{Pellegrini, Marco; Fusco, Giordano}, Efficient IP table lookup via adaptive stratified trees with selective reconstructions, 772-783 [Zbl 1111.68333] \textit{Sanders, Peter; Winkel, Sebastian}, Super scalar sample sort, 784-796 [Zbl 1111.68414] \textit{Sigurd, Mikkel; Zachariasen, Martin}, Construction of minimum-weight spanners, 797-808 [Zbl 1111.68600] \textit{Tănase, Mirela; Veltkamp, Remco C.}, A straight skeleton approximating the medial axis, 809-821 [Zbl 1111.68729] \textit{Tsaggouris, George; Zaroliagis, Christos}, Non-additive shortest paths, 822-834 [Zbl 1111.90365]