From wads@scs.carleton.ca Tue May 4 01:46:34 1999 Date: Fri, 30 Apr 1999 08:01:47 -0400 From: Workshop On Algorithms and Data Structures To: wads@scs.carleton.ca Subject: WADS'99, list of accepted papers 1999 Workshop on Algorithms and Data Structures (WADS'99) Vancouver, August 11 - August 14, 1999 http://www.scs.carleton.ca/~wads Conference Information http://www.pims.math.ca/sections/activities/wads99.html *************************** LIST OF ACCEPTED PAPERS *************************** REGULAR PAPERS ============== title: Indexing and Dictionary Matching with One Error author(s): Amir et.al. contact: amircs.biu.ac.il title: Robot Map Verification of a Graph World author(s): Deng et.al. contact: andycs.yorku.ca title: Searching Rectilinear Streets Completely author(s): Broecker et.al. contact: schuiereinformatik.uni-freiburg.de title: General Multiprocessor Task Scheduling... author(s): Jansen et.al. contact: klausidsia.ch title: Optimization over k-set polytopes author(s): Andrzejak et.al. contact: arturinf.ethz.ch title: Thresholds for Sports Elimination Numbers... author(s): Gusfield et.al. contact: martelcs.ucdavis.edu number: 14 title: Line Simplification with Restricted Orientations author(s): Neyer contact: neyerinf.ethz.ch title: On a matching problem in the plane author(s): Dumitrescu et.al. contact: dumitrespaul.rutgers.edu title: Efficient Web Searching Using Temporal Factors author(s): Czumaj et.al. contact: leszekcsc.liv.ac.uk title: Testing the Quality of Manufactured Balls author(s): Bose et.al. contact: morinscs.carleton.ca title: Tiered Vectors: Efficient Dynamic Arrays... author(s): Goodrich et.al. contact: jklosscs.jhu.edu title: Rectilinear Static and Dynamic Discrete 2-center... author(s): Bespamyatnikh et.al. contact: bespcs.ubc.ca title: Optimizing constrained offset and scaled polygonal... author(s): Barequet et.al. contact: barequetcs.technion.ac.il title: 2-point site Voronoi diagrams author(s): Barequet et.al. contact: barequetcs.technion.ac.il title: Approximation Algorithms for 3-D Common ... author(s): Chakraborty et.al. contact: sbiswascse.unl.edu title: On an Optimal Split Tree Problem author(s): Kosaraju et.al. contact: przytyckgrserv.med.jhmi.edu title: New Results on Fault Tolerant Geometric Spanners author(s): Lukovszki contact: tamashni.uni-paderborn.de title: Position-Independent Street Searching author(s): Hipke et.al. contact: alopezounb.ca title: Representing Trees of Higher Degree author(s): Benoit et.al. contact: imunrouwaterloo.ca title: Resizable Arrays in Optimal Time and Space author(s): Brodnik et.al. contact: eddemaineuwaterloo.ca title: Elastic Labels Around the Perimeter of a Map author(s): Iturriaga et.al. contact: alubiwdaisy.uwaterloo.ca title: A Parallel Algorithm for Finding the Constrained... author(s): Chin et.al. contact: wangcs.mun.ca title: A Tight Bound for $\beta$-Skeleton of Minimum author(s): Wang et.al. contact: wangcs.mun.ca title: The Lazy Bureaucrat Scheduling Problem author(s): Arkin et.al. contact: jsbmams.sunysb.edu title: Dynamic Representations of Sparse Graphs author(s): Brodal et.al. contact: gerthbrics.dk title: The T-join Problem in Sparse Graphs... author(s): Berman et.al. contact: alexzcs.gsu.edu title: Trie-based data structures for sequence assembly author(s): Chen contact: tchensalt2.med.harvard.edu title: Optimal Facility Location under Various Distance Functions author(s): Bespamyatnikh, Kedem, Segal contact: bespcs.ubc.ca SHORT PAPERS ============ title: Performance Guarantees for the TSP ... author(s): Bender et.al. contact: bendercs.sunysb.edu title: The Accommodating Function... author(s): Boyar et.al. contact: kslarsenimada.ou.dk title: On the Complexity of Orthogonal Compaction author(s): Patrignani et.al. contact: patrignadia.uniroma3.it title: Hash and Displace: Efficient Evaluation of Minima author(s): Pagh contact: paghbrics.dk title: Gene Trees and Species Trees... author(s): Stege et.al. contact: stegeinf.ethz.ch =========================================================================== ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.math.tau.ac.il/~sariel/CG/compgeom/threads.html.