Get 40% off select print & eBooks in Engineering & Materials or 50% off eBooks in Medicine & Psychology!

Theoretical Computer Science and General Issues

Combinatorial Algorithms

30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings

Editors: Colbourn, Charles J., Grossi, Roberto, Pisanti, Nadia (Eds.)

Free Preview

Buy this book

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

This book constitutes the refereed post-conference proceedings of the 30th International Workshop on Combinatorial Algorithms, IWOCA 2019, held in Pisa, Italy, in July 2019. The 36 regular papers presented in this volume were carefully reviewed and selected from 73 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and information security, algorithms on strings and graphs, graph drawing and labelling, computational algebra and geometry, computational biology, probabilistic and randomized algorithms, algorithms for big data analytics, and new paradigms of computation.

Table of contents (36 chapters)

Table of contents (36 chapters)
  • A Note on Handicap Incomplete Tournaments

    Pages 1-9

    Prajeesh, Appattu Vallapil (et al.)

  • Computing the k-Crossing Visibility Region of a Point in a Polygon

    Pages 10-21

    Bahoo, Yeganeh (et al.)

  • An Improved Scheme in the Two Query Adaptive Bitprobe Model

    Pages 22-34

    Baig, Mirza Galib Anwarul Husain (et al.)

  • On Erdős–Szekeres-Type Problems for k-convex Point Sets

    Pages 35-47

    Balko, Martin (et al.)

  • Algorithm and Hardness Results on Liar’s Dominating Set and $$\varvec{k}$$-tuple Dominating Set

    Pages 48-60

    Banerjee, Sandip (et al.)

Buy this book

eBook $69.99
price for USA in USD (gross)
  • ISBN 978-3-030-25005-8
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $89.99
price for USA in USD
  • ISBN 978-3-030-25004-1
  • 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
30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings
Editors
  • Charles J. Colbourn
  • Roberto Grossi
  • Nadia Pisanti
Series Title
Theoretical Computer Science and General Issues
Series Volume
11638
Copyright
2019
Publisher
Springer International Publishing
Copyright Holder
Springer Nature Switzerland AG
eBook ISBN
978-3-030-25005-8
DOI
10.1007/978-3-030-25005-8
Softcover ISBN
978-3-030-25004-1
Edition Number
1
Number of Pages
XIX, 456
Number of Illustrations
288 b/w illustrations, 47 illustrations in colour
Topics