Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9627)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: WALCOM 2016.
Buy print copy
About this book
The 27 full papers presented together with 4 invited talks were carefully reviewed and selected from 68 submissions. The papers cover a wide range of topics such as approximation algorithms, computational complexity, computational geometry, data structures, graph algorithms, graph coloring, graph exploration, and online algorithms.
Similar content being viewed by others
Keywords
- approximation algorithms
- computational complexity
- data structures
- graph algorithms
- online algorithms
- analysis of algorithms
- combinatorial
- algorithms
- combinatorial optimization
- computational geometry
- distributed algorithms
- fully dynamic graphs
- graph coloring
- graph drawing
- graph exploration
- oblivious
- parameterized complexity
- recursion
- relaxation
- stringology
Table of contents (28 papers)
-
Invited Talk
-
Graphs Coloring
-
Graphs Algorithms
-
Computational Geometry
Other volumes
-
WALCOM: Algorithms and Computation
Editors and Affiliations
Bibliographic Information
Book Title: WALCOM: Algorithms and Computation
Book Subtitle: 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings
Editors: Mohammad Kaykobad, Rossella Petreschi
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-30139-6
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2016
Softcover ISBN: 978-3-319-30138-9Published: 22 February 2016
eBook ISBN: 978-3-319-30139-6Published: 08 March 2016
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIX, 362
Number of Illustrations: 82 illustrations in colour
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Math Applications in Computer Science, Symbolic and Algebraic Manipulation, Computer Graphics, Algorithms