Computing and Combinatorics
First Annual International Conference, COCOON '95, Xi'an, China, August 24-26, 1995. Proceedings
Editors: Du, Ding-Zhu, Li, Ming (Eds.)
Free PreviewBuy this book
- About this book
-
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.
- Table of contents (77 chapters)
-
-
The complexity of mean payoff games
Pages 1-10
-
Approximation of coNP sets by NP-complete sets
Pages 11-20
-
How to draw a planar clustered graph
Pages 21-30
-
An efficient orthogonal grid drawing algorithm for cubic graphs
Pages 31-40
-
Constrained independence system and triangulations of planar point sets
Pages 41-50
-
Table of contents (77 chapters)
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- Computing and Combinatorics
- Book Subtitle
- First Annual International Conference, COCOON '95, Xi'an, China, August 24-26, 1995. Proceedings
- Editors
-
- Ding-Zhu Du
- Ming Li
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- 959
- Copyright
- 1995
- Publisher
- Springer-Verlag Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- eBook ISBN
- 978-3-540-44733-7
- DOI
- 10.1007/BFb0030813
- Softcover ISBN
- 978-3-540-60216-3
- Series ISSN
- 0302-9743
- Edition Number
- 1
- Number of Pages
- XIV, 662
- Topics
