* Chairs

+ Mircea Marin, West University of Timisoara, Romania
+ Gabriel Istrate, Research Institute e-Austria Timisoara, Romania

* Topics

+ combinatorial Optimization
+ Formal languages and Combinatorics on Words
+ graph-theoretic and Combinatorial methods in Computer Science
+ algorithmic paradigms, including distributed, online,
approximation, probabilistic, game-theoretic algorithms
+ computational Complexity Theory, including structural complexity, boolean complexity, communication complexity, average-case complexity, derandomization and property testing
+ logical approaches to complexity, including finite model theory
+ algorithmic and computational learning theory
+ aspects of computability theory, including computability in analysis and algorithmic information theory
+ proof complexity
+ computational social choice and game theory
+ new computational paradigms: CNN computing, quantum, holographic and other non-standard approaches to Computability
+ randomized methods, random graphs, threshold phenomena and typical-case complexity
+ automata theory and other formal models, particularly in relation to formal verification methods such as model checking and runtime verification
+ applications of theory, including wireless and sensor networks, computational biology and computational economics
+ experimental algorithmics

* PC Members:

+ Andrej Brodnik,
+ Marc Demange, ESSEC
+ Gabriel Istrate, eAustria Research Institute
+ Mircea Marin, West University of Timisoara
+ Robert Mercas, Kiel University
+ Alex Popa, Masaryk University
+ Traian Serbanuta, University of Bucharest
+ Gaven Watson,