Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2009

Computing and Combinatorics

15th Annual International Conference, COCOON 2009 Niagara Falls, NY, USA, July 13-15, 2009 Proceedings

Editors:

  1. Hung Q. Ngo

    1. Computer Science and Engineering Department, State University of New York at Buffalo, Amherst, 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 5609)

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

Conference series link(s): COCOON: International Computing and Combinatorics Conference

Conference proceedings info: COCOON 2009.

Sections

Buy it now

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

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

Table of contents (52 papers)

  1. Computational Geometry

    1. Convex Partitions with 2-Edge Connected Dual Graphs

      • Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth
      Pages 192-204

    2. The Closest Pair Problem under the Hamming Metric

      • Kerui Min, Ming-Yang Kao, Hong Zhu
      Pages 205-214

    3. Space Efficient Multi-dimensional Range Reporting

      • Marek Karpinski, Yakov Nekrich
      Pages 215-224

  2. Approximation Algorithms

    1. Approximation Algorithms for a Network Design Problem

      • Binay Bhattacharya, Yuzhuang Hu, Qiaosheng Shi
      Pages 225-237

    2. An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates

      • George Karakostas, Stavros G. Kolliopoulos, Jing Wang
      Pages 238-248

    3. On the Hardness and Approximability of Planar Biconnectivity Augmentation

      • Carsten Gutwenger, Petra Mutzel, Bernd Zey
      Pages 249-257

  3. Computational Biology and Bioinformatics

    1. Determination of Glycan Structure from Tandem Mass Spectra

      • Sebastian Böcker, Birte Kehr, Florian Rasche
      Pages 258-267

    2. On the Generalised Character Compatibility Problem for Non-branching Character Trees

      • Ján Maňuch, Murray Patterson, Arvind Gupta
      Pages 268-276

    3. Inferring Peptide Composition from Molecular Formulas

      • Sebastian Böcker, Anton Pervukhin
      Pages 277-286

    4. Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection

      • Rastislav Å rámek, Bernd Fischer, Elias Vicari, Peter Widmayer
      Pages 287-296

    5. Computing Bond Types in Molecule Graphs

      • Sebastian Böcker, Quang B. A. Bui, Patrick Seeber, Anke Truss
      Pages 297-306

  4. Sampling and Learning

    1. On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries

      • Ivona Bezáková, Nayantara Bhatnagar, Dana Randall
      Pages 307-316

    2. Finding a Level Ideal of a Poset

      • Shuji Kijima, Toshio Nemoto
      Pages 317-327

    4. Extracting Computational Entropy and Learning Noisy Linear Functions

      • Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai
      Pages 338-347

    5. HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank

      • Enoch Peserico, Luca Pretto
      Pages 348-357

  5. Algorithms

    1. Online Tree Node Assignment with Resource Augmentation

      • Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang
      Pages 358-367

    2. Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well

      • Kenneth A. Berman, Chad Yoshikawa
      Pages 368-377

    3. On Finding Small 2-Generating Sets

      • Isabelle Fagnot, Guillaume Fertin, Stéphane Vialette
      Pages 378-387

    4. Convex Recoloring Revisited: Complexity and Exact Algorithms

      • Iyad A. Kanj, Dieter Kratsch
      Pages 388-397
Back to top

Other Volumes

  1. Computing and Combinatorics

Back to top

Keywords

Back to top

Editors and Affiliations

  • Computer Science and Engineering Department, State University of New York at Buffalo, Amherst, USA

    Hung Q. Ngo

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation