Algorithms -- ESA 2003. 11th annual European symposium, Budapest, Hungary, September 16--19, 2003. Proceedings (Q1413091)

The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 0997.00026). Indexed articles: \textit{Agarwal, Pankaj K.; Arge, Lars; Yang, Jun; Yi, Ke}, I/O-efficient structures for orthogonal range-max and stabbing-max queries, 7-18 [Zbl 1266.68094] \textit{Alicherry, Mansoor; Bhatia, Randeep}, Line system design and a generalized coloring problem, 19-30 [Zbl 1266.68141] \textit{Archer, Aaron; Rajagopalan, Ranjithkumar; Shmoys, David B.}, Lagrangian relaxation for the \(k\)-median problem: new insights and continuity properties, 31-42 [Zbl 1266.90117] \textit{Bansal, Nikhil; Blum, Avrim; Chawla, Shuchi; Dhamdhere, Kedar}, Scheduling for flow-time with admission control, 43-54 [Zbl 1266.68067] \textit{Bar-Yehuda, Reuven; Even, Guy; Shahar, Shimon (Moni)}, On approximating a geometric prize-collecting traveling salesman problem with time windows (extended abstract), 55-66 [Zbl 1266.90155] \textit{Becchetti, Luca; Leonardi, Stefano; Marchetti-Spaccamela, Alberto; Pruhs, Kirk}, Semi-clairvoyant scheduling, 67-77 [Zbl 1266.90088] \textit{Berg, Alex R.; Jordán, Tibor}, Algorithms for graph rigidity and scene analysis, 78-89 [Zbl 1266.05162] \textit{Biedl, Therese; Demaine, Erik D.; Golynski, Alexander; Horton, Joseph D.; López-Ortiz, Alejandro; Poirier, Guillaume; Quimper, Claude-Guy}, Optimal dynamic video-on-demand using adaptive broadcasting, 90-101 [Zbl 1266.90058] \textit{Blumrosen, Liad; Nisan, Noam; Segal, Ilya}, Multi-player and multi-round auctions with severely bounded communication, 102-113 [Zbl 1266.91031] \textit{Calinescu, Gruia; Kapoor, Sanjiv; Olshevsky, Alexander; Zelikovsky, Alexander}, Network lifetime and power assignment in ad hoc wireless networks, 114-126 [Zbl 1266.68022] \textit{Cheong, Otfried; Goaoc, Xavier; Na, Hyeon-Suk}, Disjoint unit spheres admit at most two line transversals, 127-135 [Zbl 1266.68188] \textit{Chung, Kai-min; Lu, Hsueh-I}, An optimal algorithm for the maximum-density segment problem, 136-147 [Zbl 1266.68235] \textit{Cormode, Graham; Muthukrishnan, S.}, Estimating dominance norms of multiple data streams, 148-160 [Zbl 1266.68093] \textit{Damerow, Valentina; Meyer auf der Heide, Friedhelm; Räcke, Harald; Scheideler, Christian; Sohler, Christian}, Smoothed motion complexity, 161-171 [Zbl 1266.68095] \textit{de Berg, Mark}, Kinetic dictionaries: how to shoot a moving target, 172-183 [Zbl 1266.68102] \textit{Dessmark, Anders; Fraigniaud, Pierre; Pelc, Andrzej}, Deterministic rendezvous in graphs, 184-195 [Zbl 1266.68143] \textit{Eisenbrand, Friedrich}, Fast integer programming in fixed dimension, 196-207 [Zbl 1266.90130] \textit{Emanuel, Dotan; Fiat, Amos}, Correlation clustering -- minimizing disagreements on arbitrary weighted graphs, 208-220 [Zbl 1266.68228] \textit{Fomin, Fedor V.; Thilikos, Dimtirios M.}, Dominating sets and local treewidth, 221-229 [Zbl 1266.05164] \textit{Funke, Stefan; Matijevic, Domagoj; Sanders, Peter}, Approximating energy efficient paths in wireless multi-hop networks, 230-241 [Zbl 1266.68023] \textit{Garg, Naveen; Khandekar, Rohit; Kunal, Keshav; Pandit, Vinayaka}, Bandwidth maximization in multicasting, 242-253 [Zbl 1266.68024] \textit{Gavoille, Cyril; Paul, Christophe}, Optimal distance labeling for interval and circular-arc graphs, 254-265 [Zbl 1266.05019] \textit{Halldórsson, Magnús M.; Iwama, Kazuo; Miyazaki, Shuichi; Yanagisawa, Hiroki}, Improved approximation of the stable marriage problem, 266-277 [Zbl 1266.05173] \textit{Har-Peled, Sariel; Mazumdar, Soham}, Fast algorithms for computing the smallest \(k\)-enclosing disc, 278-288 [Zbl 1266.68191] \textit{Hassin, Refael; Levin, Asaf}, The minimum generalized vertex cover problem, 289-300 [Zbl 1266.05117] \textit{Hofmeister, Thomas}, An approximation algorithm for MAX-2-SAT with cardinality constraint, 301-312 [Zbl 1266.68229] \textit{Kalyanasundaram, Bala; Velauthapillai, Mahe}, On-demand broadcasting under deadline, 313-324 [Zbl 1266.68072] \textit{Kaporis, Alexis; Makris, Christos; Sioutas, Spyros; Tsakalidis, Athanasios; Tsichlas, Kostas; Zaroliagis, Christos}, Improved bounds for finger search on a RAM, 325-336 [Zbl 1266.68098] \textit{Karavelas, Menelaos I.; Yvinec, Mariette}, The Voronoi diagram of planar convex objects, 337-348 [Zbl 1266.68192] \textit{Kesselman, Alex; Lotker, Zvi; Mansour, Yishay; Patt-Shamir, Boaz}, Buffer overflows of merging streams, 349-360 [Zbl 1266.68029] \textit{Kesselman, Alex; Mansour, Yishay; van Stee, Rob}, Improved competitive guarantees for QoS buffering, 361-372 [Zbl 1266.68030] \textit{Khuller, Samir; Kim, Yoo-Ah; Wan, Yung-Chun (Justin)}, On generalized gossiping and broadcasting (extended abstract), 373-384 [Zbl 1266.68032] \textit{Kortsarz, Guy; Shende, Sunil}, Approximating the achromatic number problem on bipartite graphs, 385-396 [Zbl 1266.68230] \textit{Kutyłowski, Mirosław; Rutkowski, Wojciech}, Adversary immune leader election in ad hoc radio networks, 397-408 [Zbl 1266.68033] \textit{Mahdian, Mohammad; Pál, Martin}, Universal facility location, 409-421 [Zbl 1266.90119] \textit{Malewicz, Grzegorz}, A method for creating near-optimal instances of a certified write-all algorithm (extended abstract), 422-433 [Zbl 1266.68202] \textit{Meyer, Ulrich; Zeh, Norbert}, I/O-efficient undirected shortest paths, 434-445 [Zbl 1266.68239] \textit{Safra, Shmuel; Schwartz, Oded}, On the complexity of approximating TSP with neighborhoods and related problems, 446-458 [Zbl 1266.90200] \textit{Sgall, Jií; Woeginger, Gerhard J.}, A lower bound for cake cutting, 459-469 [Zbl 1266.68120] \textit{Sharir, Micha; Shaul, Hayim}, Ray shooting and stone throwing, 470-481 [Zbl 1266.68193] \textit{Slivkins, Aleksandrs}, Parameterized tractability of edge-disjoint paths on directed acyclic graphs, 482-493 [Zbl 1266.68121] \textit{Tóth, Csaba D.}, Binary space partition for orthogonal fat rectangles, 494-505 [Zbl 1266.68194] \textit{Tsur, Dekel}, Sequencing by hybridization in few rounds, 506-516 [Zbl 1266.68238] \textit{Wang, Biing-Feng; Hsieh, Yong-Hsian; Yeh, Li-Pu}, Efficient algorithms for the ring loading problem with demand splitting, 517-526 [Zbl 1266.68034] \textit{Woeginger, Gerhard J.}, Seventeen lines and one-hundred-and-one points, 527-531 [Zbl 1266.68125] \textit{Wolpert, Nicola}, Jacobi curves: computing the exact topology of arrangements of non-singular algebraic curves, 532-543 [Zbl 1266.68195] \textit{Agarwal, Pankaj K.; Krishnan, Shankar; Mustafa, Nabil H.; Venkatasubramanian, Suresh}, Streaming geometric optimization using graphics hardware, 544-555 [Zbl 1266.68187] \textit{Boros, E.; Elbassioni, K.; Gurvich, V.; Khachiyan, Leonid}, An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals, 556-567 [Zbl 1266.68199] \textit{Chen, Zhi-Zhong; Jiang, Tao; Lin, Guohui; Rizzi, Romeo; Wen, Jianjun; Xu, Dong; Xu, Ying}, More reliable protein NMR peak assignment via improved 2-interval scheduling, 580-592 [Zbl 1266.68227] \textit{Di Gaspero, Luca; Gärtner, Johannes; Kortsarz, Guy; Musliu, Nysret; Schaerf, Andrea; Slany, Wolfgang}, The minimum shift design problem: theory and practice, 593-604 [Zbl 1266.68166] \textit{Durand, Marianne; Flajolet, Philippe}, LogLog counting of large cardinalities (extended abstract), 605-617 [Zbl 1266.68236] \textit{Eisenbrand, Friedrich; Funke, Stefan; Reichel, Joachim; Schömer, Elmar}, Packing a trunk, 618-629 [Zbl 1266.68189] \textit{Fischer, Kaspar; Gärtner, Bernd; Kutz, Martin}, Fast smallest-enclosing-ball computation in high dimensions, 630-641 [Zbl 1266.68190] \textit{Gramm, Jens; Guo, Jiong; Hüffner, Falk; Niedermeier, Rolf}, Automated generation of search tree algorithms for graph modification problems, 642-653 [Zbl 1266.68200] \textit{Granados, Miguel; Hachenberger, Peter; Hert, Susan; Kettner, Lutz; Mehlhorn, Kurt; Seel, Michael}, Boolean operations on 3D selective Nef complexes: data structure, algorithms, and implementation, 654-666 [Zbl 1266.68201] \textit{Grothklags, Sven}, Fleet assignment with connection dependent ground times, 667-678 [Zbl 1266.90105] \textit{Katriel, Irit; Sanders, Peter; Träff, Jesper Larsson}, A practical minimum spanning tree algorithm using the cycle property, 679-690 [Zbl 1266.68226] \textit{Klau, Gunnar W.; Ljubić, Ivana; Mutzel, Petra; Pferschy, Ulrich; Weiskircher, René}, The fractional prize-collecting Steiner tree problem on trees (extended abstract), 691-702 [Zbl 1266.90188] \textit{Liebchen, Christian}, Finding short integral cycle bases for cyclic timetabling, 715-726 [Zbl 1266.90106] \textit{Sankowski, Piotr}, Multisampling: a new approach to uniform sampling and approximate counting, 740-751 [Zbl 1266.62014] \textit{Sellmann, Meinolf; Sensen, Norbert; Timajev, Larissa}, Multicommodity flow approximation used for exact graph partitioning, 752-764 [Zbl 1266.68232] \textit{Tamaki, Hisao}, A linear time heuristic for the branch-decomposition of planar graphs, 765-775 [Zbl 1266.05169] \textit{Wagner, Dorothea; Willhalm, Thomas}, Geometric speed-up techniques for finding shortest paths in large sparse graphs, 776-787 [Zbl 1266.68234]