Skip to main content
SpringerLink
Log in

Computing and Combinatorics

13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings

  • Conference proceedings
  • © 2007

Overview

Editors:
  1. Guohui Lin
    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 4598)

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

Included in the following conference series:

Conference proceedings info: COCOON 2007.

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. Front Matter

    Download chapter PDF

  2. The Combinatorics of Sequencing the Corn Genome

    • Srinivas Aluru
    Pages 1-1

  3. Online Frequency Assignment in Wireless Communication Networks

    • Francis Y. L. Chin
    Pages 2-2

  4. Information Distance from a Question to an Answer

    • Ming Li
    Pages 3-3

  5. A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy

    • Danny Z. Chen, Mark A. Healy, Chao Wang, Xiaodong Wu
    Pages 4-15

  6. A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem

    • Yufeng Wu, Dan Gusfield
    Pages 16-26

  7. Seed-Based Exclusion Method for Non-coding RNA Gene Search

    • Jean-Eudes Duchesne, Mathieu Giraud, Nadia El-Mabrouk
    Pages 27-39

  8. A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method

    • Lei Xin, Bin Ma, Kaizhong Zhang
    Pages 40-50

  9. Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data

    • Dan Gusfield, Yelena Frid, Dan Brown
    Pages 51-64

  10. Improved Exact Algorithms for Counting 3- and 4-Colorings

    • Fedor V. Fomin, Serge Gaspers, Saket Saurabh
    Pages 65-74

  11. Connected Coloring Completion for General Graphs: Algorithms and Complexity

    • Benny Chor, Michael Fellows, Mark A. Ragan, Igor Razgon, Frances Rosamond, Sagi Snir
    Pages 75-85

  12. Quadratic Kernelization for Convex Recoloring of Trees

    • Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
    Pages 86-96

  13. On the Number of Cycles in Planar Graphs

    • Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel
    Pages 97-107

  14. An Improved Exact Algorithm for Cubic Graph TSP

    • Kazuo Iwama, Takuya Nakashima
    Pages 108-117

  15. Geometric Intersection Graphs: Do Short Cycles Help?

    • Jan Kratochvíl, Martin Pergel
    Pages 118-128

  16. Dimension, Halfspaces, and the Density of Hard Sets

    • Ryan C. Harkins, John M. Hitchcock
    Pages 129-139

  17. Isolation Concepts for Enumerating Dense Subgraphs

    • Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier
    Pages 140-150

  18. Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O(n 4) Time

    • Christian Ledergerber, Christophe Dessimoz
    Pages 151-164

  19. Counting Minimum Weighted Dominating Sets

    • Fedor V. Fomin, Alexey A. Stepanov
    Pages 165-175

  20. Online Interval Scheduling: Randomized and Multiprocessor Cases

    • Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng
    Pages 176-186
Back to top

Other volumes

  1. Computing and Combinatorics

Keywords

About this book

The Annual International Computing and Combinatorics Conference is an annual forum for exploring research, development, and novel applications of computing and combinatorics. It brings together researchers, professionals and industrial practitioners to interact and exchange knowledge, ideas and progress. Thetopics covermost aspects oftheoreticalcomputer scienceand combinatorics related to computing. The 13th Annual International Computing and Com- natorics Conference (COCOON 2007) was held in Ban?, Alberta during July 16–19, 2007. This was the ?rst time that COCOON was held in Canada. We received 165 submissions, among which 11 were withdrawn for various reasons. The remaining 154 submissions under full consideration came from 33 countries and regions: Australia, Brazil, Canada, China, the Czech Republic, Denmark, Finland, France, Germany, Greece, Hong Kong, India, Iran, Ireland, Israel, Italy, Japan, the Netherlands, Norway, Pakistan, Poland, Romania, R- sia, Slovakia, South Korea, Spain, Sweden, Switzerland, Taiwan, Turkey, the UK, the USA, and the US minor outlying islands. Afterasixweekperiodofcarefulreviewinganddiscussions,theprogramc- mittee accepted 51 submissions for oral presentation at the conference. Based on the a?liations, 1. 08 of the accepted papers were from Australia, 7. 67 from Canada, 3. 08 from China, 1 from the Czech Republic, 2 from Denmark, 1 from France, 5. 42 from Germany, 0. 08 from Greece, 2. 18 from Hong Kong, 0. 33 from India, 0. 17 from Ireland, 1. 83 from Israel, 1. 5fromItaly,2. 9 from Japan, 0. 17 from the Netherlands, 2. 67 from Norway, 0.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation