Combinatorial Algorithms

27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings

  • Veli Mäkinen
  • Simon J. Puglisi
  • Leena Salmela

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

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

Table of contents

  1. Online Algorithms

    1. Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
      Pages 191-202
    2. Jhoirene Clemente, Juraj Hromkovič, Dennis Komm, Christian Kudahl
      Pages 203-212
    3. Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
      Pages 213-225
  2. Algorithmic Graph Theory

    1. Front Matter
      Pages 227-227
    2. Hassan AbouEisha, Shahid Hussain, Vadim Lozin, Jérôme Monnot, Bernard Ries, Viktor Zamaraev
      Pages 229-240
    3. Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein et al.
      Pages 241-252
    4. Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
      Pages 253-265
    5. Xujin Chen, Zhuo Diao, Xiaodong Hu, Zhongzheng Tang
      Pages 266-277
  3. Dynamic Programming

    1. Front Matter
      Pages 279-279
    2. N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
      Pages 281-292
    3. Paweł Gawrychowski, Łukasz Zatorski
      Pages 293-305
  4. Combinatorial Algorithms

    1. Front Matter
      Pages 307-307
    2. Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak, Alexandru Popa
      Pages 309-320
    3. K. Subramani, Piotr Wojciechowski
      Pages 321-333
    4. Markus Chimani, Ivo Hedtke, Tilo Wiedera
      Pages 334-346
    5. Robert Benkoczi, Ram Dahal, Daya Ram Gaur
      Pages 347-358
  5. Graph Algorithms

    1. Front Matter
      Pages 359-359
    2. Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
      Pages 361-372
    3. Peter Damaschke
      Pages 373-384
    4. Martin Fürer
      Pages 385-396

About these proceedings

Introduction

This book constitutes the proceedings of the 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, held in Helsinki, Finland, in August 2016.
The 35 papers presented in this volume were carefully reviewed and selected from 87 submissions. They were organized in topical sessions named: computational complexity; computational geometry; networks; enumeration; online algorithms; algorithmic graph theory; dynamic programming; combinatorial algorithms; graph algorithms; combinatorics; and probabilistics. 

Keywords

approximation algorithms data structures dynamic programming graph algorithms social networks algorithms combinatorial enumeration combinatorics on words complex network generator enumeration algorithms evacuation planning FPT graph coloring graph labeling hyperbolic geometry path decomposition randomized algorithms string algorithms triangulation visibility

Editors and affiliations

  • Veli Mäkinen
    • 1
  • Simon J. Puglisi
    • 2
  • Leena Salmela
    • 3
  1. 1.University of HelsinkiHelsinkiFinland
  2. 2.University of HelsinkiHelsinkiFinland
  3. 3.University of HelsinkiHelsinkiFinland

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-44543-4
  • Copyright Information Springer International Publishing Switzerland 2016
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-44542-7
  • Online ISBN 978-3-319-44543-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book