| No. |
Title |
Author |
Year |
| 1 |
Suffix-Prefix Queries on a Dictionary |
Loukides, Grigorios et al. |
2023 |
| 2 |
Compact Text Indexing for Advanced Pattern Matching Problems: Parameterized, Order-Isomorphic, 2D, etc. (Invited Talk) |
Thankachan, Sharma V. |
2022 |
| 3 |
Feasibility of Flow Decomposition with Subpath Constraints in Linear Time |
Gibney, Daniel et al. |
2022 |
| 4 |
Fully Functional Parameterized Suffix Trees in Compact Space |
Ganguly, Arnab et al. |
2022 |
| 5 |
Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard |
Gibney, Daniel et al. |
2021 |
| 6 |
LF Successor: Compact Space Indexing for Order-Isomorphic Pattern Matching |
Ganguly, Arnab et al. |
2021 |
| 7 |
FM-Index Reveals the Reverse Suffix Array |
Ganguly, Arnab et al. |
2020 |
| 8 |
On the Complexity of BWT-Runs Minimization via Alphabet Reordering |
Bentley, Jason W. et al. |
2020 |
| 9 |
The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance |
Hoppenworth, Gary et al. |
2020 |
| 10 |
Categorical Range Reporting with Frequencies |
Ganguly, Arnab et al. |
2019 |
| 11 |
On the Hardness and Inapproximability of Recognizing Wheeler Graphs |
Gibney, Daniel et al. |
2019 |
| 12 |
Non-Overlapping Indexing - Cache Obliviously |
Hooshmand, Sahar et al. |
2018 |
| 13 |
The Heaviest Induced Ancestors Problem Revisited |
Abedin, Paniz et al. |
2018 |
| 14 |
Structural Pattern Matching - Succinctly |
Ganguly, Arnab et al. |
2017 |
| 15 |
Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching |
Ganguly, Arnab et al. |
2016 |
| 16 |
Space-Time Trade-Offs for the Shortest Unique Substring Problem |
Ganguly, Arnab et al. |
2016 |
| 17 |
Forbidden Extension Queries |
Biswas, Sudip et al. |
2015 |
| 18 |
Shared-Constraint Range Reporting |
Biswas, Sudip et al. |
2015 |
