WALCOM: Algorithms and Computation
14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings
Editors: M. Sohel, Rahman, Sadakane, Kunihiko, Sung, Wing-Kin (Eds.)
Free PreviewBuy this book
- About this book
-
This book constitutes the refereed proceedings of the 14th International Conference on Algorithms and Computation, WALCOM 2020, held in Singapore in March/April 2020.
The 23 full and 4 short papers presented were carefully reviewed and selected from 66 submissions. The papers focus on algorithmic graph theory and combinatorics, computational biology, computational geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, network optimization.
- Table of contents (30 chapters)
-
-
Drawing Planar Graphs
Pages 3-14
-
Space Efficient Separator Algorithms for Planar Graphs
Pages 15-21
-
Recent Progresses in the Combinatorial and Algorithmic Study of Rooted Phylogenetic Networks
Pages 22-27
-
Optimum Algorithm for the Mutual Visibility Problem
Pages 31-42
-
Routing in Histograms
Pages 43-54
-
Table of contents (30 chapters)
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- WALCOM: Algorithms and Computation
- Book Subtitle
- 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings
- Editors
-
- Rahman M. Sohel
- Kunihiko Sadakane
- Wing-Kin Sung
- Series Title
- Theoretical Computer Science and General Issues
- Series Volume
- 12049
- Copyright
- 2020
- Publisher
- Springer International Publishing
- Copyright Holder
- Springer Nature Switzerland AG
- eBook ISBN
- 978-3-030-39881-1
- DOI
- 10.1007/978-3-030-39881-1
- Softcover ISBN
- 978-3-030-39880-4
- Edition Number
- 1
- Number of Pages
- XIII, 350
- Number of Illustrations
- 85 b/w illustrations, 55 illustrations in colour
- Topics
