Thanks to visit codestin.com
Credit goes to link.springer.com

Skip to main content
Springer Nature Link
Account

WALCOM: Algorithms and Computation

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

  • Conference proceedings
  • © 2016

Overview

Editors:
  1. Mohammad Kaykobad

    1. Dept. of Computer Science and Engin., Bangladesh Univ. of Engin. & Technol., Dhaka, Bangladesh

  2. Rossella Petreschi

    1. Dept. of Computer Science, Sapienza University of Rome, Rome, Italy

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.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook GBP 35.99
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book GBP 44.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.


Similar content being viewed by others

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (28 papers)

  1. Front Matter

    Pages I-XIX
    Download chapter PDF

  2. Invited Talk

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis

      • Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani
      Pages 3-14

  3. Graphs Coloring

    1. Front Matter

      Pages 15-15
      Download chapter PDF

    2. Tropical 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-27

    3. On Hamiltonian Colorings of Block Graphs

      • Devsi Bantva
      Pages 28-39

    4. Vertex-Coloring with Star-Defects

      • Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Vincenzo Roselli
      Pages 40-51

  4. Graphs Exploration

    1. Front Matter

      Pages 53-53
      Download chapter PDF

    2. Lower 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-67

    3. Optimal Distributed Searching in the Plane with and Without Uncertainty

      • Alejandro López-Ortiz, Daniela Maftuleac
      Pages 68-79

    4. Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement

      • Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya
      Pages 80-91

  5. Graphs Algorithms

    1. Front Matter

      Pages 93-93
      Download chapter PDF

    2. On Aligned Bar 1-Visibility Graphs

      • Franz J. Brandenburg, Alexander Esch, Daniel Neuwirth
      Pages 95-106

    3. A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs

      • Md. Iqbal Hossain, Sammi Abida Salma, Md. Saidur Rahman
      Pages 107-113

    4. Mixing Times of Markov Chains of 2-Orientations

      • Stefan Felsner, Daniel Heldt
      Pages 114-127

  6. Computational Geometry

    1. Front Matter

      Pages 129-129
      Download chapter PDF

    2. Computing a Minimum-Width Square Annulus in Arbitrary Orientation

      • Sang Won Bae
      Pages 131-142

    3. A General Framework for Searching on a Line

      • Prosenjit Bose, Jean-Lou De Carufel
      Pages 143-153

    4. An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints

      • K. Subramani, Piotr Wojciechowski
      Pages 154-165

    5. Covering Points with Convex Sets of Minimum Size

      • Hwan-Gue Cho, William Evans, Noushin Saeedi, Chan-Su Shin
      Pages 166-178
Back to top

Other volumes

  1. 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

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top