Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 10167)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: WALCOM 2017.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents(36 papers)
-
Invited Talk
-
Computational Geometry I
-
Graph Algorithms I
Other volumes
-
WALCOM: Algorithms and Computation
Keywords
- approximation algorithms
- combinatorial optimization
- computational complexity
- graph algorithms
- theory of computation
- clustering
- computational geometry
- dynamic graphs
- graph drawing
- oblivious
- parameterized complexity
- pathwidth
- polygonal obstacle
- resolution size
- satisfiability
- simple-triangle graphs
- space-efficient algorithms
- structure analysis
- submodularity
- swarm robots
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.
Editors and Affiliations
-
Universiti Teknologi Brunei, Bandar Seri Begawan, Brunei Darussalam
Sheung-Hung Poon
-
Bangladesh University of Engineering and Technology, Dhaka, Bangladesh
Md. Saidur Rahman
-
National Taiwan University, Taipei, Taiwan
Hsu-Chun Yen
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: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-53925-6
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing AG 2017
Softcover ISBN: 978-3-319-53924-9Published: 21 February 2017
eBook ISBN: 978-3-319-53925-6Published: 18 February 2017
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XXII, 474
Number of Illustrations: 109 b/w illustrations
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Numeric Computing, Math Applications in Computer Science, Computer Graphics, Algorithms