| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges
|
Levy, Avivit
|
|
|
84 |
3 |
p. 590-638
|
article
|
| 2 |
Adaptive Succinctness
|
Arroyuelo, Diego
|
|
|
84 |
3 |
p. 694-718
|
article
|
| 3 |
An Axiomatic Approach to Time-Dependent Shortest Path Oracles
|
Kontogiannis, Spyros
|
|
|
84 |
3 |
p. 815-870
|
article
|
| 4 |
Computing Minimal Unique Substrings for a Sliding Window
|
Mieno, Takuya
|
|
|
84 |
3 |
p. 670-693
|
article
|
| 5 |
Computing The Maximum Exponent in a Stream
|
Merkurev, Oleg
|
|
|
84 |
3 |
p. 742-756
|
article
|
| 6 |
Enumeration of Maximal Common Subsequences Between Two Strings
|
Conte, Alessio
|
|
|
84 |
3 |
p. 757-783
|
article
|
| 7 |
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
|
Kędzierski, Aleksander
|
|
|
84 |
3 |
p. 566-589
|
article
|
| 8 |
On the Complexity of Recognizing Wheeler Graphs
|
Gibney, Daniel
|
|
|
84 |
3 |
p. 784-814
|
article
|
| 9 |
Safety in s-t Paths, Trails and Walks
|
Cairo, Massimo
|
|
|
84 |
3 |
p. 719-741
|
article
|
| 10 |
Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs
|
Egidi, Lavinia
|
|
|
84 |
3 |
p. 639-669
|
article
|
| 11 |
Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW)
|
Alzamel, Mai
|
|
|
84 |
3 |
p. 565
|
article
|
Journal description