Computing and Combinatorics

the long version

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