Computing and Combinatorics

18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings

  • Joachim Gudmundsson
  • Julián Mestre
  • Taso Viglas
Conference proceedings COCOON 2012
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7434)

Table of contents

  1. Front Matter
  2. Binay Bhattacharya, Tsunehiko Kameda
    Pages 1-12
  3. Ragesh Jaiswal, Amit Kumar, Sandeep Sen
    Pages 13-24
  4. Evripidis Bampis, Dimitrios Letsios, Ioannis Milis, Georgios Zois
    Pages 25-36
  5. Peter Floderus, Mirosław Kowaluk, Andrzej Lingas, Eva-Marta Lundell
    Pages 37-48
  6. Xin Han, Yasushi Kawase, Kazuhisa Makino
    Pages 61-73
  7. Mingyu Xiao, Hiroshi Nagamochi
    Pages 74-85
  8. Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
    Pages 86-97
  9. Monaldo Mastrolilli, Georgios Stamoulis
    Pages 98-108
  10. Maxim A. Babenko, Kamil Salikhov, Stepan Artamonov
    Pages 109-120
  11. Jean-François Couturier, Pinar Heggernes, Pim van ’t Hof, Yngve Villanger
    Pages 133-144
  12. L. Sunil Chandran, Deepak Rajendraprasad
    Pages 181-192
  13. Rémy Belmonte, Pinar Heggernes, Pim van ’t Hof, Reza Saei
    Pages 204-215
  14. Oswin Aichholzer, Matias Korman, Alexander Pilz, Birgit Vogtenhuber
    Pages 216-227

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012.
The 50 revised full papers presented were carefully reviewed and selected from 121 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.

Keywords

approximation data structure one-way function pseudorandom generator traveling salesman problem

Editors and affiliations

  • Joachim Gudmundsson
    • 1
  • Julián Mestre
    • 1
  • Taso Viglas
    • 1
  1. 1.School of ITUniversity of SydneySydneyAustralia

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-32241-9
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-32240-2
  • Online ISBN 978-3-642-32241-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book