Algorithm theory -- SWAT '94. 4th Scandinavian workshop on algorithm theory, Aarhus, Denmark, July 6--8, 1994. Proceedings (Q1328409)

The articles of this volume will be reviewed individually. Selected papers of this workshop have been published within the journal ``Nord. J. Comput. 1, No. 4 (1994)''. For the preceding workshop see [Zbl 1499.68020]. Indexed articles: \textit{Agarwal, Pankaj K.; Katz, Matthew J.; Sharir, Micha}, Computing depth orders and related problems, 1-12 [Zbl 1502.68294] \textit{Agarwal, Pankaj K.; Sen, Sandeep}, Selection in monotone matrices and computing \(k\)\textsuperscript{th} nearest neighbors, 13-24 [Zbl 1502.68295] \textit{Albers, Susanne; Koga, Hisashi}, New on-line algorithms for the page replication problem, 25-36 [Zbl 1502.68372] \textit{Ausiello, Giorgio; Feuerstein, Esteban; Leonardi, Stefano; Stougie, Leen; Talamo, Maurizio}, Serving requests with on-line routing, 37-48 [Zbl 1502.68373] \textit{Becker, Peter}, A new algorithm for the construction of optimal B-trees, 49-60 [Zbl 1502.68083] \textit{de Berg, Mark; de Groot, Marko; Overmars, Mark}, New results on binary space partitions in the plane (extended abstract), 61-72 [Zbl 1502.68312] \textit{Berman, Piotr; Lingas, Andrzej}, A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon, 73-82 [Zbl 1502.68302] \textit{Biedl, Therese; Kant, Goos; Kaufmann, Michael}, On triangulating planar graphs under the four-connectivity constraint, 83-94 [Zbl 1502.68210] \textit{Czumaj, Artur; Gasieniec, Leszek; Piotrów, Marek; Rytter, Wojciech}, Parallel and sequential approximation of shortest superstrings, 95-106 [Zbl 1502.68369] \textit{Czyzowicz, Jurek; Everett, Hazel; Robert, Jean-Marc}, Separating translates in the plane: combinatorial bounds and an algorithm, 107-118 [Zbl 1502.68308] \textit{Das, Gautam; Heffernan, Paul J.; Narasimhan, Giri}, Finding all weakly-visible chords of a polygon in linear time (extended abstract), 119-130 [Zbl 1502.68310] \textit{Dietz, Paul F.; Seiferas, Joel I.; Zhang, Ju}, A tight lower bound for on-line monotonic list labeling, 131-142 [Zbl 1502.68095] \textit{Felsner, Stefan; Müller, Rudolf; Wernisch, Lorenz}, Trapezoid graphs and generalizations, geometry and algorithms, 143-154 [Zbl 1502.68223] \textit{Fernández-Baca, David; Slutzki, Giora}, Optimal parametric search on graphs of bounded tree-width, 155-166 [Zbl 1502.68108] \textit{Fredman, Michael L.}, Lower bounds for dynamic algorithms, 167-171 [Zbl 1502.68130] \textit{Gupta, Arvind; Nishimura, Naomi}, Sequential and parallel algorithms for embedding problems on classes of partial \(k\)-trees, 172-182 [Zbl 1502.68228] \textit{Gupta, Prosenjit; Janardan, Ravi; Smid, Michiel}, On intersection searching problems involving curved objects, 183-194 [Zbl 1502.68322] \textit{Halldórsson, Magnús M.; Radhakrishnan, Jaikumar}, Improved approximations of independent sets in bounded-degree graphs, 195-206 [Zbl 1502.68229] \textit{Higham, Lisa; Przytycka, Teresa}, Asymptotically optimal election on weighted rings, 207-218 [Zbl 1502.68364] \textit{Hromkovič, Juraj; Klasing, Ralf; Unger, Walter; Wagener, Hubert}, Optimal algorithms for broadcast and gossip in the edge-disjoint path modes (extended abstract), 219-230 [Zbl 1502.68232] \textit{Håstad, Johan}, Recent results in hardness of approximation, 231-239 [Zbl 1502.68131] \textit{Juurlink, Ben H. H.; Wijshoff, Harry A. G.}, The parallel hierarchical memory model, 240-251 [Zbl 1502.68118] \textit{Palios, Leonidas}, Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments, 255-266 [Zbl 1502.68338] \textit{Papatriantafilou, Marina; Tsigas, Philippas}, On self-stabilizing wait-free clock synchronization, 267-277 [Zbl 1502.68044] \textit{Peinado, Marcus}, Hard graphs for randomized subgraph exclusion algorithms, 278-289 [Zbl 1502.68244] \textit{Phillips, Cynthia; Stein, Clifford; Wein, Joel}, Task scheduling in networks (extended abstract), 290-301 [Zbl 1502.68370] \textit{Schenk, Eric}, Parallel dynamic lowest common ancestors, 302-313 [Zbl 1502.68103] \textit{Schuierer, S.}, An \(O(\log \log n)\) algorithm to compute the kernel of a polygon, 314-325 [Zbl 1502.68343] \textit{Schuierer, Sven}, Computing the \(L_1\)-diameter and center of a simple rectilinear polygon in parallel, 326-337 [Zbl 1502.68344] \textit{Sibeyn, Jop F.; Harris, Tim}, Exploiting locality in LT-RAM computations, 338-349 [Zbl 1502.68123] \textit{Thorup, Mikkel}, Efficient preprocessing of simple binary pattern forests, 350-358 [Zbl 1502.68139] \textit{Zhou, Xiao; Nakano, Shin-Ichi; Nishizeki, Takao}, A parallel algorithm for edge-coloring partial \(k\)-trees, 359-369 [Zbl 1502.68248] \textit{Dragan, Feodor F.}, Dominating cliques in distance-hereditary graphs, 370-381 [Zbl 1502.05233]