| 2023 | Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems. | Lusheng Wang, Binhai Zhu |
| 2023 | Chaining of Maximal Exact Matches in Graphs. | Nicola Rizzo, Manuel Cceres, Veli Mkinen |
| 2023 | Frequency-Constrained Substring Complexity. | Solon P. Pissis, Michael Shekelyan, Chang Liu, Grigorios Loukides |
| 2023 | Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. | Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2023 | Constant Time and Space Updates for the Sigma-Tau Problem. | Zsuzsanna Liptk, Francesco Masillo, Gonzalo Navarro, Aaron Williams |
| 2023 | Compacting Massive Public Transport Data. | Benjamn Letelier, Nieves R. Brisaboa, Pablo Gutirrez-Asorey, Jos R. Param, Tirso V. Rodeiro |
| 2023 | String Covers of a Tree Revisited. | Lukasz Kondraciuk |
| 2023 | Largest Repetition Factorization of Fibonacci Words. | Kaisei Kishi, Yuto Nakashima, Shunsuke Inenaga |
| 2023 | Efficient Parameterized Pattern Matching in Sublinear Space. | Haruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
| 2023 | Non-overlapping Indexing in BWT-Runs Bounded Space. | Daniel Gibney, Paul Macnichol, Sharma V. Thankachan |
| 2023 | On the Number of Factors in the LZ-End Factorization. | Pawel Gawrychowski, Maria Kosche, Florin Manea |
| 2023 | A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings. | Travis Gagie, Sana Kashgouli, Gonzalo Navarro |
| 2023 | Dynamic Compact Planar Embeddings. | Travis Gagie, Meng He, Michael St Denis |
| 2023 | Count-Min Sketch with Variable Number of Hash Functions: An Experimental Study. | ric Fusy, Gregory Kucherov |
| 2023 | Engineering a Textbook Approach to Index Massive String Dictionaries. | Paolo Ferragina, Mariagiovanna Rotundo, Giorgio Vinciguerra |
| 2023 | New Advances in Rightmost Lempel-Ziv. | Jonas Ellert, Johannes Fischer, Max Rishj Pedersen |
| 2023 | Sublinear Time Lempel-Ziv (LZ77) Factorization. | Jonas Ellert |
| 2023 | Computing All-vs-All MEMs in Grammar-Compressed Text. | Diego Daz-Domnguez, Leena Salmela |
| 2023 | Space-Time Trade-Offs for the LCP Array of Wheeler DFAs. | Nicola Cotumaccio, Travis Gagie, Dominik Kppl, Nicola Prezza |
| 2023 | CAGE: Cache-Aware Graphlet Enumeration. | Alessio Conte, Roberto Grossi, Davide Rucci |
| 2023 | From de Bruijn Graphs to Variation Graphs - Relationships Between Pangenome Models. | Adam Cicherski, Norbert Dojer |
| 2023 | Compressibility Measures for Two-Dimensional Data. | Lorenzo Carfagna, Giovanni Manzini |
| 2023 | Data Structures for SMEM-Finding in the PBWT. | Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, Dominik Kppl, Massimiliano Rossi |
| 2023 | Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem. | Guillaume Blin, Alexandru Popa, Mathieu Raffinot, Raluca Uricaru |
| 2023 | Optimal Wheeler Language Recognition. | Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza |