
Algorithms – ESA 2013
by Giuseppe F. Italiano, Hans L. Bodlaender
About
This book constitutes the refereed proceedings of the 21st Annual European Symposium on Algorithms, ESA 2013, held in Sophia Antipolis, France, in September 2013 in the context of the combined conference ALGO 2013. The 69 revised full papers presented were carefully reviewed and selected from 303 initial submissions: 53 out of 229 in track "Design and Analysis" and 16 out of 74 in track "Engineering and Applications". The papers in this book present original research in all areas of algorithmic research, including but not limited to: algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching; quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms.
Discuss Algorithms – ESA 2013 with other readers
Join or start a book club for Algorithms – ESA 2013 on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Algorithms – ESA 2013?
Sign up free on Readfeed, then browse public clubs or start your own club with Algorithms – ESA 2013 as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Algorithms – ESA 2013 with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Algorithms – ESA 2013 with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.