International Workshop on Combinatorial Algorithms

Combinatorial Algorithms

26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers

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

Table of contents

  1. Front Matter
    Pages I-XIX
  2. Mohammed Amin Abdullah, Colin Cooper, Moez Draief
    Pages 1-12
  3. Hasna Mohsen Alqahtani, Thomas Erlebach
    Pages 13-24
  4. Carla Binucci, Emilio Di Giacomo, Md. Iqbal Hossain, Giuseppe Liotta
    Pages 38-51
  5. Francine Blanchet-Sadri, Rachel Harred, Justin Lazarow
    Pages 52-64
  6. Joan Boyar, Christian Kudahl
    Pages 65-76
  7. Jou-Ming Chang, Ton Kloks, Hung-Lung Wang
    Pages 77-87
  8. Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
    Pages 88-99
  9. Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma
    Pages 100-111
  10. Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac
    Pages 124-135
  11. Gabriele Di Stefano, Pietro Montanari, Alfredo Navarra
    Pages 136-147
  12. Gabriele Farina, Luigi Laura
    Pages 148-160
  13. Luca Ferrari
    Pages 161-172
  14. Guillaume Fertin, Irena Rusu, Stéphane Vialette
    Pages 173-184
  15. Daniel Freund, Matthias Poloczek, Daniel Reichman
    Pages 185-196
  16. Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang
    Pages 197-208
  17. Eduard Eiben, Robert Ganian, Juho Lauri
    Pages 209-220
  18. Frédéric Giroire, Stéphane Pérennes, Issam Tahiri
    Pages 221-234

About these proceedings

Introduction

This book constitutes the thoroughly refereed post-workshop proceedings for the 26 International Workshop on combinatorial Algorithms, IWOCA 2015, held in Verona, Italy, in October 2015.

The 29 revised full papers presented were carefully reviewed and selected from a total of 90 submissions. The topics of the papers include algorithms and data structures (including sequential, parallel, distributed, approximation, probabilistic, randomised, and on-line algorithms), algorithms on strings and graphs; applications (bioinformatics, music analysis, networking, and others); combinatorics on words; combinatorial enumeration; combinatorial optimization; complexity theory; computational biology; compression and information retrieval; cryptography and information security; decompositions and combinatorial designs; discrete and computational geometry; graph drawing and labeling; graph theory.

 

Keywords

approximation algorithms combinatorics data structures distributed algorithms graph theory algorithms algorithms on strings combinatorial enumeration combinatorics on words energy efficiency extremal graphs FPT graph algorithms graph labeling hamiltonian multiple pattern matching oblivious robots random walks randomized algorithms string algorithms

Editors and affiliations

Bibliographic information

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