Combinatorial Algorithms

Sun-Yuan Hsieh

ISBN 10: 3031343468 / ISBN 13: 9783031343469

Published by Springer Nature Switzerland Jun 2023, 2023

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -This book constitutes the refereed proceedings of the 34th International Workshop on Combinatorial Algorithms, IWOCA2023, held in Tainan, Taiwan, during June 7-10, 2023.The 33 full papers included in this book were carefully reviewed and selected from 86 submissions. They were organized in topical sections as follows: algorithms and data structures; algorithmicand combinatorical aspects of cryptography and information security; algorithmicgame theory and complexity of games; approximation algorithms;complexity theory; combinatorics and graph theory; combinatorial generation,enumeration and counting; combinatorial optimization; combinatoricsof words; computational biology; computational geometry; decompositionsand combinatorial designs; distributed and network algorithms; experimentalcombinatorics; fine-grained complexity; graph algorithms and modellingwith graphs; graph drawing and graph labelling; network theoryand temporalgraphs; quantum computing and algorithms for quantum computers;online algorithms; parameterized and exact algorithms; probabilistic and randomized algorithms; and streaming algorithms. 432 pp. Englisch.

Seller Inventory # 9783031343469

Bibliographic Details

• Title: Combinatorial Algorithms
• Publisher: Springer Nature Switzerland Jun 2023
• Publication Date: 2023
• Language: English
• ISBN 10: 3031343468
• ISBN 13: 9783031343469
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 24D millimeters 235 millimeters width by 155 millimeters height by 24 millimeters depth
• Weight: 651 grams

About this title

Synopsis

This book constitutes the refereed proceedings of the 34th International Workshop on Combinatorial Algorithms, IWOCA 2023, held in Tainan, Taiwan, during June 7–10, 2023. 

The 33 full papers included in this book were carefully reviewed and selected from 86 submissions. They were organized in topical sections as follows: algorithms and data structures; algorithmic and combinatorical aspects of cryptography and information security; algorithmic game theory and complexity of games; approximation algorithms; complexity theory; combinatorics and graph theory; combinatorial generation, enumeration and counting; combinatorial optimization; combinatorics of words; computational biology; computational geometry; decompositions and combinatorial designs; distributed and network algorithms; experimental combinatorics; fine-grained complexity; graph algorithms and modelling with graphs; graph drawing and graph labelling; network theoryand temporal graphs; quantum computing and algorithms for quantum computers; online algorithms; parameterized and exact algorithms; probabilistic and randomized algorithms; and streaming algorithms.