Algorithms and data structures. 7th international workshop, WADS 2001, Providence, RI, USA, August 8--10, 2001. Proceedings (Q5943782)

The articles of mathematical interest will be reviewed individually. For the preceding workshop see [Zbl 1061.68501]. Indexed articles: \textit{Yannakakis, Mihalis}, Approximation of multiobjective optimization problems, 1 [Zbl 0997.68563] \textit{Hurtado, Ferran; Liotta, Giuseppe; Meijer, Henk}, Optimal, suboptimal, and robust algorithms for proximity graphs, 2-13 [Zbl 0997.68165] \textit{Bern, Marshall; Eppstein, David}, Optimal Möbius transformations for information visualization and meshing, 14-25 [Zbl 0997.68536] \textit{Long, Philip M.}, Using the pseudo-dimension to analyze approximation algorithms for integer programming, 26-37 [Zbl 1018.90027] \textit{Chakraborty, Samarjit; Erlebach, Thomas; Thiele, Lothar}, On the complexity of scheduling conditional real-time code, 38-49 [Zbl 0997.68507] \textit{Agarwal, Pankaj K.; Arge, Lars; Vahrenhold, Jan}, Time responsive external data structures for moving points, 50-61 [Zbl 0997.68522] \textit{Karavelas, Menelaos I.}, Voronoi diagrams for moving disks and applications, 62-74 [Zbl 0997.68539] \textit{Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.}, Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover, 75-86 [Zbl 0998.05060] \textit{Espelage, Wolfgang; Gurski, Frank; Wanke, Egon}, Deciding clique-width for graphs of bounded tree-width (extended abstract), 87-98 [Zbl 0997.68530] \textit{Koltun, Vladlen}, Complexity bounds for vertical decompositions of linear arrangements in four dimensions, 99-110 [Zbl 0997.68145] \textit{Bern, Marshall; Eppstein, David}, Optimization over zonotopes and training support vector machines, 111-121 [Zbl 0997.68142] \textit{Agarwal, Pankaj K.; de Berg, Mark; Har-Peled, Sariel; Overmars, Mark H.; Sharir, Micha}, Reporting intersecting pairs of polytopes in two and three dimensions, 122-134 [Zbl 0997.68144] \textit{Bagchi, Amitabha; Chaudhary, Amitabh; Garg, Rahul; Goodrich, Michael T.; Kumar, Vijay}, Seller-focused algorithms for online auctioning, 135-147 [Zbl 0997.68629] \textit{Cohen, Edith; Kaplan, Haim; Zwick, Uri}, Competitive analysis of the LRFU paging algorithm, 148-154 [Zbl 0997.68572] \textit{Blum, Avrim; Kalai, Adam; Kleinberg, Jon}, Admission control to minimize rejections, 155-164 [Zbl 0997.68558] \textit{Atallah, Mikhail J.; Du, Wenliang}, Secure multi-party computational geometry, 165-179 [Zbl 0997.68537] \textit{Bose, Prosenjit; Maheshwari, Anil; Morin, Pat; Morrison, Jason}, The grid placement problem, 180-191 [Zbl 0997.68538] \textit{Arkin, Esther M.; Fekete, Sándor P.; Hurtado, Ferran; Mitchell, Joseph S. B.; Noy, Marc}, On the reflexivity of point sets, 192-204 [Zbl 0997.68141] \textit{Hassin, Refael; Rubinstein, Shlomi}, A \({7\over 8}\)-approximation algorithm for metric max TSP, 205-209 [Zbl 1018.90040] \textit{Erlebach, Thomas; Kellerer, Hans; Pferschy, Ulrich}, Approximating multi-objective knapsack problems, 210-221 [Zbl 1018.90034] \textit{Brandes, Ulrik; Cornelsen, Sabine}, Visual ranking of link structures (extended abstract), 222-233 [Zbl 0997.68645] \textit{He, Xin}, A simple linear time algorithm for proper box rectangular drawings of plane graphs, 234-245 [Zbl 0997.68541] \textit{Kaplan, Haim; Milo, Tova}, Short and simple labels for small distances and other functions, 246-257 [Zbl 0997.68544] \textit{Björklund, Andreas; Lingas, Andrzej}, Fast Boolean matrix multiplication for highly clustered data, 258-263 [Zbl 0997.68753] \textit{Dumitrescu, Adrian; Pach, János}, Partitioning colored point sets into monochromatic parts, 264-275 [Zbl 0997.68143] \textit{Maneewongvatana, Songrit; Mount, David M.}, The analysis of a probabilistic approach to nearest neighbor searching, 276-286 [Zbl 0997.68521] \textit{Maheshwari, Anil; Smid, Michiel; Zeh, Norbert}, I/O-efficient shortest path queries in geometric spanners, 287-299 [Zbl 0997.68535] \textit{Fekete, Sándor P.; Köhler, Ekkehard; Teich, Jürgen}, Higher-dimensional packing with order constraints, 300-312 [Zbl 1018.90035] \textit{Menakerman, Nir; Rom, Raphael}, Bin packing with item fragmentation, 313-324 [Zbl 0997.68526] \textit{Dragan, Feodor F.; Kahng, Andrew B.; Măndoiu, Ion I.; Muddu, Sudhakar; Zelikovsky, Alexander}, Practical approximation algorithms for separable packing linear programs, 325-337 [Zbl 0997.68505] \textit{Leighton, F. Thomson}, The challenges of delivering content on the internet, 338 [Zbl 0997.68639] \textit{Didimo, Walter; Pizzonia, Maurizio}, Upward embeddings and orientations of undirected planar graphs, 339-351 [Zbl 0997.68531] \textit{Eiglsperger, Markus; Kaufmann, Michael}, An approach for mixed upward planarization, 352-364 [Zbl 0997.68528] \textit{Bader, David A.; Moret, Bernard M. E.; Yan, Mi}, A linear-time algorithm for computing inversion distance between signed permutations with an experimental study, 365-376 [Zbl 0997.68527] \textit{Chen, Zhi-Zhong; Jiang, Tao; Lin, Guo-Hui}, Computing phylogenetic roots with bounded degrees and errors (extended abstract), 377-388 [Zbl 0997.68529] \textit{Ilinkin, Ivaylo; Janardan, Ravi; Majhi, Jayanth; Schwerdt, Jörg; Smid, Michiel}, A decomposition-based approach to layered manufacturing, 389-400 [Zbl 0997.68548] \textit{Arkin, Esther M.; Bender, Michael A.; Demaine, Erik D.; Demaine, Martin L.; Mitchell, Joseph S. B.}, When can you fold a map?, 401-413 [Zbl 0997.68540] \textit{Fagerberg, Rolf; Jensen, Rune E.; Larsen, Kim S.}, Search trees with relaxed balance and near-optimal height, 414-425 [Zbl 0997.68519] \textit{Raman, Rajeev; Raman, Venkatesh; Rao, S. Srinivasa}, Succinct dynamic data structures, 426-437 [Zbl 0997.68520] \textit{Bhattacharya, Binay; Mukhopadhyay, Asish; Narasimhan, Giri}, Optimal algorithms for two-guard walkability of simple polygons, 438-449 [Zbl 1005.68558] \textit{Reif, John; Sun, Zheng}, Movement planning in the presence of flows, 450-461 [Zbl 0997.68534] \textit{Eppstein, David}, Small maximal independent sets and faster exact graph coloring, 462-470 [Zbl 0997.68087] \textit{Arge, Lars; Meyer, Ulrich; Toma, Laura; Zeh, Norbert}, On external-memory planar depth first search, 471-482 [Zbl 0997.68523]