Abstract is missing.
- Simplified Tight Bounds for Monotone Minimal Perfect HashingDmitry Kosolobov. [doi]
- Reconstructing General Matching GraphsAmihood Amir, Michael Itzhaki. [doi]
- Internal Pattern Matching in Small Space and ApplicationsGabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya. [doi]
- Random Wheeler AutomataRuben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Riccardo Maso, Nicola Prezza. [doi]
- Solving the Minimal Positional Substring Cover Problem in Sublinear SpacePaola Bonizzoni, Christina Boucher 0001, Davide Cozzi, Travis Gagie, Yuri Pirola. [doi]
- Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and SpaceDmitry Kosolobov, Nikita Sivukhin. [doi]
- Efficient Construction of Long Orientable SequencesDaniel Gabric, Joe Sawada. [doi]
- Walking on WordsIan Pratt-Hartmann. [doi]
- Closing the Gap: Minimum Space Optimal Time Distance Labeling Scheme for Interval GraphsMeng He 0001, Kaiyu Wu. [doi]
- Algorithms for Galois Words: Detection, Factorization, and RotationDiptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara. [doi]
- Minimizing the Minimizers via Alphabet ReorderingHilde Verbeek 0001, Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis. [doi]
- A Class of Heuristics for Reducing the Number of BWT-Runs in the String Ordering ProblemGianmarco Bertola, Anthony J. Cox, Veronica Guerrini, Giovanna Rosone. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- The Rational Construction of a Wheeler DFAGiovanni Manzini, Alberto Policriti, Nicola Prezza, Brian Riccardi. [doi]
- Finding Diverse Strings and Longest Common Subsequences in a GraphYuto Shida, Giulia Punzi, Yasuaki Kobayashi, Takeaki Uno, Hiroki Arimura. [doi]
- Tight Bounds for Compressing Substring SamplesPhilip Bille, Christian Mikkelsen Fuglsang, Inge Li Gørtz. [doi]
- When Is the Normalized Edit Distance over Non-Uniform Weights a Metric?Dana Fisman, Ilay Tzarfati. [doi]
- Computing the LCP Array of a Labeled GraphJarno N. Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini, Nicola Prezza. [doi]
- A Data Structure for the Maximum-Sum Segment Problem with OffsetsYoshifumi Sakai. [doi]
- Faster Sliding Window String Indexing in StreamsPhilip Bille, Pawel Gawrychowski, Inge Li Gørtz, Simon R. Tarnow. [doi]
- Exploiting New Properties of String Net Frequency for Efficient ComputationPeaker Guo, Patrick Eades, Anthony Wirth, Justin Zobel. [doi]
- Searching 2D-Strings for Matching FramesItai Boneh, Dvir Fried, Shay Golan 0001, Matan Kraus, Adrian Miclaus, Arseny M. Shur. [doi]
- Online Context-Free Recognition in OMv TimeBartlomiej Dudek 0001, Pawel Gawrychowski. [doi]
- Maintaining the Size of LZ77 on Semi-Dynamic StringsHideo Bannai, Panagiotis Charalampopoulos, Jakub Radoszewski. [doi]
- Connecting de Bruijn GraphsGiulia Bernardini 0001, Huiping Chen, Inge Li Gørtz, Christoffer Krogh, Grigorios Loukides, Solon P. Pissis, Leen Stougie, Michelle Sweering. [doi]
- Shortest Cover After EditKazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama. [doi]
- Hairpin Completion Distance Lower BoundItai Boneh, Dvir Fried, Shay Golan 0001, Matan Kraus. [doi]
- Subsequences with Generalised Gap Constraints: Upper and Lower Complexity BoundsFlorin Manea, Jonas Richardsen, Markus L. Schmid. [doi]
- BAT-LZ out of hellZsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro 0001. [doi]