The 28 full papers presented in this volume were carefully reviewed and selected from 71 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas such as: include, but are not limited to: algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; computational models and concepts; algorithms for concurrent and distributed systems, networks; proof theory and applications of logic to computer science; model checking; automated reasoning; and deductive methods.