default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6. WADS 1999: Vancouver, British Columbia, Canada
- Frank K. H. A. Dehne, Arvind Gupta, Jörg-Rüdiger Sack, Roberto Tamassia:
Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings. Lecture Notes in Computer Science 1663, Springer 1999, ISBN 3-540-66279-0 - Artur Andrzejak, Komei Fukuda:
Optimization over k-set Polytopes and Efficient k-set Enumeration. 1-12 - Gabriele Neyer:
Line Simplification with Restricted Orientations. 13-24 - Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Alexander Zelikovsky
:
The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout. 25-36 - Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick:
Resizable Arrays in Optimal Time and Space. 37-48 - Rasmus Pagh:
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions. 49-54 - Charles E. Leiserson:
Design and Analysis of Algorithms for Shared-Memory Multiprocessors (Abstract). 55 - Maurizio Patrignani:
On the Complexity of Orthogonal Compaction. 56-61 - Gill Barequet, Prosenjit Bose, Matthew Dickerson:
Optimizing Constrained Offset and Scaled Polygonal Annuli. 62-73 - Joan Boyar, Kim S. Larsen, Morten N. Nielsen:
The Accommodating Function - A Generalization of the Competitive Ratio. 74-79 - Michael A. Bender, Chandra Chekuri:
Performance Guarantees for the TSP with a Parameterized Triangle Inequality. 80-85 - Xiaotie Deng, Evangelos E. Milios, Andy Mirzaian:
Robot Map Verification of a Graph World. 86-97 - Christoph A. Bröcker, Sven Schuierer:
Searching Rectilinear Streets Completely. 98-109 - Klaus Jansen, Lorant Porkolab:
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time. 110-121 - Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena:
The Lazy Bureaucrat Scheduling Problem. 122-133 - Won-Sook Lee, Pierre Beylot, David Sankoff, Nadia Magnenat-Thalmann:
Generating 3D Virtual Populations from Pictures of a Few Individuals. 134-144 - Prosenjit Bose, Pat Morin:
Testing the Quality of Manufactured Balls. 145-156 - S. Rao Kosaraju, Teresa M. Przytycka, Ryan S. Borgstrom:
On an Optimal Split Tree Problem. 157-168 - David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman:
Representing Trees of Higer Degree. 169-180 - Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh:
Indexing and Dictionary Matching with One Error. 181-192 - Tamás Lukovszki:
New Results of Fault Tolerant Geometric Spanners. 193-204 - Michael T. Goodrich, John G. Kloss II:
Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences. 205-216 - Umesh V. Vazirani:
Go-With-The-Winners Heuristic. 217-218 - Gill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III:
2-Point Site Voronoi Diagrams. 219-230 - Francis Y. L. Chin, Der-Tsai Lee, Cao An Wang:
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane. 231-240 - Christoph A. Bröcker, Alejandro López-Ortiz:
Position-Independent Street Searching. 241-252 - Samarjit Chakraborty, Somenath Biswas:
Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules. 253-264 - Cao An Wang, Bo-Ting Yang:
A Tight Bound for ß-SKeleton of Minimum Weight Triangulations. 265-275 - Sergei Bespamyatnikh, Michael Segal:
Rectilinear Static and Dynamic Discrete 2-center Problems. 276-287 - Ulrike Stege:
Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter Tractable. 288-293 - Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito:
Efficient Web Searching Using Temporal Factors. 294-305 - Claudia Iturriaga, Anna Lubiw:
Elastic Labels Around the Perimeter of a Map. 306-317 - Sergei Bespamyatnikh, Klara Kedem, Michael Segal:
Optimal Facility Location under Various Distance Functions. 318-329 - Dan Gusfield, Charles U. Martel:
Tresholds for Sports Elimination Numbers Algorithms and Complexity. 330-341 - Gerth Stølting Brodal, Rolf Fagerberg:
Dynamic Representation of Sparse Graphs. 342-351 - Jeffrey Scott Vitter:
Online Data Structures in External Memory. 352-366
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-09-26 23:46 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
