Accepted Papers

  • Riccardo Dondi, Alexandru Popa. Representing Paths in Digraphs
  • Yoshifumi Sakai. Linear-space LCS enumeration for two strings
  • Gonzalo Navarro, Alejandro Pacheco. Counting on General Run-Length Grammars
  • Dirk Nowotka, Max Wiedenhöft. The Equivalence Problem of E-Pattern Languages with Length Constraints is Undecidable
  • Itai Boneh, Shay Golan. Covers in Optimal Space
  • Shay Golan, Matan Kraus. String Problems in the Congested Clique Model
  • Paolo Ferragina, Filippo Lari. FL-RMQ: A learned approach to range minimum queries
  • Cyril Nicaud, Carine Pivoteau, Stéphane Vialette. Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt Algorithms
  • Solon Pissis, Jakub Radoszewski Wiktor Zuba (part A); Pawel Gawrychowski, Adam Górkiewicz, Pola Marciniak, Solon Pissis, Karol Pokorski (part B). Faster Approximate Elastic-Degenerate String Matching
  • Yuto Iguchi, Ryo Yoshinaka, Ayumi Shinohara. Pattern Matching on Run-Length Grammar-Compressed Strings in Linear Time
  • Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci. A Family of Partial Cubes with Minimal Fibonacci Dimension
  • Gabriele Fici, Jeffrey Shallit, Jamie Simpson. On Palindromic Periodicities
  • Wiktor Zuba, Oded Lachish, Solon Pissis. Shortest Undirected Paths in de Bruijn Graphs
  • Nikita Gaevoy, Boris Zolotov, Alexander Tiskin. Doubly-periodic string comparison
  • Jonas Ellert, Paweł Gawrychowski, Tatiana Starikovskaya. Minimal Generators in Optimal Time
  • Ruben Becker, Nicola Cotumaccio, Sung-Hwan Kim, Nicola Prezza, Carlo Tosoni. Encoding Co-Lex Orders of Finite-State Automata in Linear Space
  • Peaker Guo, Kaisei Kishi. Net Occurrences in Fibonacci and Thue-Morse Words
  • Hideo Bannai, Tomohiro I, Yuto Nakashima. On the compressiveness of the Burrows-Wheeler transform
  • Nicola Cotumaccio. Improved Circular Dictionary Matching
  • Jarno N. Alanko, Ruben Becker, Davide Cenzato, Travis Gagie, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza. The Trie Measure, Revisited
  • Hideo Bannai, Philip Bille, Inge Li Gørtz, Gad M. Landau, Gonzalo Navarro, Nicola Prezza, Teresa Anna Steiner, Simon Rumle Tarnow. Text Indexing for Simple Regular Expressions
  • Philip Bille, Inge Li Gørtz, Simon Puglisi, Simon R. Tarnow. Compressed Dictionary Matching on Run-Length Encoded Strings
  • Bowie Liu, Dennis Wong, Chan-Tong Lam, Sio-Kei Im. Generating a cyclic 2-Gray code for Lucas words in constant amortized time
  • Takuya Mieno, Shunsuke Inenaga. Space-Efficient Online Computation of String Net Occurrences
  • Waseem Akram, Takuya Mieno. Sorted Consecutive Occurrence Queries in Substrings
  • Seungbum Jo, Srinivasa Rao Satti. Encodings for Range Minimum Queries over Bounded Alphabets
  • Eric Osterkamp, Dominik Köppl. Extending the Burrows-Wheeler Transform for Cartesian Tree Matching, Constructing It
  • Simon R. Tarnow, Philip Bille, Inge Li Gørtz. Succinct Data Structures for Segments