Skip to main content
  • Conference proceedings
  • © 2016

Combinatorial Algorithms

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

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

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 2015.

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 (29 papers)

  1. Front Matter

    Pages I-XIX
  2. Speeding Up Cover Time of Sparse Graphs Using Local Knowledge

    • Mohammed Amin Abdullah, Colin Cooper, Moez Draief
    Pages 1-12
  3. Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width

    • Hasna Mohsen Alqahtani, Thomas Erlebach
    Pages 13-24
  4. 1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge

    • Carla Binucci, Emilio Di Giacomo, Md. Iqbal Hossain, Giuseppe Liotta
    Pages 38-51
  5. Longest Common Extensions in Partial Words

    • Francine Blanchet-Sadri, Rachel Harred, Justin Lazarow
    Pages 52-64
  6. Adding Isolated Vertices Makes Some Online Algorithms Optimal

    • Joan Boyar, Christian Kudahl
    Pages 65-76
  7. Gray Codes for AT-Free Orders via Antimatroids

    • Jou-Ming Chang, Ton Kloks, Hung-Lung Wang
    Pages 77-87
  8. Enumerating Cyclic Orientations of a Graph

    • Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
    Pages 88-99
  9. Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

    • Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma
    Pages 100-111
  10. List Colouring and Partial List Colouring of Graphs On-line

    • Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac
    Pages 124-135
  11. About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings

    • Gabriele Di Stefano, Pietro Montanari, Alfredo Navarra
    Pages 136-147
  12. Dynamic Subtrees Queries Revisited: The Depth First Tour Tree

    • Gabriele Farina, Luigi Laura
    Pages 148-160
  13. Schröder Partitions and Schröder Tableaux

    • Luca Ferrari
    Pages 161-172
  14. Algorithmic Aspects of the S-Labeling Problem

    • Guillaume Fertin, Irena Rusu, Stéphane Vialette
    Pages 173-184
  15. Contagious Sets in Dense Graphs

    • Daniel Freund, Matthias Poloczek, Daniel Reichman
    Pages 185-196
  16. Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time

    • Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang
    Pages 197-208
  17. On the Complexity of Rainbow Coloring Problems

    • Eduard Eiben, Robert Ganian, Juho Lauri
    Pages 209-220
  18. How to Design Graphs with Low Forwarding Index and Limited Number of Edges

    • Frédéric Giroire, Stéphane Pérennes, Issam Tahiri
    Pages 221-234

Other Volumes

  1. Combinatorial Algorithms

About this book

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.

 

Editors and Affiliations

  • Dept. of Computer Science, University of Verona, Verona, Italy

    Zsuzsanna Lipták

  • Dept. of Computing and Software, McMaster University, Hamilton, Canada

    William F. Smyth

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