WALCOM: Algorithms and Computation
11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017, Proceedings
Editors: Poon, Sheung-Hung, Rahman, Md. Saidur, Yen, Hsu-Chun (Eds.)
Free PreviewBuy this book
- About this book
-
This book constitutes the proceedings of the 11th International Workshop on Algorithms and Computation, WALCOM 2017, held in Hsinchu, Taiwan, in March 2017.
The 35 full papers presented together with three invited talks were carefully reviewed and selected from 83 submissions. The papers are organized in topical sections on invited talks; computational geometry; combinatorial optimization; graph drawing; graph algorithms; space-efficient algorithms; computational complexity; approximation algorithms.
- Table of contents (36 chapters)
-
-
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
Pages 3-15
-
Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns
Pages 19-29
-
Dynamic Sum-Radii Clustering
Pages 30-41
-
How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments
Pages 42-53
-
On Guarding Orthogonal Polygons with Sliding Cameras
Pages 54-65
-
Table of contents (36 chapters)
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- WALCOM: Algorithms and Computation
- Book Subtitle
- 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017, Proceedings
- Editors
-
- Sheung-Hung Poon
- Md. Saidur Rahman
- Hsu-Chun Yen
- Series Title
- Theoretical Computer Science and General Issues
- Series Volume
- 10167
- Copyright
- 2017
- Publisher
- Springer International Publishing
- Copyright Holder
- Springer International Publishing AG
- eBook ISBN
- 978-3-319-53925-6
- DOI
- 10.1007/978-3-319-53925-6
- Softcover ISBN
- 978-3-319-53924-9
- Edition Number
- 1
- Number of Pages
- XXII, 474
- Number of Illustrations
- 109 b/w illustrations
- Topics
