Algorithm theory -- SWAT 2000. 7th Scandinavian workshop, Bergen, Norway, July 5--7, 2000. Proceedings (Q1572744)

The articles of this volume will be reviewed individually. For the preceding workshop see [Zbl 0936.00042; Zbl 1499.68006]. Indexed articles: \textit{Thorup, Mikkel; Karger, David R.}, Dynamic graph algorithms with applications, 1-9 [Zbl 0966.68605] \textit{Feige, Uriel}, Coping with the NP-hardness of the graph bandwidth problem, 10-19 [Zbl 0966.68513] \textit{Ukkonen, Esko}, Toward complete genome data mining in computational biology, 20-21 [Zbl 0966.68512] \textit{Pagh, Rasmus}, A new trade-off for deterministic dictionaries, 22-31 [Zbl 0966.68507] \textit{Iacono, John}, Improved upper bounds for pairing heaps, 32-45 [Zbl 0966.68509] \textit{Alstrup, Stephen; Holm, Jacob; Thorup, Mikkel}, Maintaining center and median in dynamic trees, 46-56 [Zbl 0966.68510] \textit{Brodal, Gerth Stølting; Jacob, Riko}, Dynamic planar convex hull with optimal query time and \(O(\log n\cdot \log\log n)\) update time, 57-70 [Zbl 0966.68522] \textit{Aleksandrov, Lyudmil G.; Djidjev, Hristo N.}, A dynamic algorithm for maintaining graph partitions, 71-82 [Zbl 0966.68222] \textit{Bender, Michael A.; Sethia, Saurabh; Skiena, Steven}, Data structures for maintaining set partitions. (Extended abstract), 83-96 [Zbl 0966.68604] \textit{Alber, Jochen; Bodlaender, Hans L.; Fernau, Henning; Niedermeier, Rolf}, Fixed parameter algorithms for Planar Dominating Set and related problems, 97-110 [Zbl 0966.68224] \textit{Gupta, Arvind; Nishimura, Naomi; Proskurowski, Andrzej; Ragde, Prabhakar}, Embeddings of \(k\)-connected graphs of pathwidth \(k\), 111-124 [Zbl 0966.68223] \textit{Nishimura, Naomi; Ragde, Prabhakar; Thilikos, Dimitrios M.}, On graph powers for leaf-labeled trees, 125-138 [Zbl 0966.68225] \textit{Berry, Anne; Bordat, Jean-Paul; Heggernes, Pinar}, Recognizing weakly triangulated graphs by edge separability, 139-149 [Zbl 0966.68226] \textit{Kalyanasundaram, Bala; Noga, John; Pruhs, Kirk; Woeginger, Gerhard}, Caching for Web searching, 150-163 [Zbl 0966.68557] \textit{Azar, Yossi; Epstein, Leah}, On-line scheduling with precedence constraints, 164-174 [Zbl 0966.68502] \textit{Liberatore, Vincenzo}, Scheduling jobs before shut-down, 175-188 [Zbl 0966.68504] \textit{Azar, Yossi; Epstein, Leah; van Stee, Rob}, Resource augmentation in load balancing, 189-199 [Zbl 0966.68503] \textit{Azar, Yossi; Boyar, Joan; Favrholdt, Lene M.; Larsen, Kim S.; Nielsen, Morten N.}, Fair versus unrestricted bin packing, 200-213 [Zbl 0966.68608] \textit{Berman, Piotr}, A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs, 214-219 [Zbl 0966.68609] \textit{Peleg, David}, Approximation algorithms for the \(\text{Label-Cover}_{\text{MAX}}\) and Red-Blue Set Cover problems, 220-230 [Zbl 0966.68613] \textit{Hassin, Refael; Rubinstein, Shlomi}, Approximation algorithms for maximum linear arrangement, 231-236 [Zbl 0966.68611] \textit{Doddi, Srinivas R.; Marathe, Madhav V.; Ravi, S. S.; Taylor, David Scot; Widmayer, Peter}, Approximation algorithms for clustering to minimize the sum of diameters, 237-250 [Zbl 0966.68610] \textit{Hassin, Refael; Rubinstein, Shlomi}, Robust matchings and maximum clustering, 251-258 [Zbl 0966.68612] \textit{Irving, Robert W.; Manlove, David F.; Scott, Sandy}, The hospitals/residents problem with ties, 259-271 [Zbl 0966.91500] \textit{Dinitz, Yefim; Nossenson, Ronit}, Incremental maintenance of the 5-edge-connectivity classes of a graph, 272-285 [Zbl 0966.68005] \textit{Ishii, Toshimasa; Nagamochi, Hiroshi}, On the minimum augmentation of an \(\ell\)-connected graph to a \(k\)-connected graph, 286-299 [Zbl 0966.68006] \textit{Arata, Kouji; Iwata, Satoru; Makino, Kazuhisa; Fujishige, Satoru}, Locating sources to meet flow demands in undirected networks, 300-313 [Zbl 0966.90500] \textit{Gudmundsson, Joachim; Levcopoulos, Christos; Narasimhan, Giri}, Improved greedy algorithms for constructing sparse geometric spanners, 314-327 [Zbl 0966.68501] \textit{Agarwal, Pankaj K.; Guibas, Leonidas J.; Har-Peled, Sariel; Rabinovitch, Alexander; Sharir, Micha}, Computing the penetration depth of two convex polytopes in 3D, 328-338 [Zbl 0966.68520] \textit{Guibas, Leonidas J.; Snoeyink, Jack; Zhang, Li}, Compact Voronoi diagrams for moving convex polygons, 339-352 [Zbl 0966.68519] \textit{Arya, Sunil; Cheng, Siu-Wing; Mount, David M.; Ramesh, H.}, Efficient expected-case algorithms for planar point location, 353-366 [Zbl 0966.68521] \textit{Palios, Leonidas}, A new competitive strategy for reaching the kernel of an unknown polygon, 367-382 [Zbl 0966.68518] \textit{Kao, Ming-Yang; Samet, Jared; Sung, Wing-Kin}, The enhanced double digest problem for DNA physical mapping, 383-392 [Zbl 0966.92500] \textit{Shibuya, Tetsuo}, Generalization of a suffix tree for RNA structural pattern matching, 393-406 [Zbl 0966.68508] \textit{Rick, Claus}, Efficient computation of all longest common subsequences, 407-418 [Zbl 0966.68606] \textit{Venkataraman, Gayathri; Sahni, Sartaj; Mukhopadhyaya, Srabani}, A blocked all-pairs shortest-paths algorithm, 419-432 [Zbl 0966.68550] \textit{Arge, Lars; Brodal, Gerth Stølting; Toma, Laura}, On external-memory MST, SSSP, and multi-way planar graph separation, 433-447 [Zbl 0966.68607] \textit{Arge, Lars; Pagter, Jakob}, I/O-space trade-offs. (Extended abstract), 448-461 [Zbl 0966.68570] \textit{Suri, Subhash; Sandholm, Tuomas; Warkhede, Priyank Ramesh}, Optimal flow aggregation, 462-475 [Zbl 0966.68573] \textit{Asano, Tetsuo; Matsui, Tomomi; Tokuyama, Takeshi}, On the complexities of the optimal rounding problems of sequences and matrices, 476-489 [Zbl 0966.65122] \textit{Ahal, Shlomo; Rabinovich, Yuri}, On the complexity of the sub-permutation problem, 490-503 [Zbl 0966.68080] \textit{Damaschke, Peter}, Parallel attribute-efficient learning of monotone Boolean functions, 504-512 [Zbl 0966.68085] \textit{Makino, Kazuhisa; Yamashita, Masafumi; Kameda, Tiko}, Max- and min-neighborhood monopolies, 513-526 [Zbl 0966.05075] \textit{Björklund, Andreas}, Optimal adaptive fault diagnosis of hypercubes, 527-534 [Zbl 0966.68572] \textit{Stachowiak, Grzegorz}, Fibonacci correction networks, 535-548 [Zbl 0966.68059] \textit{Cicalese, Ferdinando; Mundici, Daniele; Vaccaro, Ugo}, Least adaptive optimal search with unreliable tests, 549-562 [Zbl 0966.68060]