Roberto Grossi

ORCID

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 83

Top Venues

Publications

Rocco Ascone, Giulia Bernardini, Alessio Conte, Massimo Equi, Estéban Gabory, Roberto Grossi, Nadia Pisanti
A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs. WABI (2024)
Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Veronica Guerrini, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis
Utility-Oriented String Mining. SDM (2024)
Giulia Punzi, Alessio Conte, Roberto Grossi, Romeo Rizzi
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs. Algorithmica 86 (1) (2024)
Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Michelle Sweering
On Breaking Truss-based and Core-based Communities. ACM Trans. Knowl. Discov. Data 18 (6) (2024)
Giovanni Buzzega, Alessio Conte, Roberto Grossi, Giulia Punzi
McDag: Indexing Maximal Common Subsequences in Practice. WABI (2024)
Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. CoRR (2024)
Giulia Bernardini, Alessio Conte, Garance Gourdel, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi, Leen Stougie, Michelle Sweering
Hide and Mine in Strings: Hardness, Algorithms, and Experiments. IEEE Trans. Knowl. Data Eng. 35 (6) (2023)
Giulia Punzi, Alessio Conte, Roberto Grossi, Andrea Marino
-Paths in Large Graphs. SDM (2023)
Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
A Compact DAG for Storing and Searching Maximal Common Subsequences. ISAAC (2023)
Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone, Lorenzo Tattini
phyBWT2: phylogeny reconstruction via eBWT positional clustering. Algorithms Mol. Biol. 18 (1) (2023)
Alessio Conte, Roberto Grossi, Davide Rucci
CAGE: Cache-Aware Graphlet Enumeration. SPIRE (2023)
Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu, Roberto Grossi
On the Complexity of String Matching for Graphs. ACM Trans. Algorithms 19 (3) (2023)
Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba
Finding the Cyclic Covers of a String. WALCOM (2023)
Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
A Compact DAG for Storing and Searching Maximal Common Subsequences. CoRR (2023)
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct representation for (non)deterministic finite automata. J. Comput. Syst. Sci. 131 (2023)
Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari
Proximity Search for Maximal Subgraph Enumeration. SIAM J. Comput. 51 (5) (2022)
Giulia Bernardini, Alessio Conte, Estéban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, Michelle Sweering
On Strings Having the Same Length- k Substrings. CPM (2022)
Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone, Lorenzo Tattini
phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering. WABI (2022)
Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
Enumeration of Maximal Common Subsequences Between Two Strings. Algorithmica 84 (3) (2022)
Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Michelle Sweering
On Breaking Truss-Based Communities. KDD (2021)
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Representations for (Non)Deterministic Finite Automata. LATA (2021)
Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails. FCT (2021)
Davide Bacciu, Alessio Conte, Roberto Grossi, Francesco Landolfi, Andrea Marino
K-plex cover pooling for graph neural networks. Data Min. Knowl. Discov. 35 (5) (2021)
Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone, Michelle Sweering
Combinatorial Algorithms for String Sanitization. ACM Trans. Knowl. Discov. Data 15 (1) (2021)
Luca Versari, Iulia-Maria Comsa, Alessio Conte, Roberto Grossi
Zuckerli: A New Compressed Representation for Graphs. IEEE Access 8 (2020)
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs. Algorithmica 82 (6) (2020)
Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
Comparing Degenerate Strings. Fundam. Informaticae 175 (1-4) (2020)
Vicente Acuña, Roberto Grossi, Giuseppe Francesco Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri
On Bubble Generators in Directed Graphs. Algorithmica 82 (4) (2020)
Shima Moghtasedi, Cristina Ioana Muntean, Franco Maria Nardini, Roberto Grossi, Andrea Marino
High-Quality Prediction of Tourist Movements using Temporal Trajectories in Graphs. ASONAM (2020)
Alessio Conte, Roberto Grossi, Andrea Marino
Large-scale clique cover of real-world networks. Inf. Comput. 270 (2020)
Giulia Bernardini, Alessio Conte, Garance Gourdel, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi, Leen Stougie, Michelle Sweering
Hide and Mine in Strings: Hardness and Algorithms. ICDM (2020)
Nadia Pisanti, Charles J. Colbourn, Roberto Grossi
Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019). Theory Comput. Syst. 64 (7) (2020)
Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
Longest property-preserved common factor: A new string-processing framework. Theor. Comput. Sci. 812 (2020)
Luca Versari, Iulia M. Comsa, Alessio Conte, Roberto Grossi
Zuckerli: A New Compressed Representation for Graphs. CoRR (2020)
Alessio Conte, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari
Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs. IEEE Access 8 (2020)
Roberto Grossi, Andrea Marino, Shima Moghtasedi
Finding Structurally and Temporally Similar Trajectories in Graphs. SEA (2020)
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
Efficient Estimation of Graph Trussness. CoRR (2020)
Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa
Finding the Anticover of a String. CPM (2020)
Massimo Equi, Roberto Grossi, Veli Mäkinen
On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree. CoRR (2019)
Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno
Polynomial-Delay Enumeration of Maximal Common Subsequences. SPIRE (2019)
Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. MFCS (2019)
Alessio Conte, Andrea Marino, Roberto Grossi, Takeaki Uno, Luca Versari
Proximity Search For Maximal Subgraph Enumeration. CoRR (2019)
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Representation for (Non)Deterministic Finite Automata. CoRR (2019)
Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
String Sanitization: A Combinatorial Approach. ECML/PKDD (1) (2019)
Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari
A fast discovery algorithm for large common connected induced subgraphs. Discret. Appl. Math. 268 (2019)
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties. SIAM J. Discret. Math. 33 (2) (2019)
Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
String Sanitization: A Combinatorial Approach. CoRR (2019)
Massimo Equi, Roberto Grossi, Veli Mäkinen, Alexandru I. Tomescu
On the Complexity of String Matching for Graphs. ICALP (2019)
Massimo Equi, Roberto Grossi, Alexandru I. Tomescu, Veli Mäkinen
On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching. CoRR (2019)
Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
Longest Property-Preserved Common Factor. CoRR (2018)
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
Listing Maximal Subgraphs in Strongly Accessible Set Systems. CoRR (2018)
Alessio Conte, Tiziano De Matteis, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari
D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes. KDD (2018)
Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
Degenerate String Comparison and Applications. WABI (2018)
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search. COCOON (2018)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. WG (2018)
Roberto Grossi, Luca Versari
Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables. CoRR (2018)
Roberto Grossi, Giulia Menconi, Nadia Pisanti, Roberto Trani, Søren Vind
Motif trie: An efficient text index for pattern discovery with don't cares. Theor. Comput. Sci. 710 (2018)
Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg
Compressed Communication Complexity of Longest Common Prefixes. SPIRE (2018)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
Efficient enumeration of graph orientations with sources. Discret. Appl. Math. 246 (2018)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari
Listing Subgraphs by Cartesian Decomposition. MFCS (2018)
Roberto Grossi, Luca Versari
Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables. ESA (2018)
Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg
Compressed Communication Complexity of Longest Common Prefixes. CoRR (2018)
Alessio Conte, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari
Discovering $k$-Trusses in Large-Scale Networks. HPEC (2018)
Roberto Grossi, Andrea Marino, Luca Versari
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs. LATIN (2018)
Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone
Longest Property-Preserved Common Factor. SPIRE (2018)
Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno
Node Similarity with q -Grams for Real-World Labeled Networks. KDD (2018)
Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari
On-Line Pattern Matching on Similar Texts. CPM (2017)
Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari
A Fast Algorithm for Large Common Connected Induced Subgraphs. AlCoB (2017)
Vicente Acuña, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri
On Bubble Generators in Directed Graphs. WG (2017)
Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao
Queries. ACM Trans. Algorithms 13 (2) (2017)
Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari
Listing Maximal Independent Sets with Minimal Space and Bounded Delay. SPIRE (2017)
Massimo Cairo, Roberto Grossi, Romeo Rizzi
New Bounds for Approximating Extremal Distances in Undirected Graphs. SODA (2016)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
Listing Acyclic Orientations of Graphs with Single and Multiple Sources. LATIN (2016)
Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi
Linear-size suffix tries. Theor. Comput. Sci. 638 (2016)
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques. ICALP (2016)
Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani
Erratum to: Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11 (2016)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari
Directing Road Networks by Listing Strong Orientations. IWOCA (2016)
Alessio Conte, Roberto Grossi, Andrea Marino
Clique covering of large real-world networks. SAC (2016)
Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani
Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11 (2016)
Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani
Circular Sequence Comparison with q-grams. WABI (2015)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
Enumerating Cyclic Orientations of a Graph. IWOCA (2015)
Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau
Computing the Burrows-Wheeler transform in place and in small space. J. Discrete Algorithms 32 (2015)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
Enumerating Cyclic Orientations of a Graph. CoRR (2015)
Roberto Grossi, Giuseppe Ottaviano
Fast Compressed Tries through Path Decompositions. ACM J. Exp. Algorithmics 19 (1) (2014)
Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing. SIAM J. Comput. 43 (4) (2014)
Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot
Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. ESA (2014)
Roberto Grossi, Søren Vind
Colored Range Searching in Linear Space. SWAT (2014)
Roberto Grossi, Giulia Menconi, Nadia Pisanti, Roberto Trani, Søren Vind
Output-Sensitive Pattern Extraction in Sequences. FSTTCS (2014)
Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot
Amortized Õ(|V|)-Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. CoRR (2014)
Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann
Towards optimal packed string matching. Theor. Comput. Sci. 525 (2014)
Roberto Grossi
Pattern Discovery and Listing in Graphs. SPIRE (2013)
Roberto Grossi, Fabrizio Sebastiani, Fabrizio Silvestri
Editorial. J. Discrete Algorithms 18 (2013)
Pilu Crescenzi, Roberto Grossi, Michel Habib, Leonardo Lanzi, Andrea Marino
On computing the diameter of real-world undirected graphs. Theor. Comput. Sci. 514 (2013)
Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Sacomoto
Optimal Listing of Cycles and st-Paths in Undirected Graphs. SODA (2013)
Dany Breslauer, Roberto Grossi, Filippo Mignosi
Simple real-time constant-space string matching. Theor. Comput. Sci. 483 (2013)
Roberto Grossi, Rajeev Raman, Srinivasa Rao Satti, Rossano Venturini
Dynamic Compressed Strings with Random Access. ICALP (1) (2013)
Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform. CPM (2013)
Roberto Grossi, Giuseppe Ottaviano
Design of Practical Succinct Data Structures for Large Data Collections. SEA (2013)
Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti
Encodings for Range Selection and Top-k Queries. ESA (2013)
Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing. CoRR (2013)

Roberto Grossi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Roberto Grossi