default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th SWAT 1994: Aarhus, Denmark
- Erik Meineche Schmidt, Sven Skyum:
Algorithm Theory - SWAT '94, 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings. Lecture Notes in Computer Science 824, Springer 1994, ISBN 3-540-58218-5 - Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir:
Computing Depth Orders and Related Problems. 1-12 - Pankaj K. Agarwal, Sandeep Sen:
Selection in Monotone Matrices and Computing kth Nearest Neighbors. 13-24 - Susanne Albers, Hisashi Koga:
New On-Line Algorithms for the Page Replication Problem. 25-36 - Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo
:
Serving Requests with On-line Routing. 37-48 - Peter Becker:
A New Algorithm for the Construction of Optimal B-Trees. 49-60 - Mark de Berg, Marko de Groot, Mark H. Overmars:
New Results on Binary Space Partitions in the Plane (Extended Abstract). 61-72 - Piotr Berman, Andrzej Lingas:
A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. 73-82 - Therese Biedl, Goos Kant, Michael Kaufmann:
On Triangulating Planar Graphs under the Four-Connectivity Constraint. 83-94 - Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter:
Parallel and Sequential Approximations of Shortest Superstrings. 95-106 - Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert:
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. 107-118 - Gautam Das, Paul J. Heffernan, Giri Narasimhan:
Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract). 119-130 - Paul F. Dietz, Joel I. Seiferas, Ju Zhang:
A Tight Lower Bound for On-line Monotonic List Labeling. 131-142 - Stefan Felsner, Rudolf Müller, Lorenz Wernisch:
Trapezoid Graphs and Generalizations, Geometry and Algorithms. 143-154 - David Fernández-Baca, Giora Slutzki:
Optimal Parametric Search on Graphs of Bounded Tree-Width. 155-166 - Michael L. Fredman:
Lower Bounds for Dynamic Algorithms. 167-171 - Arvind Gupta, Naomi Nishimura:
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. 172-182 - Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
On Intersection Searching Problems Involving Curved Objects. 183-194 - Magnús M. Halldórsson, Jaikumar Radhakrishnan:
Improved Approximations of Independent Sets in Bounded-Degree Graphs. 195-206 - Lisa Higham, Teresa M. Przytycka:
Asymptotically Optimal Election on Weighted Rings. 207-218 - Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener:
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract). 219-230 - Johan Håstad:
Recent Results in Hardness of Approximation. 231-239 - Ben H. H. Juurlink, Harry A. G. Wijshoff:
The Parallel Hierarchical Memory Model. 240-251 - Ketan Mulmuley:
Randomized Geometric Algorithms (Abstract). 252-254 - Leonidas Palios:
Connecting the Maximum Number of Grid Nodes to the Boundary with Non-Intersecting Line Segments. 255-266 - Marina Papatriantafilou, Philippas Tsigas:
On Self-Stabilizing Wait-Free Clock Synchronization. 267-277 - Marcus Peinado:
Hard Graphs for Randomized Subgraph Exclusion Algorithms. 278-289 - Cynthia A. Phillips, Clifford Stein, Joel Wein:
Task Scheduling in Networks (Extended Abstract). 290-301 - Erik Schenk:
Parallel Dynamic Lowest Common Ancestors. 302-313 - Sven Schuierer:
An O(log N) Algorithm to Compute the Kernel of a Polygon. 314-325 - Sven Schuierer:
Computing the L1-Diameter and Center of a Simple Rectilinear Polygon in Parallel. 326-337 - Jop F. Sibeyn, Tim J. Harris:
Exploiting Locality in LT-RAM Computations. 338-349 - Mikkel Thorup:
Efficient Preprocessing of Simple Binary Pattern Forests. 350-358 - Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki:
A Parallel Algorithm for Edge-Coloring Partial k-Trees. 359-369 - Feodor F. Dragan:
Dominating Cliques in Distance-Hereditary Graphs. 370-381
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-06 22:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
