Computing and Combinatorics

Computing and Combinatorics: 7th Annual International Conference, COCOON 2001 Guilin, China, August 20–23, 2001 ProceedingsAuthor: Jie Wang Published by Springer Berlin Heidelberg ISBN: 978-3-540-42494-9 DOI: 10.1007/3-540-44679-6Table of Contents:Complete Problems for Valiant’s Class of qp-Computable Families of Polynomials
Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n
On Universally Polynomial Context-Free Languages
Separating Oblivious and Non-oblivious BPs
Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws
Algebraic Properties for P-Selectivity
Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM
Enhanced Sequence Reconstruction with DNA Microarray Application
Non-approximability of Weighted Multiple Sequence Alignment
A Greedy Algorithm for Optimal Recombination
Generating Well-Shaped d-dimensional Delaunay Meshes
Towards Compatible Triangulations
An Improved Upper Bound on the Size of Planar Convex-Hulls
On the Planar Two-Watchtower Problem
Efficient Generation of Triconnected Plane Triangulations
Packing Two Disks into a Polygonal Environment
Maximum Red/Blue Interval Matching with Application
Computing Farthest Neighbors on a Convex Polytope
Finding an Optimal Bridge between Two Polygons
How Good Is Sink Insertion?