Roberto Grossi

215 papers A* 29A 13B 27C 21Misc 3Journal 94Unranked 25
YearRankTypeTitle / Venue / Authors
2026 J jnl
Fast Assessment of Eulerian Trails in Graphs with Applications.
ACM Trans. Knowl. Discov. Data
Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi
2026 J jnl
Finding the cyclic covers of a string.
Inf. Process. Lett.
Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba
2026 J jnl
Variations on the Problem of Identifying Spectrum-Preserving String Sets.
CoRR
Sankardeep Chakraborty, Roberto Grossi, Ren Kimura, Giulia Punzi, Kunihiko Sadakane, Wiktor Zuba
2025 J jnl
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size.
Algorithmica
Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa
2025 A* conf
Indexing Strings with Utilities.
ICDE
Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Veronica Guerrini, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis
2025 J jnl
Indexing Strings with Utilities.
CoRR
Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Veronica Guerrini, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis
2025 J jnl
Listing maximal H-free subgraphs.
Discret. Appl. Math.
Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno
2025 J jnl
Output-sensitive enumeration of maximal cliques in temporal graphs.
Discret. Appl. Math.
Filippo Brunelli, Alessio Conte, Roberto Grossi, Andrea Marino
2025 — conf
Wavelet Tree, Part II: Text Indexing.
The Expanding World of Compressed Data
Paolo Ferragina, Raffaele Giancarlo, Roberto Grossi, Giovanna Rosone, Rossano Venturini, Jeffrey Scott Vitter
2025 J jnl
sc McDag: indexing maximal common subsequences for k strings.
Algorithms Mol. Biol.
Giovanni Buzzega, Alessio Conte, Roberto Grossi, Giulia Punzi
2024 C conf
A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs.
WABI
Rocco Ascone, Giulia Bernardini, Alessio Conte, Massimo Equi, Estéban Gabory, Roberto Grossi, Nadia Pisanti
2024 J jnl
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size.
CoRR
Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa
2024 C conf
McDag: Indexing Maximal Common Subsequences in Practice.
WABI
Giovanni Buzzega, Alessio Conte, Roberto Grossi, Giulia Punzi
2024 J jnl
On Breaking Truss-based and Core-based Communities.
ACM Trans. Knowl. Discov. Data
Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Michelle Sweering
2024 J jnl
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs.
Algorithmica
Giulia Punzi, Alessio Conte, Roberto Grossi, Romeo Rizzi
2024 A conf
Utility-Oriented String Mining.
SDM
Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Veronica Guerrini, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis
2023 B conf
A Compact DAG for Storing and Searching Maximal Common Subsequences.
ISAAC
Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
2023 J jnl
A Compact DAG for Storing and Searching Maximal Common Subsequences.
CoRR
Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
2023 A conf
An Efficient Algorithm for Assessing the Number of
SDM
Giulia Punzi, Alessio Conte, Roberto Grossi, Andrea Marino
2023 C conf
CAGE: Cache-Aware Graphlet Enumeration.
SPIRE
Alessio Conte, Roberto Grossi, Davide Rucci
2023 B conf
Finding the Cyclic Covers of a String.
WALCOM
Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba
2023 J jnl
Hide and Mine in Strings: Hardness, Algorithms, and Experiments.
IEEE Trans. Knowl. Data Eng.
Giulia Bernardini, Alessio Conte, Garance Gourdel, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi, Leen Stougie, Michelle Sweering
2023 J jnl
On the Complexity of String Matching for Graphs.
ACM Trans. Algorithms
Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu, Roberto Grossi
2023 J jnl
Succinct representation for (non)deterministic finite automata.
J. Comput. Syst. Sci.
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
2023 J jnl
phyBWT2: phylogeny reconstruction via eBWT positional clustering.
Algorithms Mol. Biol.
Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone, Lorenzo Tattini
2022 J jnl
Enumeration of Maximal Common Subsequences Between Two Strings.
Algorithmica
Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
2022 B conf
On Strings Having the Same Length- k Substrings.
CPM
Giulia Bernardini, Alessio Conte, Estéban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, Michelle Sweering
2022 J jnl
Proximity Search for Maximal Subgraph Enumeration.
SIAM J. Comput.
Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari
2022 C conf
phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering.
WABI
Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone, Lorenzo Tattini
2021 B conf
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails.
FCT
Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi
2021 J jnl
Combinatorial Algorithms for String Sanitization.
ACM Trans. Knowl. Discov. Data
Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone, Michelle Sweering
2021 J jnl
K-plex cover pooling for graph neural networks.
Data Min. Knowl. Discov.
Davide Bacciu, Alessio Conte, Roberto Grossi, Francesco Landolfi, Andrea Marino
2021 A* conf
On Breaking Truss-Based Communities.
KDD
Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Michelle Sweering
2021 C conf
Succinct Representations for (Non)Deterministic Finite Automata.
LATA
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
2020 J jnl
Comparing Degenerate Strings.
Fundam. Informaticae
Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
2020 J jnl
Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019).
Theory Comput. Syst.
Nadia Pisanti, Charles J. Colbourn, Roberto Grossi
2020 J jnl
Efficient Estimation of Graph Trussness.
CoRR
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
2020 B conf
Finding Structurally and Temporally Similar Trajectories in Graphs.
SEA
Roberto Grossi, Andrea Marino, Shima Moghtasedi
2020 B conf
Finding the Anticover of a String.
CPM
Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa
2020 A* conf
Hide and Mine in Strings: Hardness and Algorithms.
ICDM
Giulia Bernardini, Alessio Conte, Garance Gourdel, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi, Leen Stougie, Michelle Sweering
2020 B conf
High-Quality Prediction of Tourist Movements using Temporal Trajectories in Graphs.
ASONAM
Shima Moghtasedi, Cristina Ioana Muntean, Franco Maria Nardini, Roberto Grossi, Andrea Marino
2020 J jnl
Large-scale clique cover of real-world networks.
Inf. Comput.
Alessio Conte, Roberto Grossi, Andrea Marino
2020 J jnl
Longest property-preserved common factor: A new string-processing framework.
Theor. Comput. Sci.
Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
2020 J jnl
On Bubble Generators in Directed Graphs.
Algorithmica
Vicente Acuña, Roberto Grossi, Giuseppe Francesco Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri
2020 J jnl
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs.
Algorithmica
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
2020 J jnl
Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs.
IEEE Access
Alessio Conte, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari
2020 J jnl
Zuckerli: A New Compressed Representation for Graphs.
IEEE Access
Luca Versari, Iulia-Maria Comsa, Alessio Conte, Roberto Grossi
2020 J jnl
Zuckerli: A New Compressed Representation for Graphs.
CoRR
Luca Versari, Iulia M. Comsa, Alessio Conte, Roberto Grossi
2019 J jnl
A fast discovery algorithm for large common connected induced subgraphs.
Discret. Appl. Math.
Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari
2019 C ed.
Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings
IWOCA
Charles J. Colbourn, Roberto Grossi, Nadia Pisanti
2019 B conf
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs.
MFCS
Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa
2019 J jnl
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties.
SIAM J. Discret. Math.
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
2019 J jnl
On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree.
CoRR
Massimo Equi, Roberto Grossi, Veli Mäkinen
2019 J jnl
On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching.
CoRR
Massimo Equi, Roberto Grossi, Alexandru I. Tomescu, Veli Mäkinen
2019 A* conf
On the Complexity of String Matching for Graphs.
ICALP
Massimo Equi, Roberto Grossi, Veli Mäkinen, Alexandru I. Tomescu
2019 C conf
Polynomial-Delay Enumeration of Maximal Common Subsequences.
SPIRE
Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
2019 J jnl
Proximity Search For Maximal Subgraph Enumeration.
CoRR
Alessio Conte, Andrea Marino, Roberto Grossi, Takeaki Uno, Luca Versari
2019 — conf
String Sanitization: A Combinatorial Approach.
ECML/PKDD (1)
Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
2019 J jnl
String Sanitization: A Combinatorial Approach.
CoRR
Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
2019 J jnl
Succinct Representation for (Non)Deterministic Finite Automata.
CoRR
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
2018 C conf
Compressed Communication Complexity of Longest Common Prefixes.
SPIRE
Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg
2018 J jnl
Compressed Communication Complexity of Longest Common Prefixes.
CoRR
Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg
2018 A* conf
D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes.
KDD
Alessio Conte, Tiziano De Matteis, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari
2018 C conf
Degenerate String Comparison and Applications.
WABI
Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
2018 — conf
Discovering $k$-Trusses in Large-Scale Networks.
HPEC
Alessio Conte, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari
2018 B conf
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs.
LATIN
Roberto Grossi, Andrea Marino, Luca Versari
2018 J jnl
Efficient enumeration of graph orientations with sources.
Discret. Appl. Math.
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
2018 Misc conf
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search.
COCOON
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
2018 J jnl
Listing Maximal Subgraphs in Strongly Accessible Set Systems.
CoRR
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
2018 B conf
Listing Subgraphs by Cartesian Decomposition.
MFCS
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari
2018 C conf
Longest Property-Preserved Common Factor.
SPIRE
Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
2018 J jnl
Longest Property-Preserved Common Factor.
CoRR
Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
2018 J jnl
Motif trie: An efficient text index for pattern discovery with don't cares.
Theor. Comput. Sci.
Roberto Grossi, Giulia Menconi, Nadia Pisanti, Roberto Trani, Søren Vind
2018 A* conf
Node Similarity with q -Grams for Real-World Labeled Networks.
KDD
Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno
2018 A conf
Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables.
ESA
Roberto Grossi, Luca Versari
2018 J jnl
Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables.
CoRR
Roberto Grossi, Luca Versari
2018 B conf
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts.
WG
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari
2017 — conf
A Fast Algorithm for Large Common Connected Induced Subgraphs.
AlCoB
Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari
2017 J jnl
Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-
ACM Trans. Algorithms
Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao
2017 C conf
Listing Maximal Independent Sets with Minimal Space and Bounded Delay.
SPIRE
Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari
2017 B conf
On Bubble Generators in Directed Graphs.
WG
Vicente Acuña, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri
2017 B conf
On-Line Pattern Matching on Similar Texts.
CPM
Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari
2016 B ed.
27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, Tel Aviv, Israel, June 27-29, 2016
CPM
Roberto Grossi, Moshe Lewenstein
2016 J jnl
Circular sequence comparison: algorithms and applications.
Algorithms Mol. Biol.
Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani
2016 Misc conf
Clique covering of large real-world networks.
SAC
Alessio Conte, Roberto Grossi, Andrea Marino
2016 C conf
Directing Road Networks by Listing Strong Orientations.
IWOCA
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari
2016 — ch.
Enumeration of Paths, Cycles, and Spanning Trees.
Encyclopedia of Algorithms
Roberto Grossi
2016 J jnl
Erratum to: Circular sequence comparison: algorithms and applications.
Algorithms Mol. Biol.
Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani
2016 J jnl
Linear-size suffix tries.
Theor. Comput. Sci.
Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi
2016 B conf
Listing Acyclic Orientations of Graphs with Single and Multiple Sources.
LATIN
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
2016 A* conf
New Bounds for Approximating Extremal Distances in Undirected Graphs.
SODA
Massimo Cairo, Roberto Grossi, Romeo Rizzi
2016 A* conf
Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques.
ICALP
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
2016 — ch.
Wavelet Trees.
Encyclopedia of Algorithms
Roberto Grossi
2015 C conf
Circular Sequence Comparison with q-grams.
WABI
Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani
2015 J jnl
Computing the Burrows-Wheeler transform in place and in small space.
J. Discrete Algorithms
Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau
2015 C conf
Enumerating Cyclic Orientations of a Graph.
IWOCA
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
2015 J jnl
Enumerating Cyclic Orientations of a Graph.
CoRR
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
2014 A conf
Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs.
ESA
Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot
2014 J jnl
Amortized Õ(|V|)-Delay Algorithm for Listing Chordless Cycles in Undirected Graphs.
CoRR
Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot
2014 — conf
Colored Range Searching in Linear Space.
SWAT
Roberto Grossi, Søren Vind
2014 J jnl
Fast Compressed Tries through Path Decompositions.
ACM J. Exp. Algorithmics
Roberto Grossi, Giuseppe Ottaviano
2014 J jnl
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing.
SIAM J. Comput.
Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein
2014 — conf
Output-Sensitive Pattern Extraction in Sequences.
FSTTCS
Roberto Grossi, Giulia Menconi, Nadia Pisanti, Roberto Trani, Søren Vind
2014 J jnl
Towards optimal packed string matching.
Theor. Comput. Sci.
Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann
2013 B conf
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform.
CPM
Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau
2013 B conf
Design of Practical Succinct Data Structures for Large Data Collections.
SEA
Roberto Grossi, Giuseppe Ottaviano
2013 — conf
Dynamic Compressed Strings with Random Access.
ICALP (1)
Roberto Grossi, Rajeev Raman, Srinivasa Rao Satti, Rossano Venturini
2013 J jnl
Editorial.
J. Discrete Algorithms
Roberto Grossi, Fabrizio Sebastiani, Fabrizio Silvestri
2013 A conf
Encodings for Range Selection and Top-k Queries.
ESA
Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti
2013 J jnl
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing.
CoRR
Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein
2013 J jnl
Mobilomics in Saccharomyces cerevisiae strains.
BMC Bioinform.
Giulia Menconi, Giovanni Battaglia, Roberto Grossi, Nadia Pisanti, Roberto Marangoni
2013 J jnl
On computing the diameter of real-world undirected graphs.
Theor. Comput. Sci.
Pilu Crescenzi, Roberto Grossi, Michel Habib, Leonardo Lanzi, Andrea Marino
2013 A* conf
Optimal Listing of Cycles and st-Paths in Undirected Graphs.
SODA
Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Sacomoto
2013 C conf
Pattern Discovery and Listing in Graphs.
SPIRE
Roberto Grossi
2013 — conf
Random Access to High-Order Entropy Compressed Text.
Space-Efficient Data Structures, Streams, and Algorithms
Roberto Grossi
2013 J jnl
Simple real-time constant-space string matching.
Theor. Comput. Sci.
Dany Breslauer, Roberto Grossi, Filippo Mignosi
2012 — conf
A Taste of Yeast Mobilomics.
BIOINFORMATICS
Giulia Menconi, Giovanni Battaglia, Roberto Grossi, Nadia Pisanti, Roberto Marangoni
2012 J jnl
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings.
Inf. Comput.
Giovanni Battaglia, Roberto Grossi, Noemi Scutellà
2012 B conf
Constant-Time Word-Size String Matching.
CPM
Dany Breslauer, Leszek Gasieniec, Roberto Grossi
2012 C conf
Efficient Bubble Enumeration in Directed Graphs.
SPIRE
Etienne Birmelé, Pierluigi Crescenzi, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot
2012 A conf
Fast Compressed Tries through Path Decompositions.
ALENEX
Giuseppe Ottaviano, Roberto Grossi
2012 B conf
On Computing the Diameter of Real-World Directed (Weighted) Graphs.
SEA
Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino
2012 J jnl
Optimal Listing of Cycles and st-Paths in Undirected Graphs
CoRR
Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot
2012 J jnl
The Wavelet Trie: Maintaining an Indexed Sequence of Strings in Compressed Space
CoRR
Roberto Grossi, Giuseppe Ottaviano
2012 A* conf
The wavelet trie: maintaining an indexed sequence of strings in compressed space.
PODS
Roberto Grossi, Giuseppe Ottaviano
2011 — conf
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs.
TAPAS
Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino
2011 J jnl
A quick tour on suffix arrays and compressed suffix arrays.
Theor. Comput. Sci.
Roberto Grossi
2011 J jnl
Consecutive Ones Property and PQ-Trees for Multisets: Hardness of Counting Their Orderings
CoRR
Giovanni Battaglia, Roberto Grossi, Noemi Scutellà
2011 C conf
Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees.
Developments in Language Theory
Giovanni Battaglia, Roberto Grossi, Noemi Scutellà
2011 J jnl
Fast Compressed Tries through Path Decompositions
CoRR
Roberto Grossi, Giuseppe Ottaviano
2011 — conf
Inferring Mobile Elements in S. Cerevisiae Strains.
BIOINFORMATICS
Giulia Menconi, Giovanni Battaglia, Roberto Grossi, Nadia Pisanti, Roberto Marangoni
2011 J jnl
MADMX: A Strategy for Maximal Dense Motif Extraction.
J. Comput. Biol.
Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin
2011 — conf
Optimal Packed String Matching.
FSTTCS
Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann
2011 A conf
Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs.
ESA
Rui A. Ferreira, Roberto Grossi, Romeo Rizzi
2011 J jnl
Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection
CoRR
Gianni Franceschini, Roberto Grossi, S. Muthukrishnan
2011 A conf
Semi-indexing semi-structured data in tiny space.
CIKM
Giuseppe Ottaviano, Roberto Grossi
2011 B conf
Simple Real-Time Constant-Space String Matching.
CPM
Dany Breslauer, Roberto Grossi, Filippo Mignosi
2011 C ed.
String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings
SPIRE
Roberto Grossi, Fabrizio Sebastiani, Fabrizio Silvestri
2011 — conf
Wavelet Trees: From Theory to Practice.
CCP
Roberto Grossi, Jeffrey Scott Vitter, Bojian Xu
2010 — conf
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound.
ESA (1)
Pierluigi Crescenzi, Roberto Grossi, Claudio Imbrenda, Leonardo Lanzi, Andrea Marino
2010 Misc conf
Fun with Olympiad in Algorithmics.
FUN
Roberto Grossi, Alessio Orlandi, Giuseppe Ottaviano
2010 J jnl
MADMX: A Novel Strategy for Maximal Dense Motif Extraction
CoRR
Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin
2010 J jnl
Optimal Trade-Off for Succinct String Indexes
CoRR
Roberto Grossi, Alessio Orlandi, Rajeev Raman
2010 — conf
Optimal Trade-Offs for Succinct String Indexes.
ICALP (1)
Roberto Grossi, Alessio Orlandi, Rajeev Raman
2009 C conf
MADMX: A Novel Strategy for Maximal Dense Motif Extraction.
WABI
Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin
2009 J jnl
Masking patterns in sequences: A new class of motif discovery with don't cares.
Theor. Comput. Sci.
Giovanni Battaglia, Davide Cangelosi, Roberto Grossi, Nadia Pisanti
2009 — conf
Mining Biological Sequences with Masks.
DEXA Workshops
Giovanni Battaglia, Roberto Grossi, Roberto Marangoni, Nadia Pisanti
2009 J jnl
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
CoRR
Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
2009 A conf
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries.
STACS
Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
2009 A conf
Optimal Cache-Aware Suffix Selection.
STACS
Gianni Franceschini, Roberto Grossi, S. Muthukrishnan
2009 J jnl
Optimal cache-aware suffix selection
CoRR
Gianni Franceschini, Roberto Grossi, S. Muthukrishnan
2009 B conf
Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques.
CPM
Roberto Grossi
2008 — conf
Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform.
ANALCO
Ankur Gupta, Roberto Grossi, Jeffrey Scott Vitter
2008 J jnl
No sorting? better searching!
ACM Trans. Algorithms
Gianni Franceschini, Roberto Grossi
2008 A* conf
On searching compressed string collections cache-obliviously.
PODS
Paolo Ferragina, Roberto Grossi, Ankur Gupta, Rahul Shah, Jeffrey Scott Vitter
2007 A conf
On the Size of Succinct Indices.
ESA
Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao
2006 A conf
Amortized Rigidness in Dynamic Cartesian Trees.
STACS
Iwona Bialynicka-Birula, Roberto Grossi
2006 J jnl
Foreword.
Theory Comput. Syst.
Paolo Ferragina, Roberto Grossi, Fabrizio Luccio
2006 J jnl
Optimal Implicit Dictionaries over Unbounded Universes.
Theory Comput. Syst.
Gianni Franceschini, Roberto Grossi
2006 A* conf
Squeezing succinct data structures into entropy bounds.
SODA
Kunihiko Sadakane, Roberto Grossi
2006 J jnl
When indexing equals compression: Experiments with compressing suffix arrays and applications.
ACM Trans. Algorithms
Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter
2005 J jnl
Bases of Motifs for Generating Repeated Patterns with Wild Cards.
IEEE ACM Trans. Comput. Biol. Bioinform.
Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot
2005 J jnl
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching.
SIAM J. Comput.
Roberto Grossi, Jeffrey Scott Vitter
2005 — conf
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms.
WEA
Filippo Geraci, Roberto Grossi
2005 A* conf
Optimal In-place Sorting of Vectors and Records.
ICALP
Gianni Franceschini, Roberto Grossi
2005 C conf
Rank-Sensitive Data Structures.
SPIRE
Iwona Bialynicka-Birula, Roberto Grossi
2004 A* conf
A General Technique for Managing Strings in Comparison-Driven Data Structures.
ICALP
Gianni Franceschini, Roberto Grossi
2004 B conf
A Trie-Based Approach for Compacting Automata.
CPM
Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi
2004 B conf
Fast Compression with a Static Model in High-Order Entropy.
Data Compression Conference
Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter
2004 J jnl
Implicit
J. Comput. Syst. Sci.
Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
2004 A* conf
No Sorting? Better Searching!
FOCS
Gianni Franceschini, Roberto Grossi
2004 A* conf
When indexing equals compression: experiments with compressing suffix arrays and applications.
SODA
Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter
2003 B conf
A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum.
MFCS
Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot
2003 A* conf
High-order entropy-compressed text indexes.
SODA
Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter
2003 A* conf
Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time.
SODA
Gianni Franceschini, Roberto Grossi
2003 A* conf
Optimal Cache-Oblivious Implicit Dictionaries.
ICALP
Gianni Franceschini, Roberto Grossi
2003 B conf
Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees.
WADS
Gianni Franceschini, Roberto Grossi
2003 — conf
Search Data Structures for Skewed Strings.
WEA
Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano
2003 J jnl
Text sparsification via local maxima.
Theor. Comput. Sci.
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
2002 — conf
Compressed Indexes for Fast Search in Sequences.
JCIS
Jeffrey Scott Vitter, Roberto Grossi
2002 A* conf
Implicit B-Trees: New Results for the Dictionary Problem.
FOCS
Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
2002 J jnl
Optimal Deterministic Protocols for Mobile Robots on a Grid.
Inf. Comput.
Roberto Grossi, Andrea Pietracaprina, Geppino Pucci
2000 A* conf
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract).
STOC
Roberto Grossi, Jeffrey Scott Vitter
2000 — conf
Text Sparsification via Local Maxima.
FSTTCS
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
1999 — conf
A Fast H.261 Software Codec for High Quality Videoconferencing on PCs.
ICMCS, Vol. 2
Alessandro Bellini, Alberto Del Lungo, Fabio Gori, Roberto Grossi, Marco Guarducci
1999 J jnl
Efficient Splitting and Merging Algorithms for Order Decomposable Problems.
Inf. Comput.
Roberto Grossi, Giuseppe F. Italiano
1999 A* conf
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures.
ICALP
Roberto Grossi, Giuseppe F. Italiano
1999 A conf
IP Address Lookup Made Fast and Simple.
ESA
Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi
1999 J jnl
Improved Dynamic Text Indexing.
J. Algorithms
Paolo Ferragina, Roberto Grossi
1999 J jnl
Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices.
J. Complex.
Raffaele Giancarlo, Roberto Grossi
1999 J jnl
The String B-tree: A New Data Structure for String Search in External Memory and Its Applications.
J. ACM
Paolo Ferragina, Roberto Grossi
1998 — conf
Efficient cross-trees for external memory.
External Memory Algorithms
Roberto Grossi, Giuseppe F. Italiano
1998 J jnl
On Updating Suffix Tree Labels.
Theor. Comput. Sci.
Paolo Ferragina, Roberto Grossi, Manuela Montangero
1998 — conf
Optimal Deterministic Protocols for Mobile Robots on a Grid.
SWAT
Roberto Grossi, Andrea Pietracaprina, Geppino Pucci
1998 J jnl
Optimal On-Line Search and Sublinear Time Update in String Matching.
SIAM J. Comput.
Paolo Ferragina, Roberto Grossi
1998 J jnl
Simple Planar Graph Partition into Three Forests.
Discret. Appl. Math.
Roberto Grossi, Elena Lodi
1997 C conf
A Note on Updating Suffix Tree Labels.
CIAC
Paolo Ferragina, Roberto Grossi, Manuela Montangero
1997 A* conf
Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract).
ICALP
Roberto Grossi, Giuseppe F. Italiano
1997 J jnl
Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms.
J. Algorithms
Raffaele Giancarlo, Roberto Grossi
1997 A* conf
On Sorting Strings in External Memory (Extended Abstract).
STOC
Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter
1997 — conf
Sequence sorting in secondary storage.
SEQUENCES
Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter
1997 — ch.
Suffix tree data structures for matrices.
Pattern Matching Algorithms
Raffaele Giancarlo, Roberto Grossi
1996 A* conf
Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results.
SODA
Paolo Ferragina, Roberto Grossi
1996 J jnl
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications.
Inf. Comput.
Raffaele Giancarlo, Roberto Grossi
1995 A* conf
A fully-dynamic data structure for external substring search (Extended Abstract).
STOC
Paolo Ferragina, Roberto Grossi
1995 A* conf
Fast Incremental Text Editing.
SODA
Paolo Ferragina, Roberto Grossi
1995 B conf
Multi-Dimensional Pattern Matching with Dimensional Wildcards.
CPM
Raffaele Giancarlo, Roberto Grossi
1995 A* conf
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications.
ICALP
Raffaele Giancarlo, Roberto Grossi
1995 A* conf
Optimal On-Line Search and Sublinear Time Update in String Matching.
FOCS
Paolo Ferragina, Roberto Grossi
1993 J jnl
On Finding Commong Subtrees.
Theor. Comput. Sci.
Roberto Grossi
1993 B conf
Parallel Construction and Query of Suffix Trees for Two-Dimensional Matrices.
SPAA
Raffaele Giancarlo, Roberto Grossi
1992 J jnl
A fast VLSI solution for approximate string matching.
Integr.
Roberto Grossi
1991 J jnl
A Note on the Subtree Isomorphism for Ordered Trees and Related Problems.
Inf. Process. Lett.
Roberto Grossi
1991 J jnl
Further Comments on the Subtree Isomorphism for Ordered Trees.
Inf. Process. Lett.
Roberto Grossi
1989 J jnl
Simple and Efficient String Matching with k Mismatches.
Inf. Process. Lett.
Roberto Grossi, Fabrizio Luccio