| 2017 | 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, Poland, July 4-6, 2017 Juha Kärkkäinen, Jakub Radoszewski, Wojciech Rytter |
| 2017 | A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem. Bartlomiej Dudek, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja |
| 2017 | Approximate Cover of Strings. Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat |
| 2017 | Beyond Adjacency Maximization: Scaffold Filling for New String Distances. Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz |
| 2017 | Can We Recover the Cover?. Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat |
| 2017 | Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. Karl Bringmann, Philip Wellnitz |
| 2017 | Communication and Streaming Complexity of Approximate Pattern Matching. Tatiana Starikovskaya |
| 2017 | Computing All Distinct Squares in Linear Time for Integer Alphabets. Hideo Bannai, Shunsuke Inenaga, Dominik Köppl |
| 2017 | Deterministic Indexing for Packed Strings. Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen |
| 2017 | Document Listing on Repetitive Collections with Guaranteed Performance. Gonzalo Navarro |
| 2017 | Dynamic Elias-Fano Representation. Giulio Ermanno Pibiri, Rossano Venturini |
| 2017 | Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings. Luís Felipe I. Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis A. B. Kowada, Jens Stoye |
| 2017 | Faster STR-IC-LCS Computation via RLE. Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back. Alberto Policriti, Nicola Prezza |
| 2017 | Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers. |
| 2017 | Gapped Pattern Statistics. Philippe Duchon, Cyril Nicaud, Carine Pivoteau |
| 2017 | Lempel-Ziv Compression in a Sliding Window. Philip Bille, Patrick Hagge Cording, Johannes Fischer, Inge Li Gørtz |
| 2017 | Longest Common Extensions with Recompression. Tomohiro I |
| 2017 | On the Weighted Quartet Consensus Problem. Manuel Lafond, Céline Scornavacca |
| 2017 | On-Line Pattern Matching on Similar Texts. Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari |
| 2017 | Optimal Omnitig Listing for Safe and Complete Contig Assembly. Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu |
| 2017 | Palindromic Length in Linear Time. Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur |
| 2017 | Path Queries on Functions. Travis Gagie, Meng He, Gonzalo Navarro |
| 2017 | Position Heaps for Parameterized Strings. Diptarama, Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara |
| 2017 | Recompression of SLPs. Artur Jez |
| 2017 | Representing the Suffix Tree with the CDAWG. Djamal Belazzougui, Fabio Cunial |
| 2017 | Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping. Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi |
| 2017 | Shortest Superstring. Marcin Mucha |
| 2017 | Synergistic Solutions on MultiSets. Jérémy Barbay, Carlos Ochoa, Srinivasa Rao Satti |
| 2017 | The Longest Filled Common Subsequence Problem. Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis |
| 2017 | Tight Bounds on the Maximum Number of Shortest Unique Substrings. Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing. Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj |
| 2017 | Wheeler Graphs: Variations on a Theme by Burrows and Wheeler. Giovanni Manzini |