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

Access provided by Autonomous University of Puebla

Download book PDF

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.

Buy print copy

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

Keywords

Table of contents (54 papers)

  1. Session B

    1. Algorithms for Security and Systems

      1. Efficient Partially Blind Signature Scheme with Provable Security
        • Zheng Gong, Xiangxue Li, Kefei Chen
        Pages 378-386
        Download chapter PDF
      2. A Rigorous Analysis for Set-Up Time Models – A Metric Perspective
        • Eitan Bachmat, Tao Kai Lam, Avner Magen
        Pages 387-397
        Download chapter PDF

    2. Discrete Geometry and Graph Theory

      1. Geometric Representation of Graphs in Low Dimension
        • L. Sunil Chandran, Naveen Sivadasan
        Pages 398-407
        Download chapter PDF
      2. The On-Line Heilbronn’s Triangle Problem in <i>d</i> Dimensions
        • Gill Barequet, Alina Shaikhet
        Pages 408-417
        Download chapter PDF
      3. Counting <i>d</i>-Dimensional Polycubes and Nonrectangular Planar Polyominoes
        • Gadi Aleksandrowicz, Gill Barequet
        Pages 418-427
        Download chapter PDF

    4. Computational Complexity and Computability

      1. Overlap-Free Regular Languages
        • Yo-Sub Han, Derick Wood
        Pages 469-478
        Download chapter PDF
      2. On the Combinatorial Representation of Information
        • Joel Ratsaby
        Pages 479-488
        Download chapter PDF
      3. Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard
        • Jesper Torp Kristensen, Peter Bro Miltersen
        Pages 489-496
        Download chapter PDF

    5. Experimental Algorithms

      1. Bimodal Crossing Minimization
        • Christoph Buchheim, Michael Jünger, Annette Menze, Merijam Percan
        Pages 497-506
        Download chapter PDF
      2. Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
        • Christoph Buchheim, Lanbo Zheng
        Pages 507-516
        Download chapter PDF
      3. On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem
        • Dae-Sik Choi, In-Chan Choi
        Pages 517-526
        Download chapter PDF

  2. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Computing and Combinatorics

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