WALCOM: Algorithms and Computation

10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29–31, 2016, Proceedings

  • Mohammad Kaykobad
  • Rossella Petreschi

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9627)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9627)

Table of contents

  1. Front Matter
    Pages I-XIX
  2. Invited Talk

    1. Front Matter
      Pages 1-1
    2. Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani
      Pages 3-14
  3. Graphs Coloring

    1. Front Matter
      Pages 15-15
    2. Jean-Alexandre Anglès d’Auriac, Csilia Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero et al.
      Pages 17-27
    3. Devsi Bantva
      Pages 28-39
    4. Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Vincenzo Roselli
      Pages 40-51
  4. Graphs Exploration

    1. Front Matter
      Pages 53-53
    2. Aditya Kumar Akash, Sándor P. Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin
      Pages 55-67
    3. Alejandro López-Ortiz, Daniela Maftuleac
      Pages 68-79
    4. Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya
      Pages 80-91
  5. Graphs Algorithms

    1. Front Matter
      Pages 93-93
    2. Franz J. Brandenburg, Alexander Esch, Daniel Neuwirth
      Pages 95-106
    3. Md. Iqbal Hossain, Sammi Abida Salma, Md. Saidur Rahman
      Pages 107-113
    4. Stefan Felsner, Daniel Heldt
      Pages 114-127
  6. Computational Geometry

    1. Front Matter
      Pages 129-129
    2. Prosenjit Bose, Jean-Lou De Carufel
      Pages 143-153
    3. K. Subramani, Piotr Wojciechowski
      Pages 154-165
    4. Hwan-Gue Cho, William Evans, Noushin Saeedi, Chan-Su Shin
      Pages 166-178

About these proceedings


This book constitutes the proceedings of the 10th International Workshop on Algorithms and Computation, WALCOM 2016, held in Kathmandu, Nepal, in March 2016.

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.


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 swarm robots

Editors and affiliations

  • Mohammad Kaykobad
    • 1
  • Rossella Petreschi
    • 2
  1. 1.Dept. of Computer Science and Engin.Bangladesh Univ. of Engin. & Technol.DhakaBangladesh
  2. 2.Dept. of Computer ScienceSapienza University of RomeRomeItaly

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-30139-6
  • Copyright Information Springer International Publishing Switzerland 2016
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-30138-9
  • Online ISBN 978-3-319-30139-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book