No. Title Author Year
1 On Strings Having the Same Length- k Substrings Bernardini, Giulia et al. 2022
2 Finding Structurally and Temporally Similar Trajectories in Graphs Grossi, Roberto et al. 2020
3 Finding the Anticover of a String Alzamel, Mai et al. 2020
4 Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs Conte, Alessio et al. 2019
5 On the Complexity of String Matching for Graphs Equi, Massimo et al. 2019
6 Degenerate String Comparison and Applications Alzamel, Mai et al. 2018
7 Listing Subgraphs by Cartesian Decomposition Conte, Alessio et al. 2018
8 Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables Grossi, Roberto et al. 2018
9 On-Line Pattern Matching on Similar Texts Grossi, Roberto et al. 2017
10 Front Matter, Table of Contents, Preface Grossi, Roberto et al. 2016
11 LIPIcs, Volume 54, CPM'16, Complete Volume Grossi, Roberto et al. 2016
12 Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques Conte, Alessio et al. 2016
13 Output-Sensitive Pattern Extraction in Sequences Grossi, Roberto et al. 2014
14 Optimal Packed String Matching Ben-Kiki, Oren et al. 2011
15 More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries Grossi, Roberto et al. 2009
16 Optimal Cache-Aware Suffix Selection Franceschini, Gianni et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 16

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI