Read While You Wait - Get immediate ebook access, if available*, when you order a print book

Theoretical Computer Science and General Issues

Combinatorial Algorithms

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

Editors: Lipták, Zsuzsanna, Smyth, William F. (Eds.)

Free Preview

Buy this book

eBook $59.99
price for USA in USD
  • ISBN 978-3-319-29516-9
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $79.99
price for USA in USD
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.

 

Table of contents (29 chapters)

Table of contents (29 chapters)
  • Speeding Up Cover Time of Sparse Graphs Using Local Knowledge

    Pages 1-12

    Abdullah, Mohammed Amin (et al.)

  • Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width

    Pages 13-24

    Alqahtani, Hasna Mohsen (et al.)

  • A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem

    Pages 25-37

    Artamonov, Stepan (et al.)

  • 1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge

    Pages 38-51

    Binucci, Carla (et al.)

  • Longest Common Extensions in Partial Words

    Pages 52-64

    Blanchet-Sadri, Francine (et al.)

Buy this book

eBook $59.99
price for USA in USD
  • ISBN 978-3-319-29516-9
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $79.99
price for USA in USD
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Combinatorial Algorithms
Book Subtitle
26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers
Editors
  • Zsuzsanna Lipták
  • William F. Smyth
Series Title
Theoretical Computer Science and General Issues
Series Volume
9538
Copyright
2016
Publisher
Springer International Publishing
Copyright Holder
Springer International Publishing Switzerland
eBook ISBN
978-3-319-29516-9
DOI
10.1007/978-3-319-29516-9
Softcover ISBN
978-3-319-29515-2
Edition Number
1
Number of Pages
XIX, 360
Number of Illustrations
62 illustrations in colour
Topics

*immediately available upon purchase as print book shipments may be delayed due to the COVID-19 crisis. ebook access is temporary and does not include ownership of the ebook. Only valid for books with an ebook version. Springer Reference Works and instructor copies are not included.