Get 40% off of select print and eBooks in Engineering & Materials Science!

Theoretical Computer Science and General Issues

Combinatorial Algorithms

25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers

Editors: Kratochvíl, Jan, Miller, Mirka, Froncek, Dalibor (Eds.)

Free Preview

Buy this book

eBook $54.99
price for USA in USD (gross)
  • ISBN 978-3-319-19315-1
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $69.99
price for USA in USD
  • ISBN 978-3-319-19314-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

This book constitutes the thoroughly refereed post-workshop proceedings of the 25th International Workshop on Combinatorial Algorithms, IWOCA 2014, held in Duluth, MN, USA, in October 2014. The 32 revised full papers presented were carefully reviewed and selected from a total of 69 submissions. The papers focus on topics such as Algorithms and Data Structures, Combinatorial Enumeration, Combinatorial Optimization, Complexity Theory (Structural and Computational), Computational Biology, Databases (Security, Compression and Information Retrieval), Decompositions and Combinatorial Designs, Discrete and Computational Geometry, as well as Graph Drawing and Graph Theory. IWOCA is a yearly forum for researchers in designing algorithms field to advance creativeness of intersection between mathematics and computer science. This is the first time this conference is being held in U.S.

Table of contents (32 chapters)

Table of contents (32 chapters)
  • On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism

    Pages 1-12

    Abu-Khzam, Faisal N. (et al.)

  • Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem

    Pages 13-23

    Adamaszek, Anna (et al.)

  • Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk

    Pages 24-36

    Alfalayleh, Mousa (et al.)

  • On the Galois Lattice of Bipartite Distance Hereditary Graphs

    Pages 37-48

    Apollonio, Nicola (et al.)

  • Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance

    Pages 49-61

    Barton, Carl (et al.)

Buy this book

eBook $54.99
price for USA in USD (gross)
  • ISBN 978-3-319-19315-1
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $69.99
price for USA in USD
  • ISBN 978-3-319-19314-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Combinatorial Algorithms
Book Subtitle
25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers
Editors
  • Jan Kratochvíl
  • Mirka Miller
  • Dalibor Froncek
Series Title
Theoretical Computer Science and General Issues
Series Volume
8986
Copyright
2015
Publisher
Springer International Publishing
Copyright Holder
Springer International Publishing Switzerland
eBook ISBN
978-3-319-19315-1
DOI
10.1007/978-3-319-19315-1
Softcover ISBN
978-3-319-19314-4
Edition Number
1
Number of Pages
XIII, 377
Number of Illustrations
70 b/w illustrations
Topics