Abstract is missing.
- Greedy Shortest Common Superstring Approximation in Compact SpaceJarno Alanko, Tuukka Norri. 1-13 [doi]
- Longest Common Factor After One Edit OperationAmihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski. 14-26 [doi]
- Distinct Squares in Circular WordsMika Amit, Pawel Gawrychowski. 27-37 [doi]
- LZ78 Compression in Low Main Memory SpaceDiego Arroyuelo, Rodrigo Cánovas, Gonzalo Navarro, Rajeev Raman. 38-50 [doi]
- On Two LZ78-style Grammars: Compression Bounds and Compressed-Space ComputationGolnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi. 51-67 [doi]
- On Suffix Tree BreadthGolnaz Badkobeh, Juha Kärkkäinen, Simon J. Puglisi, Bella Zhukova. 68-73 [doi]
- Pattern Matching on Elastic-Degenerate Text with ErrorsGiulia Bernardini, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone. 74-90 [doi]
- Succinct Partial Sums and Fenwick TreesPhilip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen. 91-96 [doi]
- Tight Bounds for Top Tree CompressionPhilip Bille, Finn Fernstrøm, Inge Li Gørtz. 97-102 [doi]
- Efficient Compression and Indexing of TrajectoriesNieves R. Brisaboa, Travis Gagie, Adrián Gómez-Brandón, Gonzalo Navarro, José R. Paramá. 103-115 [doi]
- Fast Construction of Compressed Web GraphsJan Broß, Simon Gog, Matthias Hauck, Marcus Paradies. 116-128 [doi]
- Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract)Cédric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca, Mathias Weller. 129-143 [doi]
- Listing Maximal Independent Sets with Minimal Space and Bounded DelayAlessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari. 144-160 [doi]
- Fast Label Extraction in the CDAWGDjamal Belazzougui, Fabio Cunial. 161-175 [doi]
- Lightweight BWT and LCP Merging via the Gap AlgorithmLavinia Egidi, Giovanni Manzini. 176-190 [doi]
- Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch TriesJohannes Fischer 0001, Dominik Köppl. 191-207 [doi]
- Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded StringsSzymon Grabowski. 208-213 [doi]
- Mining Bit-Parallel LCS-length AlgorithmsHeikki Hyyrö. 214-220 [doi]
- Practical Implementation of Space-Efficient Dynamic Keyword DictionariesShunsuke Kanda, Kazuhiro Morita, Masao Fuketa. 221-233 [doi]
- Faster Practical Block Compression for Rank/Select DictionariesYusaku Kaneta. 234-240 [doi]
- Optimal Skeleton Huffman TreesShmuel T. Klein, Tamar C. Serebro, Dana Shapira. 241-253 [doi]
- Detecting One-Variable PatternsDmitry Kosolobov, Florin Manea, Dirk Nowotka. 254-270 [doi]
- Order Preserving Pattern Matching on Trees and DAGsTemma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 271-277 [doi]
- A Self-index on Block TreesGonzalo Navarro. 278-289 [doi]
- Counting Palindromes in SubstringsMikhail Rubinchik, Arseny M. Shur. 290-303 [doi]
- Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar CompressionTakuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura. 304-316 [doi]