Table of contents

  1. Front Matter
  2. Uri Zwick, Michael S. Paterson
    Pages 1-10
  3. Kazuo Iwama, Shuichi Miyazaki
    Pages 11-20
  4. Qing -Wen Feng, Robert F. Cohen, Peter Eades
    Pages 21-30
  5. Tiziana Calamoneri, Rossella Petreschi
    Pages 31-40
  6. V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan
    Pages 71-80
  7. Edward P. F. Chan, Ron van der Meyden
    Pages 81-90
  8. Seung Jin Lim, Yiu-Kai Ng
    Pages 101-110
  9. Andrzej Lingas
    Pages 121-130
  10. Joseph L. Ganley, Mordecai J. Golin, Jeffrey S. Salowe
    Pages 141-150
  11. Jianer Chen
    Pages 151-160
  12. Divyakant Agrawal, Ömer Eğecioğlu, Amr El Abbadi
    Pages 161-170
  13. Guoxiang Huang
    Pages 181-190

About these proceedings

Introduction

This book constitutes the proceedings of the First Annual International Conference on Computing and Combinatorics, COCOON '95, held in Xi'an, China in August 1995.
The 52 thoroughly refereed full papers and the 22 short presentations included in this volume were selected from a total of 120 submissions. All current aspects of theoretical computer science and combinatorial mathematics related to computing are addressed; in particular, there are sections on complexity theory, graph drawing, computational geometry, databases, graph algorithms, distributed programming and logic, combinatorics, machine models, combinatorial designs, algorithmic learning, algorithms, distributed computing, and scheduling.

Keywords

Combinatorics Erfüllbarkeitsproblem der Aussagenlogik Layout algorithm algorithms automata complexity complexity theory computational geometry data structure distributed computing distributed programming logic optimization programming

Bibliographic information

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