Skip to main content
Springer Nature Link
Log in

WALCOM: Algorithms and Computation

13th International Conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, Proceedings

  • Conference proceedings
  • © 2019

Overview

Editors:
  1. Gautam K. Das

    1. Indian Institute of Technology Guwahati, Guwahati, India

  2. Partha S. Mandal

    1. Indian Institute of Technology Guwahati, Guwahati, India

  3. Krishnendu Mukhopadhyaya

    1. Indian Statistical Institute, Kolkata, India

  4. Shin-ichi Nakano

    1. Gunma University, Kiryu, Japan

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: WALCOM 2019.

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

') var buybox = document.querySelector("[data-id=id_"+ timestamp +"]").parentNode var buyboxMaxSingleColumnWidth = 480 ;[].slice.call(buybox.querySelectorAll(".buying-option")).forEach(initCollapsibles) function initCollapsibles(buyingOption, index) { var toggle = buyingOption.querySelector(".buying-option-price") buyingOption.classList.remove("expanded") var form = buyingOption.querySelector(".buying-option-form") var priceInfo = buyingOption.querySelector(".price-info") if (toggle && form && priceInfo) { toggle.setAttribute("role", "button") toggle.setAttribute("tabindex", "0") toggle.addEventListener("click", function (event) { var expandedBuyingOptions = buybox.querySelectorAll(".buying-option.expanded") var buyboxWidth = buybox.offsetWidth ;[].slice.call(expandedBuyingOptions).forEach(function(option) { if (buyboxWidth <= buyboxMaxSingleColumnWidth && option != buyingOption) { hideBuyingOption(option) } }) var expanded = toggle.getAttribute("aria-expanded") === "true" || false toggle.setAttribute("aria-expanded", !expanded) form.hidden = expanded if (!expanded) { buyingOption.classList.add("expanded") } else { buyingOption.classList.remove("expanded") } priceInfo.hidden = expanded }, false) } } function hideBuyingOption(buyingOption) { var toggle = buyingOption.querySelector(".buying-option-price") var form = buyingOption.querySelector(".buying-option-form") var priceInfo = buyingOption.querySelector(".price-info") toggle.setAttribute("aria-expanded", false) form.hidden = true buyingOption.classList.remove("expanded") priceInfo.hidden = true } function initKeyControls() { document.addEventListener("keydown", function (event) { if (document.activeElement.classList.contains("buying-option-price") && (event.code === "Space" || event.code === "Enter")) { if (document.activeElement) { event.preventDefault() document.activeElement.click() } } }, false) } function initialStateOpen() { var buyboxWidth = buybox.offsetWidth var narrowBuyboxArea = buyboxWidth <= buyboxMaxSingleColumnWidth var allOptionsInitiallyCollapsed = buybox.className.indexOf("all-options-initially-collapsed") > -1 ;[].slice.call(buybox.querySelectorAll(".buying-option")).forEach(function (option, index) { var toggle = option.querySelector(".buying-option-price") var form = option.querySelector(".buying-option-form") var priceInfo = option.querySelector(".price-info") if (allOptionsInitiallyCollapsed || narrowBuyboxArea && index > 0) { toggle.setAttribute("aria-expanded", "false") form.hidden = "hidden" priceInfo.hidden = "hidden" } else { toggle.click() } }) } initialStateOpen() if (window.buyboxInitialised) return window.buyboxInitialised = true initKeyControls() })()

Other ways to access

Licence this eBook for your library

See More

Institutional subscriptions

About this book

This book constitutes the proceedings of the 13th International Conference and Workshop on Algorithms and Computation, WALCOM 2019, held in Guwahati, India, in February/ March 2019.

The 30 full papers presented were carefully reviewed and selected from 100 submissions. The papers are organized in topical headings on the facility location problem; computational geometry; graph drawing; graph algorithms; approximation algorithms; miscellaneous; data structures; parallel and distributed algorithms; and packing and covering.

Similar content being viewed by others

Explore related subjects

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

Table of contents (33 papers)

  1. Front Matter

    Pages I-XVI
    Download chapter PDF

  2. Invited Talks

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Graph Profile Realizations and Applications to Social Networks

      • Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz
      Pages 3-14

    3. Parameterized Computational Geometry via Decomposition Theorems

      • Fahad Panolan, Saket Saurabh, Meirav Zehavi
      Pages 15-27

  3. Facility Location Problem

    1. Front Matter

      Pages 29-29
      Download chapter PDF

    2. r-Gatherings on a Star

      • Shareef Ahmed, Shin-ichi Nakano, Md. Saidur Rahman
      Pages 31-42

    3. Topological Stability of Kinetic k-centers

      • Ivor Hoog v.d., Marc van Kreveld, Wouter Meulemans, Kevin Verbeek, Jules Wulms
      Pages 43-55

    4. A Linear Time Algorithm for the r-Gathering Problem on the Line (Extended Abstract)

      • Anik Sarker, Wing-kin Sung, M. Sohel Rahman
      Pages 56-66

  4. Computational Geometry

    1. Front Matter

      Pages 67-67
      Download chapter PDF

    2. Maximum-Width Empty Square and Rectangular Annulus

      • Sang Won Bae, Arpita Baral, Priya Ranjan Sinha Mahapatra
      Pages 69-81

    3. Hard and Easy Instances of L-Tromino Tilings

      • Javier T. Akagi, Carlos F. Gaona, Fabricio Mendoza, Manjil P. Saikia, Marcos Villagra
      Pages 82-95

    4. The Prefix Fréchet Similarity

      • Christian Scheffer
      Pages 96-107

    5. Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics

      • Stefan Klootwijk, Bodo Manthey, Sander K. Visser
      Pages 108-120

    6. Optimal Partition of a Tree with Social Distance

      • Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono
      Pages 121-132

  5. Graph Drawing

    1. Front Matter

      Pages 133-133
      Download chapter PDF

    2. Flat-Foldability for 1 × n Maps with Square/Diagonal Grid Patterns

      • Yiyang Jia, Yoshihiro Kanamori, Jun Mitani
      Pages 135-147

    3. (k, p)-Planarity: A Relaxation of Hybrid Planarity

      • Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Timothy W. Randolph, Alessandra Tappini
      Pages 148-159

    4. Drawing Clustered Graphs on Disk Arrangements

      • Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel
      Pages 160-171

  6. Graph Algorithms

    1. Front Matter

      Pages 173-173
      Download chapter PDF

    2. Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components

      • Duygu Vietz, Stefan Hoffmann, Egon Wanke
      Pages 175-187
Back to top

Other volumes

  1. WALCOM: Algorithms and Computation

Editors and Affiliations

  • Indian Institute of Technology Guwahati, Guwahati, India

    Gautam K. Das, Partha S. Mandal

  • Indian Statistical Institute, Kolkata, India

    Krishnendu Mukhopadhyaya

  • Gunma University, Kiryu, Japan

    Shin-ichi Nakano

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