| 2021 | Optimal Construction of Hierarchical Overlap Graphs. | Shahbaz Khan |
| 2021 | Constructing Strings Avoiding Forbidden Substrings. | Giulia Bernardini, Alberto Marchetti-Spaccamela, Solon P. Pissis, Leen Stougie, Michelle Sweering |
| 2021 | Data Structures for Categorical Path Counting Queries. | Meng He, Serikzhan Kazi |
| 2021 | Computing Edit Distance (Invited Talk). | Michal Kouck |
| 2020 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2020 | Approximating Text-To-Pattern Distance via Dimensionality Reduction. | Przemyslaw Uznanski |
| 2020 | Faster Binary Mean Computation Under Dynamic Time Warping. | Nathan Schaar, Vincent Froese, Rolf Niedermeier |
| 2020 | On Extensions of Maximal Repeats in Compressed Strings. | Julian Pape-Lange |
| 2020 | Time-Space Tradeoffs for Finding a Long Common Substring. | Stav Ben-Nun, Shay Golan, Tomasz Kociumaka, Matan Kraus |
| 2020 | DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. | Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda |
| 2020 | Text Indexing and Searching in Sublinear Time. | J. Ian Munro, Gonzalo Navarro, Yakov Nekrich |
| 2020 | Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP. | Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, Masakazu Tateshita |
| 2020 | Chaining with Overlaps Revisited. | Veli Mkinen, Kristoffer Sahlin |
| 2020 | Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms. | Manuel Lafond, Binhai Zhu, Peng Zou |
| 2020 | In-Place Bijective Burrows-Wheeler Transforms. | Dominik Kppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara |
| 2020 | Parameterized Algorithms for Matrix Completion with Radius Constraints. | Tomohiro Koana, Vincent Froese, Rolf Niedermeier |
| 2020 | Longest Common Subsequence on Weighted Sequences. | Evangelos Kipouridis, Kostas Tsichlas |
| 2020 | k-Approximate Quasiperiodicity under Hamming and Edit Distance. | Aleksander Kedzierski, Jakub Radoszewski |
| 2020 | Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk). | Thore Husfeldt |
| 2020 | String Factorizations Under Various Collision Constraints. | Niels Grttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer |
| 2020 | Approximating Longest Common Substring with k mismatches: Theory and Practice. | Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya |
| 2020 | The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time. | Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat |
| 2020 | On Indeterminate Strings Matching. | Pawel Gawrychowski, Samah Ghazawi, Gad M. Landau |
| 2020 | Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara |
| 2020 | Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions. | Patty Commins, David Liben-Nowell, Tina Liu, Kiran Tomlinson |