Table of contents

  1. Front Matter
  2. Matthew Andrews, Michel X. Goemans, Lisa Zhang
    Pages 1-10
  3. Tsan-sheng Hsu, Ku-Hui Tsai, Da-Wei Wang, D. T. Lee
    Pages 21-30
  4. Efstratios Karaivazoglou, Paul Spirakis, Vasilis Triantafilou
    Pages 31-40
  5. Hanno Lefmann, Pavel Pudlák, Petr Savický
    Pages 41-49
  6. Zhixiang Chen, Carlos Cunha, Steven Homer
    Pages 50-55
  7. H. K. Dai, K. E. Flannery
    Pages 56-67
  8. Giuseppe Di Battista, Roberto Tamassia, Luca Vismara
    Pages 81-91
  9. Saidur Rahman, Shin-ichi Nakano, Takao Nishizeki
    Pages 92-105
  10. Chan-Su Shin, Sung Kwon Kim, Kyung-Yong Chwa
    Pages 106-116
  11. Oswin Aichholzer, Franz Aurenhammer
    Pages 117-126
  12. Gruia Călinescu, Cristina G. Fernandes
    Pages 152-161
  13. Farhad Shahrokhi, Weiping Shi
    Pages 162-168

About these proceedings

Introduction

This book constitutes the proceedings of the Second Annual International Conference on Computing and Combinatorics, COCOON '96, held in June 1996 in Hong Kong.
The 44 papers presented in the book in revised version were carefully selected from a total of 82 submissions. They describe state-of-the-art research results from various areas of theoretical computer science, combinatorics related to computing, and experimental analysis of algorithms; computational graph theory, computational geometry, and networking issues are particularly well-presented.

Keywords

Algorithmen Algorithmische Geometrie Combinatorics Complexity Computational Geometry Graph Graph theory Kombinatorik Komplexität algorithm algorithms

Bibliographic information

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