• Colin Cooper (King's College London) Multiple random walks in random regular graphs
• Tomas Flouri (Czech Technical University in Prague) Tree Pattern Matching by Pushdown Automata
• Ondřej Guth (Czech Technical University in Prague) Searching Approximate Covers of Strings using Finite Automata
• Jan Holub (Czech Technical University in Prague) Tuning BNDM with q-Grams
• Jan Janousek (Czech Technical University in Prague) Subtree and Tree Pattern Pushdown Automata for Trees in Prefix Notation
• M. Oğuzhan Külekci (Turkey National Research Institute of Electronics & Cryptology) A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
• Borivoj Melichar (Czech Technical University in Prague) Arbology, basic definitions
• Borivoj Melichar (Czech Technical University in Prague) Repeats in trees
• Mikaël Salson (University of Rouen) Dynamic Extended Suffix Arrays
• Bill Smyth (McMaster University) The Prefix Array & the Prefix Graph
• Gabriel Valiente (Technical University of Catalonia) Combinatorial Pattern Matching Algorithms in Computational Biology