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)

Table of contents

  1. Front Matter
    Pages I-XX
  2. Computational Complexity

    1. Front Matter
      Pages 1-1
    2. Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse
      Pages 3-15
    3. Martin Böhm, Pavel Veselý
      Pages 16-28
  3. Computational Geometry

    1. Front Matter
      Pages 29-29
    2. Radoslav Fulek
      Pages 31-42
    3. Stefan Funke, Filip Krumpe, Sabine Storandt
      Pages 43-54
    4. Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel Smid
      Pages 55-67
    5. Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel Smid
      Pages 68-80
  4. Networks

    1. Front Matter
      Pages 81-81
    2. Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari
      Pages 83-95
    3. Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
      Pages 96-108
    4. Gianlorenzo D’Angelo, Mattia D’Emidio, Daniele Frigioni
      Pages 109-121
    5. Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi
      Pages 122-134
  5. Enumeration

    1. Front Matter
      Pages 135-135
    2. Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri
      Pages 137-150
    3. Haruka Mizuta, Takehiro Ito, Xiao Zhou
      Pages 163-175
  6. Online Algorithms

    1. Front Matter
      Pages 177-177
    2. Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
      Pages 179-190

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