This book constitutes the refereed proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2001, held in Dresden, Germany in February 2001.
The 46 revised full papers presented together with three invited papers were carefully reviewed and selected from a total of 153 submissions. The papers address foundational aspects from all current areas of theoretical computer science including algorithms, data structures, automata, formal languages, complexity, verification, logic, graph theory, optimization, etc.