Skip to main content
Springer Nature Link
Log in

WALCOM: Algorithms and Computation

16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022, Proceedings

  • Conference proceedings
  • © 2022

Overview

Editors:
  1. Petra Mutzel

    1. University of Bonn, Bonn, Germany

  2. Md. Saidur Rahman

    1. Bangladesh University of Engineering and Technology (BUET), Dhaka, Bangladesh

  3. Slamin

    1. Universitas Jember, Jember, Indonesia

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

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

Included in the following conference series:

Conference proceedings info: WALCOM 2022.

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 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 84.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 16th International Conference on Algorithms and Computation, WALCOM 2022, which was held in Jember, Indonesia, during March 24-26, 2022.

This proceedings volume contains 30 full papers which were carefully reviewed and selected from a total of 89 submissions and 3 invited papers. They cover diverse areas of algorithms and computation, such as approximation algorithms, computational complexity, computational geometry, graph algorithms, graph drawing and visualization, online algorithms, parameterized complexity and property testing.

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-xviii
    Download chapter PDF

  2. Invited Talks

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Some Problems Related to the Space of Optimal Tree Reconciliations

      • Tiziana Calamoneri, Blerina Sinaimeri
      Pages 3-14

    3. From the W-hierarchy to XNLP

      • Hans L. Bodlaender
      Pages 15-25

    4. Invitation to Combinatorial Reconfiguration

      • Takehiro Ito
      Pages 26-31

  3. Combinatorial Reconfiguration

    1. Front Matter

      Pages 33-33
      Download chapter PDF

    2. Reconfiguration of Regular Induced Subgraphs

      • Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
      Pages 35-46

    3. Traversability, Reconfiguration, and Reachability in the Gadget Framework

      • Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan Hendrickson, Jayson Lynch
      Pages 47-58

    4. 1-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids

      • Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides
      Pages 59-70

  4. Graph Drawing and Visualization

    1. Front Matter

      Pages 71-71
      Download chapter PDF

    2. Aspect Ratio Universal Rectangular Layouts

      • Stefan Felsner, Andrew Nathenson, Csaba D. Tóth
      Pages 73-84

    3. Morphing Tree Drawings in a Small 3D Grid

      • Aleksandra Istomina, Elena Arseneva, Rahul Gangopadhyay
      Pages 85-96

    4. StreamTable: An Area Proportional Visualization for Tables with Flowing Streams

      • Jared Espenant, Debajyoti Mondal
      Pages 97-108

  5. Computational Geometry

    1. Front Matter

      Pages 109-109
      Download chapter PDF

    2. Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard

      • Chuzo Iwamoto, Tatsuaki Ibusuki
      Pages 111-122

    3. The Polygon Burning Problem

      • William Evans, Rebecca Lin
      Pages 123-134

    4. Reverse Shortest Path Problem in Weighted Unit-Disk Graphs

      • Haitao Wang, Yiming Zhao
      Pages 135-146

  6. Computational Complexity

    1. Front Matter

      Pages 147-147
      Download chapter PDF

    2. Happy Set Problem on Subclasses of Co-comparability Graphs

      • Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
      Pages 149-160

    3. Finding Geometric Representations of Apex Graphs is NP-Hard

      • Dibyayan Chakraborty, Kshitij Gajjar
      Pages 161-174
Back to top

Other volumes

  1. WALCOM: Algorithms and Computation

Editors and Affiliations

  • University of Bonn, Bonn, Germany

    Petra Mutzel

  • Bangladesh University of Engineering and Technology (BUET), Dhaka, Bangladesh

    Md. Saidur Rahman

  • Universitas Jember, Jember, Indonesia

    Slamin

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