Skip to main content
  • Conference proceedings
  • © 2016

Combinatorial Algorithms

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

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

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

Conference series link(s): IWOCA: International Workshop on Combinatorial Algorithms

Conference proceedings info: IWOCA 2016.

Buy it now

Buying options

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

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (35 papers)

  1. Front Matter

    Pages I-XX
  2. Computational Complexity

    1. Front Matter

      Pages 1-1
    2. On the Complexity of Computing Treebreadth

      • Guillaume Ducoffe, Sylvain Legay, Nicolas Nisse
      Pages 3-15
    3. Online Chromatic Number is PSPACE-Complete

      • Martin Böhm, Pavel Veselý
      Pages 16-28
  3. Computational Geometry

    1. Front Matter

      Pages 29-29
    2. Bounded Embeddings of Graphs in the Plane

      • Radoslav Fulek
      Pages 31-42
    3. Crushing Disks Efficiently

      • Stefan Funke, Filip Krumpe, Sabine Storandt
      Pages 43-54
    4. Essential Constraints of Edge-Constrained Proximity Graphs

      • Prosenjit Bose, Jean-Lou De Carufel, Alina Shaikhet, Michiel Smid
      Pages 55-67
    5. Plane Bichromatic Trees of Low Degree

      • Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel Smid
      Pages 68-80
  4. Networks

    1. Front Matter

      Pages 81-81
    2. Directing Road Networks by Listing Strong Orientations

      • Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari
      Pages 83-95
    3. Evangelism in Social Networks

      • Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
      Pages 96-108
    4. Distance Queries in Large-Scale Fully Dynamic Complex Networks

      • Gianlorenzo D’Angelo, Mattia D’Emidio, Daniele Frigioni
      Pages 109-121
    5. Minimax Regret 1-Median Problem in Dynamic Path Networks

      • Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi
      Pages 122-134
  5. Enumeration

    1. Front Matter

      Pages 135-135
    2. On Maximal Chain Subgraphs and Covers of Bipartite Graphs

      • Tiziana Calamoneri, Mattia Gastaldello, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri
      Pages 137-150
    3. Reconfiguration of Steiner Trees in an Unweighted Graph

      • Haruka Mizuta, Takehiro Ito, Xiao Zhou
      Pages 163-175
  6. Online Algorithms

    1. Front Matter

      Pages 177-177
    2. Weighted Online Problems with Advice

      • Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
      Pages 179-190

Other Volumes

  1. Combinatorial Algorithms

About this book

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. 

Editors and Affiliations

  • University of Helsinki, Helsinki, Finland

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

Bibliographic Information

Buy it now

Buying options

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

Other ways to access