Algorithms and data structures. 4th international workshop, WADS '95, Kingston, Canada, August 16--18, 1995. Proceedings (Q1896994)

The articles of this volume will be reviewed individually. For the preceding workshop see [Zbl 0825.00122]. Indexed articles: \textit{Bilardi, Gianfranco; Preparata, Franco P.}, Lower bounds to processor-time tradeoffs under bounded-speed message propagation, 1-12 [Zbl 1502.68036] \textit{Jaromczyk, Jerzy W.; Kowaluk, Miroslaw}, The two-line center problem from a polar view: a new algorithm and data structure, 13-25 [Zbl 1502.68326] \textit{Glozman, Alex; Kedem, Klara; Shpitalnik, Gregory}, On some geometric selection and optimization problems via sorted matrices, 26-37 [Zbl 1502.68318] \textit{Holzman, Ron; Marcus, Yosi; Peleg, David}, Load balancing in quorum systems (extended abstract), 38-49 [Zbl 1502.68197] \textit{Kröll, Brigitte; Widmayer, Peter}, Balanced distributed search trees do not exist, 50-61 [Zbl 1502.68100] \textit{Estivill-Castro, V.; Urrutia, J.}, Two-floodlight illumination of convex polygons, 62-73 [Zbl 1502.68316] \textit{Das, Gautam; Goodrich, Michael T.}, On the complexity of approximating and illuminating three-dimensional convex polyhedra (preliminary version), 74-85 [Zbl 1502.68309] \textit{Phillips, Cynthia; Stein, Clifford; Wein, Joel}, Scheduling jobs that arrive over time (extended abstract), 86-97 [Zbl 1502.68371] \textit{Frandsen, Gudmund Skovbjerg; Husfeldt, Thore; Bro Miltersen, Peter; Rauhe, Theis; Skyum, Søren}, Dynamic algorithms for the Dyck languages, 98-108 [Zbl 1502.68163] \textit{Sharir, Micha}, Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications, 109-121 [Zbl 1502.68346] \textit{Carlsson, Svante; Jonsson, Håkan}, Computing a shortest watchman path in a simple polygon in polynomial-time, 122-134 [Zbl 1502.68303] \textit{López-Ortiz, Alejandro; Schuierer, Sven}, Going home through an unknown street, 135-146 [Zbl 1502.68337] \textit{Albers, Susanne; Koga, Hisashi}, Page migration with limited local memory capacity, 147-158 [Zbl 1502.68043] \textit{Irani, Sandy; Seiden, Steve}, Randomized algorithms for metrical task systems, 159-170 [Zbl 1502.68047] \textit{Gupta, Prosenjit; Janardan, Ravi; Majhi, Jayanth; Woo, Tony}, Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining, 171-182 [Zbl 1502.68321] \textit{Kirkpatrick, David; Snoeyink, Jack}, Computing common tangents without a separating line, 183-193 [Zbl 1502.68328] \textit{Grove, Edward F.; Kao, Ming-Yang; Krishnan, P.; Vitter, Jeffrey Scott}, Online perfect matching and mobile computing, 194-205 [Zbl 1502.68376] \textit{Ausiello, Giorgio; Feuerstein, Esteban; Leonardi, Stefano; Stougie, Leen; Talamo, Maurizio}, Competitive algorithms for the on-line traveling salesman, 206-217 [Zbl 1502.68374] \textit{Toussaint, Godfried}, Quadrangulations of planar sets, 218-227 [Zbl 1502.68348] \textit{Lingas, Andrzej; Mukhopadhyay, Asish}, A linear-time construction of the relative neighborhood graph within a histogram, 228-238 [Zbl 1502.68335] \textit{Liotta, G.; Di Battista, G.}, Computing proximity drawings of trees in the 3-dimensional space, 239-250 [Zbl 1502.68238] \textit{Roberts, Alan; Symvonis, Antonis; Zhang, Louxin}, Routing on trees via matchings, 251-262 [Zbl 1502.68246] \textit{Annexstein, Fred S.; Kuchko, Eugene A.}, A ranking algorithm for Hamilton paths in shuffle-exchange graphs, 263-269 [Zbl 1502.68199] \textit{Boyar, Joan; Fagerberg, Rolf; Larsen, Kim S.}, Amortization results for chromatic search trees, with an application to priority queues, 270-281 [Zbl 1502.68085] \textit{Brodal, Gerth Stølting}, Fast meldable priority queues, 282-290 [Zbl 1502.68086] \textit{Kagaris, Dimitrios; Pantziou, Grammati E.; Tragoudas, Spyros; Zaroliagis, Christos D.}, On the computation of fast data transmissions in networks with capacities and delays, 291-302 [Zbl 1502.68038] \textit{Baruah, Sanjoy; Pruesse, Gara}, Routing with delays when storage is costly, 303-314 [Zbl 1502.68035] \textit{Vitányi, Paul; Li, Ming}, Algorithmic arguments in physics of computation, 315-333 [Zbl 1502.68140] \textit{Arge, Lars}, The buffer tree: a new technique for optimal I/O-algorithms, 334-345 [Zbl 1502.68081] \textit{Chiang, Yi-Jen}, Experiments on the practical I/O efficiency of geometric algorithms: distribution sweep vs. plane sweep (extended abstract), 346-357 [Zbl 1502.68307] \textit{Corneil, Derek G.; Olariu, Stephan; Stewart, Lorna}, Computing a dominating pair in an asteroidal triple-free graph in linear time, 358-368 [Zbl 1502.68218] \textit{Djidjev, Hristo N.}, A linear algorithm for the maximal planar subgraph problem, 369-380 [Zbl 1502.68221] \textit{Callahan, Paul; Goodrich, Michael T.; Ramaiyer, Kumar}, Topology B-trees and their applications, 381-392 [Zbl 1502.68090] \textit{Moffat, Alistair; Katajainen, Jyrki}, In-place calculation of minimum-redundancy codes, 393-402 [Zbl 1502.68120] \textit{Kaller, Damon; Gupta, Arvind; Shermer, Tom}, Regular-factors in the complements of partial \(k\)-trees, 403-414 [Zbl 1502.68233] \textit{Cattell, Kevin; Dinneen, Michael J.; Fellows, Michael R.}, Obstructions to within a few vertices or edges of acyclic, 415-427 [Zbl 1502.68215] \textit{Hariharan, Ramesh; Kapoor, Sanjiv; Kumar, Vijay}, Faster enumeration of all spanning trees of a directed graph, 428-439 [Zbl 1502.68230] \textit{King, Valerie}, A simpler minimum spanning tree verification algorithm, 440-448 [Zbl 1502.68236] \textit{Berman, Piotr; Fujito, Toshihiro}, On approximation properties of the independent set problem for degree 3 graphs, 449-460 [Zbl 1502.68207] \textit{Lau, Hoong Chuin}, Approximation of constraint satisfaction via local search (extended abstract), 461-472 [Zbl 1502.68275] \textit{Andersson, Arne; Swanson, Kurt}, On the difficulty of range searching, 473-481 [Zbl 1502.68297] \textit{Fich, Faith; Miltersen, Peter Bro}, Tables should be sorted (on random access machines), 482-493 [Zbl 1502.68117] \textit{Armen, Chris; Stein, Clifford}, Improved length bounds for the shortest superstring problem (extended abstract), 494-505 [Zbl 1504.68293] \textit{Bafna, Vineet; Narayanan, Babu; Ravi, R.}, Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles), 506-517 [Zbl 1502.92003]