Skip to main content
SpringerLink
Log in
Book cover

Computing and Combinatorics

7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Jie Wang

    1. Department of Computer Science, University of Massachusetts, Lowell, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2108)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (66 papers)

  1. Front Matter

    Pages I-XIII
    Download chapter PDF

  2. Complexity Theory

    1. Complete Problems for Valiant’s Class of qp-Computable Families of Polynomials

      • Markus Bläser
      Pages 1-10

    2. Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n 4.03)

      • Michal KouckÝ
      Pages 11-20

    3. On Universally Polynomial Context-Free Languages

      • Nicholas Tran
      Pages 21-27

    4. Separating Oblivious and Non-oblivious BPs

      • Kazuo Iwama, Yasuo Okabe, Toshiro Takase
      Pages 28-38

    5. Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws

      • Iain A. Stewart
      Pages 39-48

    6. Algebraic Properties for P-Selectivity

      • Lane A. Hemaspaandra, Harald Hempel⋆, Arfst Nickelsen
      Pages 49-58

    7. Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM

      • Carla Denise Castanho, Wei Chen, Koichi Wada, Akihiro Fujiwara
      Pages 59-63

  3. Computational Biology

    1. Enhanced Sequence Reconstruction with DNA Microarray Application

      • Samuel A. Heath, Franco P. Preparata
      Pages 64-74

    2. Non-approximability of Weighted Multiple Sequence Alignment

      • Bodo Siebert
      Pages 75-85

    3. A Greedy Algorithm for Optimal Recombination

      • Shiquan Wu, Xun Gu
      Pages 86-90

  4. Computational Geometry

    1. Generating Well-Shaped d-dimensional Delaunay Meshes

      • Xiang-Yang Li
      Pages 91-100

    2. Towards Compatible Triangulations

      • Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Ferran Hurtado
      Pages 101-110

    3. An Improved Upper Bound on the Size of Planar Convex-Hulls

      • Abdullah N. Arslan, Ömer Eğecioğlu
      Pages 111-120

    4. On the Planar Two-Watchtower Problem

      • Sergei Bespamyatnikh, Zhixiang Chen, Kanliang Wang, Binhai Zhu
      Pages 121-130

    5. Efficient Generation of Triconnected Plane Triangulations

      • Shin-ichi Nakano
      Pages 131-141

    6. Packing Two Disks into a Polygonal Environment

      • Prosenjit Bose, Pat Morin, Antoine Vigneron
      Pages 142-149

    7. Maximum Red/Blue Interval Matching with Application

      • Danny Z. Chen, Xiaobo Sharon Hu, Xiaodong Wu
      Pages 150-158

    8. Computing Farthest Neighbors on a Convex Polytope

      • Otfried Cheong, Chan-Su Shin, Antoine Vigneron
      Pages 159-169

    9. Finding an Optimal Bridge between Two Polygons

      • Xuehou Tan
      Pages 170-180
Back to top

Keywords

Editors and Affiliations

  • Department of Computer Science, University of Massachusetts, Lowell, USA

    Jie Wang

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation