The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Bernard Chazelle
    Discrepancy Theory and Computational Geometry. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:1-2 [Conf]
  2. Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen
    Dynamic Motion Planning in Low Obstacle Density Environments. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:3-16 [Conf]
  3. Leonidas J. Guibas, Jean-Claude Latombe, Steven M. LaValle, David Lin, Rajeev Motwani
    Visibility-Based Pursuit-Evasion in a Polygonal Environment. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:17-30 [Conf]
  4. Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach
    Maintaining the Extent of a Moving Point Set. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:31-44 [Conf]
  5. Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlund, Mikkel Thorup
    Finding Cores of Limited Length. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:45-54 [Conf]
  6. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:55-68 [Conf]
  7. S. Rao Kosaraju, Alejandro A. Schäffer, Leslie G. Biesecker
    Approximation Algorithms for a Genetic Diagnostics Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:69-92 [Conf]
  8. John Hershberger, Jack Snoeyink
    Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:93-103 [Conf]
  9. Moses Charikar, Rajeev Motwani, Prabhakar Raghavan, Craig Silverstein
    Constrained TSP and Low-Power Computing. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:104-115 [Conf]
  10. Piotr Berman, Moses Charikar, Marek Karpinski
    On-line Load Balancing for Related Machines. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:116-125 [Conf]
  11. Nikola Stojanovic, Piotr Berman, Deborah Gumucio, Ross C. Hardison, Webb Miller
    A Linear-Time Algorithm for the 1-Mismatch Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:126-135 [Conf]
  12. Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta
    On Some Geometric Optimization Problems in Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:136-149 [Conf]
  13. Hiroyuki Okano, Shinji Misono, Kazuo Iwano
    New TSP Construction Heuristics and Their Relationships to the 2-Opt. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:150-159 [Conf]
  14. Amihood Amir, Moshe Lewenstein, Noa Lewenstein
    Pattern Matching In Hypertext. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:160-173 [Conf]
  15. Ricardo A. Baeza-Yates, Gonzalo Navarro
    Multiple Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:174-184 [Conf]
  16. David P. Dobkin
    Applied Computational Geormetry - Abstract. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:185- [Conf]
  17. Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
    Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:186-199 [Conf]
  18. Gill Barequet, Matthew Dickerson, Michael T. Goodrich
    Voronoi Diagrams for Polygon-Offset Distance Functions. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:200-209 [Conf]
  19. Steven S. Seiden
    Randomized Algorithms for that Ancient Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:210-223 [Conf]
  20. Tatsuya Hayashi, Koji Nakano, Stephan Olariu
    Optimal Parallel Algorithms for Finding Proximate Points, with Applications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:224-233 [Conf]
  21. David Eppstein, David Hart
    An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:234-247 [Conf]
  22. Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk
    On Geometric Path Query Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:248-257 [Conf]
  23. Sally A. Goldman, Jyoti Parwatikar, Subhash Suri
    On-line Scheduling with Hard Deadlines (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:258-271 [Conf]
  24. Sajal K. Das, Maria Cristina Pinotti
    Load Balanced Mapping of Data Structures in Parallel Memory Modules for Fast and Conflict-Free Templates Access. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:272-281 [Conf]
  25. Ketan Mulmuley
    Parallel vs. Parametric Complexity (Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:282-283 [Conf]
  26. Alejandro López-Ortiz, Sven Schuierer
    Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:284-296 [Conf]
  27. Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir
    Dynamic Data Structures for Fat Objects and Their Applications. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:297-306 [Conf]
  28. Michael H. Goldwasser, Rajeev Motwani
    Intractability of Assembly Sequencing: Unit Disks in the Plane. [Citation Graph (1, 0)][DBLP]
    WADS, 1997, pp:307-320 [Conf]
  29. Giri Narasimhan
    On Hamiltonian Triangulations in Simple Polygons (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:321-330 [Conf]
  30. Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
    Computing Orthogonal Drawings with the Minimum Number of Bends. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:331-344 [Conf]
  31. Stephen Kwek
    On a Simple Depth-First Search Strategy for Exploring Unknown Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:345-353 [Conf]
  32. Achilleas Papakostas, Ioannis G. Tollis
    Orthogonal Drawing of High Degree Graphs with Small Area and Few Bends. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:354-367 [Conf]
  33. Sarnath Ramnath, Hong Shen
    A Centroid Labeling Technique and its Application to Path Selection in Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:368-377 [Conf]
  34. Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich
    Offset-Polygon Annulus Placement Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:378-391 [Conf]
  35. Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong
    Computing Constrained Minimum-Width Annuli of Point Sets. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:392-401 [Conf]
  36. Michael Segal, Klara Kedem
    Geometric Applications Of Posets. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:402-415 [Conf]
  37. Himanshu Gupta, Rephael Wenger
    Constructing Pairwise Disjoint Paths with Few Links. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:416-425 [Conf]
  38. Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro
    Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:426-439 [Conf]
  39. Jochen Rethman, Egon Wanke
    An Approximation Algorithm for Stacking up Bins from a Conveyor onto Pallets. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:440-449 [Conf]
  40. Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer
    Relaxed Balance through Standard Rotations. [Citation Graph (2, 0)][DBLP]
    WADS, 1997, pp:450-461 [Conf]
  41. John Hershberger, Subhash Suri
    Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:462-471 [Conf]
  42. Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou
    Panarity, Revisited (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:472-473 [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