Abstract is missing.
- On the Hardness of Optimal Vertex Relabeling and Restricted Vertex RelabelingAmihood Amir, Benny Porat. 1-12 [doi]
- A Framework for Space-Efficient String KernelsDjamal Belazzougui, Fabio Cunial. 13-25 [doi]
- Composite Repetition-Aware Data StructuresDjamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot. 26-39 [doi]
- Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome AnalysisTimo Beller, Enno Ohlebusch. 40-51 [doi]
- Longest Common Extensions in TreesPhilip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann. 52-64 [doi]
- Longest Common Extensions in Sublinear SpacePhilip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj. 65-76 [doi]
- Ranked Document Retrieval with Forbidden PatternSudip Biswas, Arnab Ganguly, Rahul Shah, Sharma V. Thankachan. 77-88 [doi]
- Parameterized Complexity of Superstring ProblemsIvan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh. 89-99 [doi]
- On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction ProblemPaola Bonizzoni, Riccardo Dondi, Gunnar W. Klau, Yuri Pirola, Nadia Pisanti, Simone Zaccaria. 100-113 [doi]
- Fast String Dictionary Lookup with One ErrorTimothy M. Chan, Moshe Lewenstein. 114-123 [doi]
- On the Readability of Overlap DigraphsRayan Chikhi, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova. 124-137 [doi]
- Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching ProblemSukhyeun Cho, Joong Chae Na, Jeong Seop Sim. 138-148 [doi]
- Range Minimum Query Indexes in Higher DimensionsPooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein. 149-159 [doi]
- Alphabet-Dependent String Searching with Wexponential Search TreesJohannes Fischer 0001, Pawel Gawrychowski. 160-171 [doi]
- Lempel Ziv Computation in Small Space (LZ-CISS)Johannes Fischer 0001, Tomohiro I, Dominik Köppl. 172-184 [doi]
- Succinct Non-overlapping IndexingArnab Ganguly, Rahul Shah, Sharma V. Thankachan. 185-195 [doi]
- Encodings of Range Maximum-Sum Segment Queries and ApplicationsPawel Gawrychowski, Patrick K. Nicholson. 196-206 [doi]
- Compact Indexes for Flexible Top- k k RetrievalSimon Gog, Matthias Petri. 207-218 [doi]
- LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed EncodingKeisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. 219-230 [doi]
- Combinatorial RNA Design: Designability and Structure-Approximating AlgorithmJozef Hales, Ján Manuch, Yann Ponty, Ladislav Stacho. 231-246 [doi]
- Dictionary Matching with Uneven GapsWing-Kai Hon, Tak Wah Lam, Rahul Shah, Sharma V. Thankachan, Hing-Fung Ting, Yilin Yang. 247-260 [doi]
- Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's ProcessGabriel Istrate, Cosmin Bonchis. 261-271 [doi]
- The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden TripletsJesper Jansson, Andrzej Lingas, Eva-Marta Lundell. 272-283 [doi]
- String Powers in TreesTomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. 284-294 [doi]
- Online Detection of Repetitions with BacktrackingDmitry Kosolobov. 295-306 [doi]
- Greedy Conjecture for Strings of Length 4Alexander S. Kulikov, Sergey Savinov, Evgeniy Sluzhaev. 307-315 [doi]
- Tighter Bounds for the Sum of Irreducible LCP ValuesJuha Kärkkäinen, Dominik Kempa, Marcin Piatkowski. 316-328 [doi]
- Parallel External Memory Suffix SortingJuha Kärkkäinen, Dominik Kempa, Simon J. Puglisi. 329-342 [doi]
- On Maximal Unbordered FactorsAlexander Loptev, Gregory Kucherov, Tatiana A. Starikovskaya. 343-354 [doi]
- Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas TreeYoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 355-366 [doi]
- Reporting Consecutive Substring Occurrences Under Bounded Gap ConstraintsGonzalo Navarro, Sharma V. Thankachan. 367-373 [doi]
- A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-AlgorithmCyril Nicaud. 374-384 [doi]
- Encoding Nearest Larger ValuesPatrick K. Nicholson, Rajeev Raman. 385-395 [doi]
- Sorting by Cuts, Joins and Whole Chromosome DuplicationsRon Zeira, Ron Shamir. 396-409 [doi]