Skip to main content
Springer Nature Link
Log in

WALCOM: Algorithms and Computation

17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023, Proceedings

  • Conference proceedings
  • © 2023

Overview

Editors:
  1. Chun-Cheng Lin

    1. National Yang Ming Chiao Tung University, Hsinchu, Taiwan

  2. Bertrand M. T. Lin

    1. National Yang Ming Chiao Tung University, Hsinchu, Taiwan

  3. Giuseppe Liotta

    1. University of Perugia, Perugia, Italy

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

Included in the following conference series:

Conference proceedings info: WALCOM 2023.

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 17th International Conference and Workshops on Algorithms and Computation, WALCOM 2023, which took place in Hsinchu, Taiwan, in March 2023.

The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 75 submissions. They cover topics such as: computational geometry; string algorithm; optimization; graph algorithm; approximation algorithm; and parameterized complexity.

Similar content being viewed by others

Explore related subjects

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

Table of contents (32 papers)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  2. Invited Talks

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult

      • Jan Kratochvíl
      Pages 3-11

    3. The Family of Fan-Planar Graphs

      • Michael Kaufmann
      Pages 12-19

  3. Computational Geometry

    1. Front Matter

      Pages 21-21
      Download chapter PDF

    2. Minimum Ply Covering of Points with Unit Squares

      • Stephane Durocher, J. Mark Keil, Debajyoti Mondal
      Pages 23-35

    3. Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms

      • Takumi Shiota, Toshiki Saitoh
      Pages 36-48

    4. Flipping Plane Spanning Paths

      • Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul, Birgit Vogtenhuber
      Pages 49-60

    5. Away from Each Other

      • Tetsuya Araki, Shin-ichi Nakano
      Pages 61-70

    6. Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees

      • A. Karim Abu-Affash, Paz Carmi, Meytal Maman
      Pages 71-77

    7. Reflective Guarding a Gallery

      • Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi
      Pages 78-89

    8. Improved and Generalized Algorithms for Burning a Planar Point Set

      • Prashant Gokhale, J. Mark Keil, Debajyoti Mondal
      Pages 90-101

    9. On the Longest Flip Sequence to Untangle Segments in the Plane

      • Guilherme D. da Fonseca, Yan Gerard, Bastien Rivier
      Pages 102-112

  4. String Algorithm

    1. Front Matter

      Pages 113-113
      Download chapter PDF

    2. Inferring Strings from Position Heaps in Linear Time

      • Koshiro Kumagai, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
      Pages 115-126

    3. Internal Longest Palindrome Queries in Optimal Time

      • Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama
      Pages 127-138

    4. Finding the Cyclic Covers of a String

      • Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba
      Pages 139-150

    5. Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs

      • Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka
      Pages 151-163

  5. Optimization

    1. Front Matter

      Pages 165-165
      Download chapter PDF

    2. Better Hardness Results for the Minimum Spanning Tree Congestion Problem

      • Huong Luu, Marek Chrobak
      Pages 167-178
Back to top

Other volumes

  1. WALCOM: Algorithms and Computation

Editors and Affiliations

  • National Yang Ming Chiao Tung University, Hsinchu, Taiwan

    Chun-Cheng Lin, Bertrand M. T. Lin

  • University of Perugia, Perugia, Italy

    Giuseppe Liotta

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