Skip to main content
SpringerLink
Log in

Computing and Combinatorics

12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Danny Z. Chen

    1. Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. D. T. Lee

    1. Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan

    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 4112)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: COCOON 2006.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.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 (54 papers)

  1. Session A

    1. Computational Geometry

      1. A PTAS for Cutting Out Polygons with Lines
        • Sergey Bereg, Ovidiu Daescu, Minghui Jiang
        Pages 176-185
      2. On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
        • Sheung-Hung Poon
        Pages 186-195
      3. Restricted Mesh Simplification Using Edge Contractions
        • Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
        Pages 196-204

    2. Graph Theory

      1. Enumerating Non-crossing Minimally Rigid Frameworks
        • David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
        Pages 205-215
      2. Sequences Characterizing <i>k</i>-Trees
        • Zvi Lotker, Debapriyo Majumdar, N. S. Narayanaswamy, Ingmar Weber
        Pages 216-225
      3. On the Threshold of Having a Linear Treewidth in Random Graphs
        • Yong Gao
        Pages 226-234

    3. Computational Biology

      1. Reconciling Gene Trees with Apparent Polytomies
        • Wen-Chieh Chang, Oliver Eulenstein
        Pages 235-244
      2. Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes
        • Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu
        Pages 245-254
      3. Computing Maximum-Scoring Segments in Almost Linear Time
        • Fredrik Bengtsson, jingsen Chen
        Pages 255-264

  2. Session B

    1. Graph Algorithms and Applications

      1. Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
        • Daniel Mölle, Stefan Richter, Peter Rossmanith
        Pages 265-273
      2. A Detachment Algorithm for Inferring a Graph from Path Frequency
        • Hiroshi Nagamochi
        Pages 274-283
      3. The <i>d</i>-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm
        • Ying Xiao, Christoforos Hadjicostis, Krishnaiyan Thulasiraman
        Pages 284-298
      4. Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
        • Iyad A. Kanj, Luay Nakhleh, Ge Xia
        Pages 299-308

    2. On-Line Algorithms

      1. On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
        • Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yung
        Pages 309-319
      2. Improved On-Line Broadcast Scheduling with Deadlines
        • Feifeng Zheng, Stanley P. Y. Fung, Wun-Tat Chan, Francis Y. L. Chin, Chung Keung Poon, Prudence W. H. Wong
        Pages 320-329
      3. A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast
        • Regant Y. S. Hung, H. F. Ting
        Pages 330-339
      4. On Lazy Bin Covering and Packing Problems
        • Mingen Lin, Yang Yang, Jinhui Xu
        Pages 340-349

    3. Graph Theory

      1. Creation and Growth of Components in a Random Hypergraph Process
        • Vlady Ravelomanana, Alphonse Laza Rijamamy
        Pages 350-359
      2. Optimal Acyclic Edge Colouring of Grid Like Graphs
        • Rahul Muthu, N. Narayanan, C. R. Subramanian
        Pages 360-367
      3. An Edge Ordering Problem of Regular Hypergraphs
        • Hongbing Fan, Robert Kalbfleisch
        Pages 368-377
Back to top

Other volumes

  1. Computing and Combinatorics

Keywords

Editors and Affiliations

  • Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA

    Danny Z. Chen

  • Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan

    D. T. Lee

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation