Algorithms and Data Structures

1. Pattern matching for permutations

   • Prosenjit Bose, Jonathan F. Buss, Anna Lubiw

   Pages 200-209

2. Filling polyhedral molds

   • Prosenjit Bose, Marc van Kreveld, Godfried Toussaint

   Pages 210-221

3. Deferred-query—An efficient approach for problems on interval and circular-arc graphs

   • Maw-Shang Chang, Sheng-Lung Peng, Jenn-Liang Liaw

   Pages 222-233

4. On the complexity of graph embeddings

   • Jianer Chen, Saroja P. Kanchi, Arkady Kanevsky

   Pages 234-245

5. Algorithms for polytope covering and approximation

   • Kenneth L. Clarkson

   Pages 246-252

6. Global strategies for augmenting the efficiency of TSP heuristics

   • Bruno Codenotti, Giovanni Manzini, Luciano Margara, Giovanni Resta

   Pages 253-264

7. Static and dynamic algorithms for k-point clustering problems

   • Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel Smid

   Pages 265-276

8. Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers

   • Olivier Devillers, Andreas Fabri

   Pages 277-288

9. Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract)

   • Paul F. Dietz, Rajeev Raman

   Pages 289-301

10. The K-D heap: An efficient multi-dimensional priority queue

    • Yuzheng Ding, Mark Alien Weiss

    Pages 302-313

11. A complete and efficient algorithm for the intersection of a general and a convex polyhedron

    • Katrin Dobrindt, Kurt Mehlhorn, Mariette Yvinec

    Pages 314-324

12. Computing the smallest k-enclosing circle and related problems

    • Alon Efrat, Micha Sharir, Alon Ziv

    Pages 325-336

13. An index data structure for matrices, with applications to fast two-dimensional pattern matching

    • Raffaele Giancarlo

    Pages 337-348

14. A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects

    • Thorsten Graf, Klaus Hinrichs

    Pages 349-360

15. Further results on generalized intersection searching problems: Counting, reporting, and dynamization

    • Prosenjit Gupta, Ravi Janardan, Michiel Smid

    Pages 361-372

16. Generalized approximate algorithms for point set congruence

    • Paul J. Heffernan

    Pages 373-384

17. Approximating shortest superstrings with constraints

    • Tao Jiang, Ming Li

    Pages 385-396

18. Tree reconstruction from partial orders

    • Sampath Kannan, Tandy Warnow

    Pages 397-408

19. Improved parallel depth-first search in undirected planar graphs

    • Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama

    Pages 409-420

20. On approximating the longest path in a graph

    • David Karger, Rajeev Motwani, G. D. S. Ramkumar

    Pages 421-432

The papers in this volume were presented at the Third Workshop on Algorithmsand Data Structures (WADS '93), held in Montreal, Canada, August 1993. The volume opens with five invited presentations: "Computing the all-pairs longest chains in the plane" by M.J. Atallah and D.Z. Chen, "Towards a better understanding of pure packet routing" by A. Borodin, "Tolerating faults in meshes and other networks" (abstract) by R. Cole, "A generalization of binary search" by R.M. Karp, and "Groups and algebraic complexity" (abstract) by A.C. Yao. The volume continues with 52 regular presentations selected from 165 submissions, each of which was evaluated by at least three program committee members, many of whom called upon additional reviewers.

• Algorithmen
• Algorithms
• Combinatorics
• Complexity Theory
• Datenstrukturen
• Graph Theory
• Kombinatorik
• Komplexitätstheorie
• algorithm
• complexity
• data structure
• data structures
• algorithm analysis and problem complexity

Policies and ethics