Combinatorial Algorithms
31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings
Editors: Gąsieniec, Leszek, Klasing, Ralf, Radzik, Tomasz (Eds.)
Free PreviewBuy this book
- About this book
-
This book constitutes the proceedings of the 31st International Workshop on Combinatorial Algorithms which was planned to take place in Bordeaux, France, during June 8–10, 2020. Due to the COVID-19 pandemic the conference changed to a virtual format.
The 30 full papers included in this book were carefully reviewed and selected from 62 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business.
- Table of contents (31 chapters)
-
-
Coordinating Swarms of Objects at Extreme Dimensions
Pages 3-13
-
A Family of Tree-Based Generators for Bubbles in Directed Graphs
Pages 17-29
-
The Micro-world of Cographs
Pages 30-42
-
Parameterized Complexity of $$(A,\ell )$$-Path Packing
Pages 43-55
-
On Proper Labellings of Graphs with Minimum Label Sum
Pages 56-68
-
Table of contents (31 chapters)
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- Combinatorial Algorithms
- Book Subtitle
- 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings
- Editors
-
- Leszek Gąsieniec
- Ralf Klasing
- Tomasz Radzik
- Series Title
- Theoretical Computer Science and General Issues
- Series Volume
- 12126
- Copyright
- 2020
- Publisher
- Springer International Publishing
- Copyright Holder
- Springer Nature Switzerland AG
- eBook ISBN
- 978-3-030-48966-3
- DOI
- 10.1007/978-3-030-48966-3
- Softcover ISBN
- 978-3-030-48965-6
- Edition Number
- 1
- Number of Pages
- XIX, 424
- Number of Illustrations
- 91 b/w illustrations, 29 illustrations in colour
- Topics
