10. ISAAC 1999:
Chennai, India
Alok Aggarwal, C. Pandu Rangan (Eds.):
Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings.
Lecture Notes in Computer Science 1741 Springer 1999, ISBN 3-540-66916-7 
Invited Talk
- Kurt Mehlhorn:
The Engineering of Some Bipartite Matching Programs.
1-3
Session 1(a) - Data Structure I
Session 1(b) - Parallel and Distributed Computing I
Session 2(a) - Approximate Algorithm I
Session 2(b) - Computational Intelligence
Session 3(a) - Online Algorithm
Session 3(b) - Complexity Theory I
Session 4(a) - Approximate Algorithm II
Session 4(b) - Graph Algorithm I
Invited Talk
- Éva Tardos:
Approximation Algorithms for Some Clustering and Classification Problems.
183
Session 5(a) - Computational Geometry I
Session 5(b) - Parallel and Distributed Computing II
Session 6(a) - Data Structure II
- Tetsuo Shibuya:
Constructing the Suffix Tree of a Tree with a Large Alphabet.
225-236
- Tadao Takaoka:
An O(1) Time Algorithm for Generating Multiset Permutations.
237-246
Session 6(b) - Complexity Theory II
Session 7(a) - Computational Geometry II
Session 7(b) - Algorithms in Practice
Session 8(a) - Approximate Algorithm III
Session 8(b) - Graph Algorithm II
Invited Talk
- Kokichi Sugihara:
Topology-Oriented Approach to Robust Geometric Computation.
357-366
Session 9(a) - Approximate Algorithm IV
Session 9(b) - Parallel and Distributed Computing III
Session 10(a) - Computational Geometry III
Session 10(b) - Graph Algorithm III
Last update Tue May 21 17:25:03 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
