Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 11638)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: IWOCA 2019.
Buy print copy
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.
Similar content being viewed by others
Keywords
- approximation algorithms
- artificial intelligence
- bipartite graphs
- combinatorial algorithms
- combinatorial optimization
- computational geometry
- computer graphics
- data mining
- directed graphs
- graph algorithms
- graph g
- graph theory
- graphic methods
- planar graph
- vertex set
- wireless telecommunication systems
- algorithm analysis and problem complexity
- data structures
Table of contents (36 papers)
-
Front Matter
Other volumes
-
Combinatorial Algorithms
Editors and Affiliations
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: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-030-25005-8
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Switzerland AG 2019
Softcover ISBN: 978-3-030-25004-1Published: 11 July 2019
eBook ISBN: 978-3-030-25005-8Published: 15 July 2019
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIX, 456
Number of Illustrations: 288 b/w illustrations, 47 illustrations in colour
Topics: Discrete Mathematics in Computer Science, Algorithm Analysis and Problem Complexity, Data Structures, Arithmetic and Logic Structures, Computer Graphics