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

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