| Author | Title |
| Invited talk |
|
Maxime Crochemore and
Dov M. Gabbay | Reactive Links to Save Automata States |
| Published Regular Contributions |
|
Noud de Beijer,
Loek Cleophas,
Derrick G. Kourie and
Bruce W. Watson | Improving Automata Efficiency by Stretching and Jamming |
|
Jan Lahoda and
Jan Žďárek | Simple Tree Pattern Matching for Trees in the Prefix Bar Notation |
|
Domenico Cantone,
Simone Faro and
Emanuele Giaquinta | Approximate String Matching Allowing for Inversions and Translocations |
|
Raphaël Clifford and
Alexandru Popa | (In)approximability Results for Pattern Matching Problems |
|
Domenico Cantone,
Salvatore Cristofaro and
Simone Faro | A Space-Efficient Implementation of the Good-Suffix Heuristic |
|
Martin Berglund and
Frank Drewes | On the Complexity of Variants of the k Best Strings Problem |
|
Giuseppe Lancia,
Romeo Rizzi and
Russell Schwartz | Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms |
|
Luigi Cinque,
Sergio De Agostino and
Luca Lombardi | Binary Image Compression via Monochromatic Pattern Substitution: Effectiveness and Scalability |
|
Shmuel Tomi Klein and
Dana Shapira | Practical Fixed Length Lempel Ziv Coding |
|
Szymon Grabowski and
Wojciech Bieniecki | Tight and Simple Web Graph Compression |
|
Maxime Crochemore,
Costas S. Iliopoulos,
Marcin Kubica,
Jakub Radoszewski,
Wojciech Rytter,
Krzysztof Stencel and
Tomasz Waleń | New Simple Efficient Algorithms Computing Powers and Runs in Strings |
|
Wataru Matsubara,
Akira Ishino and
Ayumi Shinohara | Inferring Strings from Runs |
|
Golnaz Badkobeh and
Maxime Crochemore | Bounded Number of Squares in Infinite Repetition-Constrained Binary Words |
|
Kazuhiko Kusano and
Ayumi Shinohara | Average Number of Runs and Squares in Necklace |
|
Hideo Bannai,
Mathieu Giraud,
Kazuhiko Kusano,
Wataru Matsubara,
Ayumi Shinohara and
Jamie Simpson | The Number of Runs in a Ternary Word |
|
Ernest Ketcha Ngassam,
Bruce W. Watson and
Derrick G. Kourie | Formal Characterizations of FA-based String Processors |
