Computing and Combinatorics

10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004. Proceedings

  • Kyung-Yong Chwa
  • J. Ian J. Munro
Conference proceedings COCOON 2004
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3106)

Table of contents

  1. Front Matter
  2. Invited Presentations

  3. Data Structures and Algorithms I

  4. Computational Geometry I

    1. Francis Y. L. Chin, Jianbo Qian, Cao An Wang
      Pages 53-61
    2. Udo Adamy, Michael Hoffmann, József Solymosi, Miloš Stojaković
      Pages 62-71
  5. Games and Combinatorics

    1. Małgorzata Moczurad, Włodzimierz Moczurad
      Pages 72-81
    2. Ferdinando Cicalese, Christian Deppe, Daniele Mundici
      Pages 82-91
    3. Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki
      Pages 92-101
  6. Combinatorial Optimization I

  7. Graph Algorithms

    1. Tomokazu Imamura, Kazuo Iwama, Tatsuie Tsukiji
      Pages 132-142
    2. L. Sunil Chandran, N. S. Narayanaswamy
      Pages 151-160
    3. Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi
      Pages 161-170

About these proceedings

Introduction

Thepapersinthisvolumewereselectedforpresentationatthe10thInternational Computing and Combinatorics Conference (COCOON 2004), held on August 17–20, 2004 in Jeju Island, Korea. Previous meetings were held in Xi’an (1995), HongKong(1996),Shanghai(1997),Taipei(1998),Tokyo(1999),Sydney(2000), Guilin (2001), Singapore (2002), and Big Sky (2003). In response to the call for papers, 109 extended abstracts were submitted from 23 countries, of which 46 were accepted. The submitted papers were from Belgium (1), Canada (5), China (6), France (1), Germany (6), Hong Kong (8), India (6), Iran (1), Ireland (1), Israel (4), Italy (2), Japan (17), Korea (23), Mexico (3), New Zealand (1), Poland(1), Russia (1), Singapore (5), Sweden (2), Switzerland (3), Taiwan (2), the UK (1), and the USA (9). Each paper was evaluated by at least three program committee members, with the assistance of referees, as indicated by the referee list found in these proceedings. There were many more acceptable papers than there was space available in the conference schedule, and the program committee’s task was extremely di?cult. In addition to selected papers, the conference also included threeinvitedpresentationsbyLarsArge,JeongHanKim,andKokichiSugihara. We thank all program committee members and their referees for their - cellent work, especially given the demanding time constraints; they gave the conference its distinctive character. We thank all who submitted papers for c- sideration: they all contributed to the high quality of the conference. Finally,wethankallthepeoplewhoworkedhardtoputinplacethelogistical arrangements of the conference — our colleagues and our graduate students. It is their hard work that made the conference possible and enjoyable.

Keywords

Automat algorithms automata combinatorial optimization complexity complexity theory computational geometry data structures optimization

Editors and affiliations

  • Kyung-Yong Chwa
    • 1
  • J. Ian J. Munro
    • 2
  1. 1.Division of Computer ScienceKorea Advanced Institute of Science and TechnologyDaejeonRepublic of Korea
  2. 2.Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada

Bibliographic information

  • DOI https://doi.org/10.1007/b99243
  • Copyright Information Springer-Verlag Berlin Heidelberg 2004
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-22856-1
  • Online ISBN 978-3-540-27798-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book