Computing and Combinatorics

17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings

  • Bin Fu
  • Ding-Zhu Du
Conference proceedings COCOON 2011

DOI: 10.1007/978-3-642-22685-4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6842)

Table of contents (55 papers)

  1. Front Matter
  2. Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
    Pages 1-12
  3. Shuji Kijima, Yoshio Okamoto, Takeaki Uno
    Pages 13-24
  4. Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner
    Pages 25-36
  5. Malte Brinkmeyer, Thasso Griebel, Sebastian Böcker
    Pages 37-48
  6. Daming Zhu, Shaohan Ma, Pingping Zhang
    Pages 49-61
  7. Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Francis C. M. Lau
    Pages 74-85
  8. Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou
    Pages 86-97
  9. Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
    Pages 98-109
  10. Yunlong Liu, Jianxin Wang, Jiong Guo, Jianer Chen
    Pages 110-121
  11. Desh Ranjan, John Savage, Mohammad Zubair
    Pages 134-145
  12. Dmitry Gavinsky, Martin Roetteler, Jérémie Roland
    Pages 158-167
  13. Andrei Asinowski, Gill Barequet, Ronnie Barequet, Günter Rote
    Pages 180-191
  14. Ovidiu Daescu, Wenqi Ju, Jun Luo, Binhai Zhu
    Pages 192-203
  15. Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das
    Pages 213-224

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 16th Annual International Conference on Computing and Combinatorics, held in Dallas, TX, USA, in August 2011. The 54 revised full papers presented were carefully reviewed and selected from 136 submissions. Topics covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization; parallel and distributed computing.

Keywords

algorithmic geometry algorithmic learning combinatorial optimization discrete mathematics graph algorithms graph computation network computation

Editors and affiliations

  • Bin Fu
    • 1
  • Ding-Zhu Du
    • 2
  1. 1.Department of Computer ScienceUniversity of Texas-Pan AmericanEdinburgUSA
  2. 2.Department of Computer ScienceUniversity of Texas at DallasRichardsonUSA

Bibliographic information

  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-22684-7
  • Online ISBN 978-3-642-22685-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349