Day 0 - Sept. 25
Day 1 - Sept. 26
Venue: Sala Gerace, Department of Computer Science, Largo Pontecorvo, 3, Pisa.
Paper Slots: Long papers: 20 min + 5 min for Q&A. Short Papers: 10 min + 5 min for Q&A.
| 08.15 – 08:45 | Registration |
| 08.45 – 09:00 | Opening |
| 09.00 – 10:00 | Keynote | Jakub Radoszewski | “Recent Results on the Longest Common Substring Problem” | SLIDES | Chair: Nadia Pisanti |
| 10.00 – 10:30 | Coffee Break |
| 10.30 – 11:45 | Paper Session #1 | Chair: Wiktor Zuba - Éric Fusy and Gregory Kucherov. Count-min Sketch with Variable Number of Hash Functions: an Experimental Study.
- Paolo Ferragina, Mariagiovanna Rotundo and Giorgio Vinciguerra. Engineering a Textbook Approach to Index Massive String Dictionaries.
- Łukasz Kondraciuk. String Covers of a Tree Revisited.
|
| 11.45 – 12:00 | Self-made Coffee |
| 12.00 – 13:05 | Paper Session #2 | Chair: Marinella Sciortino - Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti and Nicola Prezza. Optimal Wheeler Language Recognition.
- Nicola Cotumaccio, Travis Gagie, Dominik Koeppl and Nicola Prezza. Space-time Trade-offs for the LCP Array of Wheeler DFAs.
- Zsuzsanna Liptak, Francesco Masillo, Gonzalo Navarro and Aaron Williams. Constant Time and Space Updates for the Sigma-Tau Problem. Short Paper.
|
| 13:05 – 14:30 | Lunch |
| 14:30 – 15:45 | Paper Session #3 | Chair: Daniel Gibney - Alessio Conte, Roberto Grossi and Davide Rucci. CAGE: Cache-Aware Graphlet Enumeration.
- Benjamín Letelier, Nieves R. Brisaboa, Pablo Gutiérrez-Asorey, José R. Paramá and Tirso V. Rodeiro. Compacting Massive Public Transport Data.
- Travis Gagie, Meng He and Michael St. Denis. Dynamic Compact Planar Embeddings.
|
| 15:45 – 16:15 | Coffee Break |
| 16:15 – 16:55 | Paper Session #4 | Chair: Jarno Alanko - Diego Arroyuelo, Adrián Gómez Brandón and Gonzalo Navarro. Evaluating Regular Path Queries on Compressed Adjacency Matrices.
- Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima and Mizuki Sue. Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. Short Paper.
|
Day 2 - Sept. 27
Venue: Sala Gerace, Department of Computer Science, Largo Pontecorvo, 3, Pisa.
Paper Slots: Long papers: 20 min + 5 min for Q&A. Short Papers: 10 min + 5 min for Q&A.
| 09.00 – 10:00 | Keynote | Sebastian Bruch | “Information Retrieval Needs More Theoreticians” | SLIDES | Chair: Franco Maria Nardini |
| 10.00 – 10:30 | Coffee Break |
| 10.30 – 11:45 | Paper Session #5 | Chair: Zsuzsanna Lipták - Nicola Rizzo, Manuel Cáceres and Veli Mäkinen. Chaining of Maximal Exact Matches in Graphs.
- Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, Dominik Köppl and Massimiliano Rossi. Data Structures for SMEM-Finding in the PBWT.
- Adam Cicherski and Norbert Dojer. From De Bruijn Graphs to Variation Graphs – Relationships between Pangenome Models.
|
| 11.45 – 12:00 | Self-made Coffee |
| 12.00 – 13:05 | Paper Session #6 | Chair: Giulia Bernardini - Guillaume Blin, Alexandru Popa, Mathieu Raffinot and Raluca Uricaru. Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem.
- Lusheng Wang and Binhai Zhu. Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems
- Solon Pissis, Michael Shekelyan, Chang Liu and Grigorios Loukides. Frequency-Constrained Substring Complexity. Short Paper.
|
| 13:05 – 14:30 | Lunch |
| 14:30 – 15:45 | Paper Session #7 | Chair: Gabriele Fici - Kaisei Kishi, Yuto Nakashima and Shunsuke Inenaga. Largest Repetition Factorization of Fibonacci Words.
- Haruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka and Ayumi Shinohara. Efficient Parameterized Pattern Matching in Sublinear Space.
- Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga and Hideo Bannai. Generalized Minimal Absent Words of Multiple Strings.
|
| 15:45 – 16:15 | Coffee Break |
| 16:15 – 17:30 | Community Meeting |
| 17:45 – 20:00 | Walking Tour of Pisa (meeting point: Martiri della Libertà Square, in front of the RUFUS ice cream shop)
|
| 20:00 – 23:55 | Gala Dinner (Hotel Duomo, via Santa Maria, 94) |
Day 3 - Sept. 28
Venue: Sala Gerace, Department of Computer Science, Largo Pontecorvo, 3, Pisa.
Paper Slots: Long papers: 20 min + 5 min for Q&A. Short Papers: 10 min + 5 min for Q&A.
| 09.00 – 10:00 |
Keynote | Inge Li Gørtz | “Regular Expression Matching” | SLIDES | Chair: Rossano Venturini |
| 10.00 – 10:30 |
Coffee Break |
| 10.30 – 11:45 |
Paper Session #8 | Chair: Johannes Fischer
- Amihood Amir, Eitan Kondratovsky and Avivit Levy. On Suffix Tree Detection.
- Bastien Auvray, Julien David, Richard Groult and Thierry Lecroq. Approximate Cartesian Tree Matching: an Approach Using Swaps.
- Jarno Alanko, Elena Biagi and Simon Puglisi. Longest Common Prefix Arrays for Succinct k-Spectra.
|
| 11.45 – 12:00 |
Self-made Coffee |
| 12.00 – 13:05 |
Paper Session #9 | Chair: Golnaz Badkobah
- Jonas Ellert. Sublinear Time Lempel-Ziv 77 Factorization.
- Jonas Ellert, Johannes Fischer and Max Rishøj Pedersen. New Advances in Rightmost Lempel-Ziv.
- Pawel Gawrychowski, Maria Kosche and Florin Manea. On the Number of Factors in the LZ-End Factorization. Short Paper.
|
| 13:05 – 14:30 |
Lunch |
| 14:30 – 15:45 |
Paper Session #10 | Chair: Veronica Guerrini
- Lorenzo Carfagna and Giovanni Manzini. Compressibility Measures for Two-dimensional Data.
- Igor Zavadskyi and Maksym Kovalchuk. Binary Mixed-digit Data Compression Codes.
- Daniel Gibney, Paul MacNichol and Sharma V. Thankachan. Non-Overlapping Indexing in BWT-runs Bounded Space.
|
| 15:45 – 16:15 |
Coffee Break |
| 16:15 – 16:55 |
Paper Session #11 | Chair: Thierry Lecroq
- Diego Diaz and Leena Salmela. Computing all-vs-all MEMs in Grammar-compressed Text.
- Travis Gagie, Sana Kashgouli and Gonzalo Navarro. A Simple Grammar-based Index for Finding Approximately Longest Common Substrings. Short Paper.
|
| 16:55 – 17:00 |
Closing Remarks |
