4. SWAT 1994: Aarhus, Denmark

@proceedings{DBLP:conf/swat/1994,
  editor    = {Erik Meineche Schmidt and
               Sven Skyum},
  title     = {Algorithm Theory - SWAT '94, 4th Scandinavian Workshop on Algorithm
               Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
  booktitle = {SWAT},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {824},
  year      = {1994},
  isbn      = {3-540-58218-5},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir: Computing Depth Orders and Related Problems. 1-12 BibTeX
• Pankaj K. Agarwal, Sandeep Sen: Selection in Monotone Matrices and Computing k^th Nearest Neighbors. 13-24 BibTeX
• Susanne Albers, Hisashi Koga: New On-Line Algorithms for the Page Replication Problem. 25-36 BibTeX
• Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo: Serving Requests with On-line Routing. 37-48 BibTeX
• Peter Becker: A New Algorithm for the Construction of Optimal B-Trees. 49-60 BibTeX
• Mark de Berg, Marko de Groot, Mark H. Overmars: New Results on Binary Space Partitions in the Plane (Extended Abstract). 61-72 BibTeX
• Piotr Berman, Andrzej Lingas: A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. 73-82 BibTeX
• Therese C. Biedl, Goos Kant, Michael Kaufmann: On Triangulating Planar Graphs under the Four-Connectivity Constraint. 83-94 BibTeX
• Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter: Parallel and Sequential Approximations of Shortest Superstrings. 95-106 BibTeX
• Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert: Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. 107-118 BibTeX
• Gautam Das, Paul J. Heffernan, Giri Narasimhan: Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract). 119-130 BibTeX
• Paul F. Dietz, Joel I. Seiferas, Ju Zhang: A Tight Lower Bound for On-line Monotonic List Labeling. 131-142 BibTeX
• Stefan Felsner, Rudolf Müller, Lorenz Wernisch: Trapezoid Graphs and Generalizations, Geometry and Algorithms. 143-154 BibTeX
• David Fernández-Baca, Giora Slutzki: Optimal Parametric Search on Graphs of Bounded Tree-Width. 155-166 BibTeX
• Michael L. Fredman: Lower Bounds for Dynamic Algorithms. 167-171 BibTeX
• Arvind Gupta, Naomi Nishimura: Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. 172-182 BibTeX
• Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: On Intersection Searching Problems Involving Curved Objects. 183-194 BibTeX
• Magnús M. Halldórsson, Jaikumar Radhakrishnan: Improved Approximations of Independent Sets in Bounded-Degree Graphs. 195-206 BibTeX
• Lisa Higham, Teresa M. Przytycka: Asymptotically Optimal Election on Weighted Rings. 207-218 BibTeX
• Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener: Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract). 219-230 BibTeX
• Johan Håstad: Recent Results in Hardness of Approximation. 231-239 BibTeX
• Ben H. H. Juurlink, Harry A. G. Wijshoff: The Parallel Hierarchical Memory Model. 240-251 BibTeX
• Ketan Mulmuley: Randomized Geometric Algorithms (Abstract). 252-254 BibTeX
• Leonidas Palios: Connecting the Maximum Number of Grid Nodes to the Boundary with Non-Intersecting Line Segments. 255-266 BibTeX
• Marina Papatriantafilou, Philippas Tsigas: On Self-Stabilizing Wait-Free Clock Synchronization. 267-277 BibTeX
• Marcus Peinado: Hard Graphs for Randomized Subgraph Exclusion Algorithms. 278-289 BibTeX
• Cynthia A. Phillips, Clifford Stein, Joel Wein: Task Scheduling in Networks (Extended Abstract). 290-301 BibTeX
• Erik Schenk: Parallel Dynamic Lowest Common Ancestors. 302-313 BibTeX
• Sven Schuierer: An O(log N) Algorithm to Compute the Kernel of a Polygon. 314-325 BibTeX
• Sven Schuierer: Computing the L₁-Diameter and Center of a Simple Rectilinear Polygon in Parallel. 326-337 BibTeX
• Jop F. Sibeyn, Tim J. Harris: Exploiting Locality in LT-RAM Computations. 338-349 BibTeX
• Mikkel Thorup: Efficient Preprocessing of Simple Binary Pattern Forests. 350-358 BibTeX
• Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki: A Parallel Algorithm for Edge-Coloring Partial k-Trees. 359-369 BibTeX
• Feodor F. Dragan: Dominating Cliques in Distance-Hereditary Graphs. 370-381 BibTeX