This book presents cutting-edge research in algorithms and computational complexity. The 31 revised full papers, selected from 75 submissions to the 8th International Conference on Algorithms and Complexity (CIAC 2013), cover a wide range of topics. These include the design, analysis, and experimentation of efficient algorithms and data structures, as well as theoretical aspects of computational complexity. The collection offers a snapshot of current advancements in the field.

As a collection of conference proceedings, the reception of this book is primarily gauged by the impact and acceptance of the individual papers within the academic community. The selection process, involving careful review and selection from a substantial number of submissions, suggests a high standard of presented research. The topics covered align with core areas of computer science, indicating its relevance to researchers and practitioners in algorithms and complexity.