Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
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
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

Keywords

Table of contents (54 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. The Unpredictable Deviousness of Models

      • Franco P. Preparata
      Pages 1-1

    2. Security Issues in Collaborative Computing

      • Mikhail J. Atallah
      Pages 2-2

  3. Session A

    1. Computational Economics, Finance, and Management

      1. A Simplicial Approach for Discrete Fixed Point Theorems
        • Xi Chen, Xiaotie Deng
        Pages 3-12
      2. On Incentive Compatible Competitive Selection Protocol
        • Xi Chen, Xiaotie Deng, Becky Jie Liu
        Pages 13-22
      3. Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands
        • George Karakostas, Stavros G. Kolliopoulos
        Pages 23-32
      4. Aggregating Strategy for Online Auctions
        • Shigeaki Harada, Eiji Takimoto, Akira Maruoka
        Pages 33-41

    2. Graph Algorithms

      1. On Indecomposability Preserving Elimination Sequences
        • Chandan K. Dubey, Shashank K. Mehta
        Pages 42-51
      2. Improved Algorithms for the Minmax Regret 1-Median Problem
        • Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang
        Pages 52-62
      3. Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
        • Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
        Pages 63-72
      4. Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
        • Min Chih Lin, Jayme L. Szwarcfiter
        Pages 73-82

    3. Computational Complexity and Computability

      1. Varieties Generated by Certain Models of Reversible Finite Automata
        • Marats Golovkins, Jean-Eric Pin
        Pages 83-93
      2. Iterated TGR Languages: Membership Problem and Effective Closure Properties
        • Ian McQuillan, Kai Salomaa, Mark Daley
        Pages 94-103
      3. On the Negation-Limited Circuit Complexity of Sorting and Inverting <i>k</i>-tonic Sequences
        • Takayuki Sato, Kazuyuki Amano, Akira Maruoka
        Pages 104-115

    4. Quantum Computing

      1. Robust Quantum Algorithms with <i>ε</i>-Biased Oracles
        • Tomoya Suzuki, Shigeru Yamashita, Masaki Nakanishi, Katsumasa Watanabe
        Pages 116-125
      2. The Complexity of Black-Box Ring Problems
        • V. Arvind, Bireswar Das, Partha Mukhopadhyay
        Pages 126-135

    5. Computational Biology and Medicine

      1. Lower Bounds and Parameterized Approach for Longest Common Subsequence
        • Xiuzhen Huang
        Pages 136-145
      2. Finding Patterns with Variable Length Gaps or Don’t Cares
        • M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth
        Pages 146-155
      3. The Matrix Orthogonal Decomposition Problem in Intensity-Modulated Radiation Therapy
        • Xin Dou, Xiaodong Wu, John E. Bayouth, John M. Buatti
        Pages 156-165

    6. Computational Geometry

      1. A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
        • Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, Alexander Wolff
        Pages 166-175
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