- Valerie King:
A Simpler Minimum Spanning Tree Verification Algorithm. WADS 1995: 440-448 - David G. Kirkpatrick, Jack Snoeyink:
Computing Common Tangents Without a Separating Line. WADS 1995: 183-193 - Brigitte Kröll, Peter Widmayer:
Balanced Distributed Search Trees Do Not Exist. WADS 1995: 50-61 - Hoong Chuin Lau:
Approximation of Constraint Satisfaction via Local Search (Extended Abstract). WADS 1995: 461-472 - Andrzej Lingas, Asish Mukhopadhyay:
A Linear-time Construction of the Relative Neighborhood Graph within a Histogram. WADS 1995: 228-238 - Giuseppe Liotta, Giuseppe Di Battista:
Computing Proximity Drawings of Trees in the 3-Dimemsional Space. WADS 1995: 239-250 - Alejandro López-Ortiz, Sven Schuierer:
Going Home Through an Unknown Street. WADS 1995: 135-146 - Kurt Mehlhorn:
Experiences with the Implementation of Geometric Algorithms (Abstract). WADS 1995: 518 - Alistair Moffat, Jyrki Katajainen:
In-Place Calculation of Minimum-Redundancy Codes. WADS 1995: 393-402 - Cynthia A. Phillips, Clifford Stein, Joel Wein:
Scheduling Jobs that Arrive Over Time (Extended Abstract). WADS 1995: 86-97 - Alan Roberts, Antonios Symvonis
, Louxin Zhang:
Routing on Trees via Matchings. WADS 1995: 251-262 - Sanjoy K. Sanjoy, Gara Pruesse:
Routing with Delays when Storage is Costly. WADS 1995: 303-314 - Micha Sharir:
Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other Applications. WADS 1995: 109-121 - Godfried T. Toussaint:
Quadrangulations of Planar Sets. WADS 1995: 218-227 - Paul M. B. Vitányi, Ming Li:
Algorithmic Arguments in Physics of Computation. WADS 1995: 315-333 - Selim G. Akl, Frank K. H. A. Dehne, Jörg-Rüdiger Sack
, Nicola Santoro:
Algorithms and Data Structures, 4th International Workshop, WADS '95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings. Lecture Notes in Computer Science 955, Springer 1995, ISBN 3-540-60220-8 [contents]