Overview
- Mohammad Kaykobad
Dept. of Computer Science and Engin., Bangladesh Univ. of Engin. & Technol., Dhaka, Bangladesh
Search author on:PubMed Google Scholar
- Rossella Petreschi
Dept. of Computer Science, Sapienza University of Rome, Rome, Italy
Search author on:PubMed Google Scholar
- 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.
17kAccesses
1Citation
This is a preview of subscription content,log in via an institution to check access.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
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)
Front Matter
Pages I-XIXInvited Talk
Front Matter
Pages 1-1Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis
- Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani
Pages 3-14
Graphs Coloring
Front Matter
Pages 15-15Tropical Dominating Sets in Vertex-Coloured Graphs
- Jean-Alexandre Anglès d’Auriac, Csilia Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero et al.
Pages 17-27Vertex-Coloring with Star-Defects
- Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Vincenzo Roselli
Pages 40-51
Graphs Exploration
Front Matter
Pages 53-53Lower Bounds for Graph Exploration Using Local Policies
- Aditya Kumar Akash, Sándor P. Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin
Pages 55-67Optimal Distributed Searching in the Plane with and Without Uncertainty
- Alejandro López-Ortiz, Daniela Maftuleac
Pages 68-79Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement
- Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya
Pages 80-91
Graphs Algorithms
Front Matter
Pages 93-93A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs
- Md. Iqbal Hossain, Sammi Abida Salma, Md. Saidur Rahman
Pages 107-113
Computational Geometry
Front Matter
Pages 129-129An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints
- K. Subramani, Piotr Wojciechowski
Pages 154-165Covering Points with Convex Sets of Minimum Size
- Hwan-Gue Cho, William Evans, Noushin Saeedi, Chan-Su Shin
Pages 166-178
Other volumes
WALCOM: Algorithms and Computation
Editors and Affiliations
Dept. of Computer Science and Engin., Bangladesh Univ. of Engin. & Technol., Dhaka, Bangladesh
Mohammad Kaykobad
Dept. of Computer Science, Sapienza University of Rome, Rome, Italy
Rossella Petreschi
Accessibility Information
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