Advertisement

Computing and Combinatorics

20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings

  • Zhipeng Cai
  • Alex Zelikovsky
  • Anu Bourgeois
Conference proceedings COCOON 2014

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

Table of contents

  1. Front Matter
  2. Sampling and Randomized Methods

    1. Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
      Pages 1-12
    2. Vladimir Braverman, Gregory Vorsanger
      Pages 13-24
    3. Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
      Pages 25-36
  3. Logic, Algebra and Automata

    1. Chia-Jung Lee, Shi-Chun Tsai, Ming-Chuan Yang
      Pages 49-60
    2. Nan Zhang, Zhenhua Duan, Cong Tian
      Pages 71-83
    3. Zhenhua Duan, Cong Tian, Nan Zhang
      Pages 84-93
  4. Database and Data Structures

    1. Weitian Tong, Randy Goebel, Guohui Lin
      Pages 94-103
    2. Haitao Wang, Jingru Zhang
      Pages 104-115
    3. Michael A. Bender, Rezaul A. Chowdhury, Pramod Ganapathi, Samuel McCauley, Yuan Tang
      Pages 116-128
    4. Christine Chung, Shenoda Guirguis, Anastasia Kurdia
      Pages 129-140
  5. Parameterized Complexity and Algorithms(I)

    1. Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
      Pages 141-153
    2. Peng Sun, Jiong Guo, Jan Baumbach
      Pages 154-165
    3. Jiong Guo, Yash Raj Shrestha
      Pages 166-178
    4. Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra
      Pages 179-190
  6. Computational Complexity

    1. Thomas Holenstein, Robin Künzler
      Pages 191-202
    2. Thomas Holenstein, Robin Künzler
      Pages 203-214
    3. Jacob Hendricks, Matthew J. Patitz, Trent A. Rogers, Scott M. Summers
      Pages 215-226
  7. Computational Biology and Computational Geometry

    1. Zhaoming Yin, Jijun Tang, Stephen W. Schaeffer, David A. Bader
      Pages 227-238
    2. Eli Fox-Epstein, Csaba D. Tóth, Andrew Winslow
      Pages 239-250
    3. Meng-Huan Liou, Sheung-Hung Poon, Yu-Jie Wei
      Pages 251-262
  8. Parameterized Complexity and Algorithms(II)

    1. Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth
      Pages 263-275
    2. Xianmin Liu, Jianzhong Li, Hong Gao
      Pages 276-287
    3. Minghui Jiang, Haitao Wang
      Pages 288-299
    4. Benjamin A. Burton, William Pettersson
      Pages 300-311
  9. Approximation Algorithm(I)

  10. Approximation Algorithm(II)

    1. Michael A. Schuh, Tim Wylie, Chang Liu, Rafal A. Angryk
      Pages 369-380
    2. Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang
      Pages 381-392
    3. Subhankar Mishra, Thang N. Dinh, My T. Thai, Incheol Shin
      Pages 393-404
  11. Graph Theory and Algorithms(I)

    1. Akira Suzuki, Amer E. Mouawad, Naomi Nishimura
      Pages 405-416
    2. Binay Bhattacharya, Minati De, Tsunehiko Kameda, Sasanka Roy, Vladyslav Sokol, Zhao Song
      Pages 417-428
    3. François Le Gall, Harumichi Nishimura, Seiichiro Tani
      Pages 429-440
  12. Approximation Algorithm(III)

    1. Di Wu, Zhao Zhang, Weili Wu, Xiaohui Huang
      Pages 441-452
    2. Masoud Omran, Jörg-Rüdiger Sack
      Pages 453-464
    3. Farzad Farnoud (Hassanzadeh), Eitan Yaakobi, Jehoshua Bruck
      Pages 465-476
  13. Graph Theory and Algorithms(II)

    1. Konrad Kazimierz Dabrowski, Daniël Paulusma
      Pages 489-500
    2. Evangelos Kranakis, Gennady Shaikhet
      Pages 501-512
  14. Game Theory and Cryptography

    1. Vittorio Bilò, Mauro Paladini
      Pages 513-524
    2. Pierre-Alain Fouque, Jean-Christophe Zapalowicz
      Pages 525-536
    3. Bryce Sandlund, Kerrick Staley, Michael Dixon, Steve Butler
      Pages 537-546
  15. Scheduling Algorithms and Circuit Complexity

    1. Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie et al.
      Pages 559-571

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 20th International Conference on Computing and Combinatorics, COCOON 2014, held in Atlanta, GA, USA, in August 2014. The 51 revised full papers presented were carefully reviewed and selected from 110 submissions. There was a co-organized workshop on computational social networks (CSoNet 2014) where 8 papers were accepted. The papers cover the following topics: sampling and randomized methods; logic, algebra and automata; database and data structures; parameterized complexity and algorithms; computational complexity; computational biology and computational geometry; approximation algorithm; graph theory and algorithms; game theory and cryptography; scheduling algorithms and circuit complexity and CSoNet.

Keywords

approximation algorithms data mining formal methods markov chain monte carlo methods parameterized complexity pseudorandom generators resampling methods sensors social networks streaming algorithms

Editors and affiliations

  • Zhipeng Cai
    • 1
  • Alex Zelikovsky
    • 2
  • Anu Bourgeois
    • 3
  1. 1.Department of Computer ScienceGeorgia State UniversityAtlantaUSA
  2. 2.Department of Computer ScienceGeorgia State UniversityAtlantaUSA
  3. 3.Department of Computer ScienceGeorgia State UniversityAtlantaUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-08783-2
  • Copyright Information Springer International Publishing Switzerland 2014
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-08782-5
  • Online ISBN 978-3-319-08783-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Energy, Utilities & Environment
Engineering