default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd SWAT 1990: Bergen, Norway
- John R. Gilbert, Rolf G. Karlsson:
SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 11-14, 1990, Proceedings. Lecture Notes in Computer Science 447, Springer 1990, ISBN 3-540-52846-6 - Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi:
Structural Complexity Theory: recent Surprises. 1-12 - Ravi B. Boppana, Magnús M. Halldórsson:
Approximating Maximum Independent Sets by Excluding Subgraphs. 13-25 - Ingo Althöfer, Gautam Das
, David P. Dobkin, Deborah Joseph:
Generating Sparse Spanners for Weighted Graphs. 26-37 - David Eppstein:
Finding the k Smallest Spanning Trees. 38-47 - Goos Kant, Jan van Leeuwen:
The File Distribution Problem for Processor Networks. 48-59 - Mark de Berg:
Translating Polygons with Applications to Hidden Surface Removal. 60-70 - Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec:
Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds. 71-84 - Michel Pocciola:
Graphics in Flatland Revisited. 85-96 - Gert Vegter:
The Visibility Diagram: a Data Structure for Visibility Problems and Motion Planning. 97-110 - Arne Andersson, Tony W. Lai:
Fast Updating of Well-Balanced Trees. 111-121 - Thomas Ottmann, Derick Wood:
How to Update a Balanced Binary Tree with a Constant Number of Rotations. 122-131 - Samuel W. Bent:
Ranking Trees Generated by Rotations. 132-142 - Ricardo A. Baeza-Yates, Gaston H. Gonnet, Nivio Ziviani:
Expected Behaviour Analysis of AVL Trees. 143-159 - Thomas Papadakis, J. Ian Munro, Patricio V. Poblete:
Analysis of the Expected Search Cost in Skip Lists. 160-172 - Paul F. Dietz, Ju Zhang:
Lower Bounds for Monotonic List Labeling. 173-180 - Christos Levcopoulos, Ola Petersson:
Sorting Shuffled Monotone Sequences. 181-191 - Mikhail J. Atallah:
A Faster Parallel Algorithm for a Matrix Searching Problem. 192-200 - Dana S. Richards, Jeffrey S. Salowe:
A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets. 201-212 - Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars:
Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric. 213-224 - Joseph Friedman, John Hershberger, Jack Snoeyink:
Input-Sensitive Compliant Motion in the Plane. 225-237 - Christos Levcopoulos, Andrzej Lingas:
Fast Algorithms for Greedy Triangulation. 238-250 - Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon:
Star Unfolding of a Polytope with Applications (Extended Abstract). 251-263 - David Fernández-Baca:
Space-Sweep Algorithms for Parametric Optimization (Extended Abstract). 264-275 - Nickolay M. Korneenko, Horst Martini:
Approximating Finite Weighted Point Sets by Hyperplanes. 276-286 - David S. Johnson:
Data Structures for Traveling Salesmen (Abstract). 287 - Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
Efficient Parallel Algorithms for Shortest Paths in Planar Graphs. 288-300 - Hans L. Bodlaender, Rolf H. Möhring:
The Pathwidth and Treewidth of Cographs. 301-309 - Stefan Arnborg, Andrzej Proskurowski:
Canonical Representation of Partial 2- and 3-Trees. 310-319 - David Fernández-Baca, Mark A. Williams:
On Matroids and Hierarchical Graphs. 320-331 - Ricardo A. Baeza-Yates, Mireille Régnier:
Fast Algorithms for Two Dimensional and Multiple Pattern Matching (Preliminary Version). 332-347 - Jorma Tarhio, Esko Ukkonen:
Boyer-Moore Approach to Approximate String Matching (Extended Abstract). 348-359 - Per Grape:
Complete Problems With L-samplable Distributions. 360-367 - John Hershberger:
Upper Envelope Onion Peeling. 368-379 - John Hershberger, Subhash Suri:
Applications of a Semi-Dynamic Convex Hull Algorithm. 380-392 - Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal:
Intersection Queries in Sets of Disks. 393-403 - Haijo Schipper, Mark H. Overmars:
Dynamic Partition Trees. 404-417
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 2024-12-26 00:58 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
