Skip to main content
Springer Nature Link
Log in

WALCOM: Algorithms and Computation

11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017, Proceedings

  • Conference proceedings
  • © 2017

Overview

Editors:
  1. Sheung-Hung Poon

    1. Universiti Teknologi Brunei, Bandar Seri Begawan, Brunei Darussalam

  2. Md. Saidur Rahman

    1. Bangladesh University of Engineering and Technology, Dhaka, Bangladesh

  3. Hsu-Chun Yen

    1. National Taiwan University, Taipei, Taiwan

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

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

Included in the following conference series:

Conference proceedings info: WALCOM 2017.

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 11th International Workshop on Algorithms and Computation, WALCOM 2017, held in Hsinchu, Taiwan, in March 2017.

The 35 full papers presented together with three invited talks were carefully reviewed and selected from 83 submissions. The papers are organized in topical sections on invited talks; computational geometry; combinatorial optimization; graph drawing; graph algorithms; space-efficient algorithms; computational complexity; approximation algorithms.

 

Similar content being viewed by others

Explore related subjects

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

Table of contents (36 papers)

  1. Front Matter

    Pages I-XXII
    Download chapter PDF

  3. Computational Geometry I

    1. Front Matter

      Pages 17-17
      Download chapter PDF

    2. Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns

      • Koji Ouchi, Ryuhei Uehara
      Pages 19-29

    3. Dynamic Sum-Radii Clustering

      • Nicolas K. Blanchard, Nicolas Schabanel
      Pages 30-41

    4. How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments

      • Arash Vaezi, Mohammad Ghodsi
      Pages 42-53

    5. On Guarding Orthogonal Polygons with Sliding Cameras

      • Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour
      Pages 54-65

    6. Bundling Two Simple Polygons to Minimize Their Convex Hull

      • Jongmin Choi, Dongwoo Park, Hee-Kap Ahn
      Pages 66-77

  4. Combinatorial Optimization

    1. Front Matter

      Pages 79-79
      Download chapter PDF

    2. Tangle and Maximal Ideal

      • Koichi Yamazaki
      Pages 81-92

    3. A Width Parameter Useful for Chordal and Co-comparability Graphs

      • Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
      Pages 93-105

    4. Byzantine Gathering in Networks with Authenticated Whiteboards

      • Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue
      Pages 106-118

    5. Generating All Patterns of Graph Partitions Within a Disparity Bound

      • Jun Kawahara, Takashi Horiyama, Keisuke Hotta, Shin-ichi Minato
      Pages 119-131

  5. Graph Drawing

    1. Front Matter

      Pages 133-133
      Download chapter PDF

    2. An Experimental Study on the Ply Number of Straight-Line Drawings

      • Felice De Luca, Emilio Di Giacomo, Walter Didimo, Stephen Kobourov, Giuseppe Liotta
      Pages 135-148

    3. Complexity Measures for Mosaic Drawings

      • Quirijn W. Bouts, Bettina Speckmann, Kevin Verbeek
      Pages 149-160

    4. Fast Optimal Labelings for Rotating Maps

      • Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende
      Pages 161-173

  6. Graph Algorithms I

    1. Front Matter

      Pages 175-175
      Download chapter PDF

    2. Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover

      • Asahi Takaoka
      Pages 177-189
Back to top

Other volumes

  1. WALCOM: Algorithms and Computation

Editors and Affiliations

  • Universiti Teknologi Brunei, Bandar Seri Begawan, Brunei Darussalam

    Sheung-Hung Poon

  • Bangladesh University of Engineering and Technology, Dhaka, Bangladesh

    Md. Saidur Rahman

  • National Taiwan University, Taipei, Taiwan

    Hsu-Chun Yen

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