| 2023 | A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings. Travis Gagie, Sana Kashgouli, Gonzalo Navarro |
| 2023 | Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems. Lusheng Wang, Binhai Zhu |
| 2023 | Approximate Cartesian Tree Matching: An Approach Using Swaps. Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq |
| 2023 | Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem. Guillaume Blin, Alexandru Popa, Mathieu Raffinot, Raluca Uricaru |
| 2023 | Binary Mixed-Digit Data Compression Codes. Igor O. Zavadskyi, Maksym Kovalchuk |
| 2023 | CAGE: Cache-Aware Graphlet Enumeration. Alessio Conte, Roberto Grossi, Davide Rucci |
| 2023 | Chaining of Maximal Exact Matches in Graphs. Nicola Rizzo, Manuel Cáceres, Veli Mäkinen |
| 2023 | Compacting Massive Public Transport Data. Benjamín Letelier, Nieves R. Brisaboa, Pablo Gutiérrez-Asorey, José R. Paramá, Tirso V. Rodeiro |
| 2023 | Compressibility Measures for Two-Dimensional Data. Lorenzo Carfagna, Giovanni Manzini |
| 2023 | Computing All-vs-All MEMs in Grammar-Compressed Text. Diego Díaz-Domínguez, Leena Salmela |
| 2023 | Constant Time and Space Updates for the Sigma-Tau Problem. Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro, Aaron Williams |
| 2023 | Count-Min Sketch with Variable Number of Hash Functions: An Experimental Study. Éric Fusy, Gregory Kucherov |
| 2023 | Data Structures for SMEM-Finding in the PBWT. Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, Dominik Köppl, Massimiliano Rossi |
| 2023 | Dynamic Compact Planar Embeddings. Travis Gagie, Meng He, Michael St Denis |
| 2023 | Efficient Parameterized Pattern Matching in Sublinear Space. Haruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
| 2023 | Engineering a Textbook Approach to Index Massive String Dictionaries. Paolo Ferragina, Mariagiovanna Rotundo, Giorgio Vinciguerra |
| 2023 | Evaluating Regular Path Queries on Compressed Adjacency Matrices. Diego Arroyuelo, Adrián Gómez-Brandón, Gonzalo Navarro |
| 2023 | Frequency-Constrained Substring Complexity. Solon P. Pissis, Michael Shekelyan, Chang Liu, Grigorios Loukides |
| 2023 | From de Bruijn Graphs to Variation Graphs - Relationships Between Pangenome Models. Adam Cicherski, Norbert Dojer |
| 2023 | Largest Repetition Factorization of Fibonacci Words. Kaisei Kishi, Yuto Nakashima, Shunsuke Inenaga |
| 2023 | Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2023 | Longest Common Prefix Arrays for Succinct k-Spectra. Jarno N. Alanko, Elena Biagi, Simon J. Puglisi |
| 2023 | New Advances in Rightmost Lempel-Ziv. Jonas Ellert, Johannes Fischer, Max Rishøj Pedersen |
| 2023 | Non-overlapping Indexing in BWT-Runs Bounded Space. Daniel Gibney, Paul Macnichol, Sharma V. Thankachan |
| 2023 | On Suffix Tree Detection. Amihood Amir, Eitan Kondratovsky, Avivit Levy |
| 2023 | On the Number of Factors in the LZ-End Factorization. Pawel Gawrychowski, Maria Kosche, Florin Manea |
| 2023 | Optimal Wheeler Language Recognition. Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza |
| 2023 | Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue |
| 2023 | Space-Time Trade-Offs for the LCP Array of Wheeler DFAs. Nicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza |
| 2023 | String Covers of a Tree Revisited. Lukasz Kondraciuk |
| 2023 | String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings Franco Maria Nardini, Nadia Pisanti, Rossano Venturini |
| 2023 | Sublinear Time Lempel-Ziv (LZ77) Factorization. Jonas Ellert |