WALCOM: Algorithms and Computation

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

  • Sheung-Hung Poon
  • Md. Saidur Rahman
  • Hsu-Chun Yen

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 10167)

Table of contents

  1. Front Matter
    Pages I-XXII
  2. Invited Talk

  3. Computational Geometry I

    1. Front Matter
      Pages 17-17
    2. Nicolas K. Blanchard, Nicolas Schabanel
      Pages 30-41
    3. Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour
      Pages 54-65
    4. Jongmin Choi, Dongwoo Park, Hee-Kap Ahn
      Pages 66-77
  4. Combinatorial Optimization

    1. Front Matter
      Pages 79-79
    2. Koichi Yamazaki
      Pages 81-92
    3. Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle
      Pages 93-105
    4. Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue
      Pages 106-118
    5. Jun Kawahara, Takashi Horiyama, Keisuke Hotta, Shin-ichi Minato
      Pages 119-131
  5. Graph Drawing

    1. Front Matter
      Pages 133-133
    2. Felice De Luca, Emilio Di Giacomo, Walter Didimo, Stephen Kobourov, Giuseppe Liotta
      Pages 135-148
    3. Quirijn W. Bouts, Bettina Speckmann, Kevin Verbeek
      Pages 149-160
    4. Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende
      Pages 161-173
  6. Graph Algorithms I

    1. Front Matter
      Pages 175-175

About these proceedings


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.



approximation algorithms combinatorial optimization computational complexity graph algorithms theory of computation clustering computational geometry dynamic graphs graph drawing oblivious parameterized complexity pathwidth polygonal obstacle resolution size satisfiability simple-triangle graphs space-efficient algorithms structure analysis submodularity swarm robots

Editors and affiliations

  • Sheung-Hung Poon
    • 1
  • Md. Saidur Rahman
    • 2
  • Hsu-Chun Yen
    • 3
  1. 1.Universiti Teknologi BruneiBandar Seri BegawanBrunei Darussalam
  2. 2.Bangladesh University of Engineering and TechnologyDhakaBangladesh
  3. 3.National Taiwan UniversityTaipeiTaiwan

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-53925-6
  • Copyright Information Springer International Publishing AG 2017
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-53924-9
  • Online ISBN 978-3-319-53925-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site