The SCEAS System
Navigation Menu

Conferences in DBLP

Workshop on Algorithms and Data Structures (WADS) (wads)
1999 (conf/wads/1999)

  1. Artur Andrzejak, Komei Fukuda
    Optimization over k-set Polytopes and Efficient k-set Enumeration. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:1-12 [Conf]
  2. Gabriele Neyer
    Line Simplification with Restricted Orientations. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:13-24 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:25-36 [Conf]
  4. Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick
    Resizable Arrays in Optimal Time and Space. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:37-48 [Conf]
  5. Rasmus Pagh
    Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:49-54 [Conf]
  6. Charles E. Leiserson
    Design and Analysis of Algorithms for Shared-Memory Multiprocessors (Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:55- [Conf]
  7. Maurizio Patrignani
    On the Complexity of Orthogonal Compaction. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:56-61 [Conf]
  8. Gill Barequet, Prosenjit Bose, Matthew Dickerson
    Optimizing Constrained Offset and Scaled Polygonal Annuli. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:62-73 [Conf]
  9. Joan Boyar, Kim S. Larsen, Morten N. Nielsen
    The Accommodating Function - A Generalization of the Competitive Ratio. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:74-79 [Conf]
  10. Michael A. Bender, Chandra Chekuri
    Performance Guarantees for the TSP with a Parameterized Triangle Inequality. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:80-85 [Conf]
  11. Xiaotie Deng, Evangelos E. Milios, Andy Mirzaian
    Robot Map Verification of a Graph World. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:86-97 [Conf]
  12. Christoph A. Bröcker, Sven Schuierer
    Searching Rectilinear Streets Completely. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:98-109 [Conf]
  13. Klaus Jansen, Lorant Porkolab
    General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:110-121 [Conf]
  14. Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena
    The Lazy Bureaucrat Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:122-133 [Conf]
  15. Won-Sook Lee, Pierre Beylot, David Sankoff, Nadia Magnenat-Thalmann
    Generating 3D Virtual Populations from Pictures of a Few Individuals. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:134-144 [Conf]
  16. Prosenjit Bose, Pat Morin
    Testing the Quality of Manufactured Balls. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:145-156 [Conf]
  17. S. Rao Kosaraju, Teresa M. Przytycka, Ryan S. Borgstrom
    On an Optimal Split Tree Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:157-168 [Conf]
  18. David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman
    Representing Trees of Higer Degree. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:169-180 [Conf]
  19. Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh
    Indexing and Dictionary Matching with One Error. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:181-192 [Conf]
  20. Tamás Lukovszki
    New Results of Fault Tolerant Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:193-204 [Conf]
  21. Michael T. Goodrich, John G. Kloss II
    Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:205-216 [Conf]
  22. Umesh V. Vazirani
    Go-With-The-Winners Heuristic. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:217-218 [Conf]
  23. Gill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III
    2-Point Site Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:219-230 [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:231-240 [Conf]
  25. Christoph A. Bröcker, Alejandro López-Ortiz
    Position-Independent Street Searching. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:241-252 [Conf]
  26. Samarjit Chakraborty, Somenath Biswas
    Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:253-264 [Conf]
  27. Cao An Wang, Bo-Ting Yang
    A Tight Bound for ß-SKeleton of Minimum Weight Triangulations. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:265-275 [Conf]
  28. Sergei Bespamyatnikh, Michael Segal
    Rectilinear Static and Dynamic Discrete 2-center Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:276-287 [Conf]
  29. Ulrike Stege
    Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter Tractable. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:288-293 [Conf]
  30. Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
    Efficient Web Searching Using Temporal Factors. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:294-305 [Conf]
  31. Claudia Iturriaga, Anna Lubiw
    Elastic Labels Around the Perimeter of a Map. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:306-317 [Conf]
  32. Sergei Bespamyatnikh, Klara Kedem, Michael Segal
    Optimal Facility Location under Various Distance Functions. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:318-329 [Conf]
  33. Dan Gusfield, Charles U. Martel
    Tresholds for Sports Elimination Numbers Algorithms and Complexity. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:330-341 [Conf]
  34. Gerth Stølting Brodal, Rolf Fagerberg
    Dynamic Representation of Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:342-351 [Conf]
  35. Jeffrey Scott Vitter
    Online Data Structures in External Memory. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:352-366 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002