Roberto Grossi
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
89
Venues
32
Active years
1993–2025
Best venue rank
A*
Where they publish
- A*ICALP10 papers
- BCPM9 papers
- CSPIRE8 papers
- A*SODA8 papers
- AESA7 papers
- CWABI6 papers
- A*KDD3 papers
- BMFCS3 papers
- ASTACS3 papers
- A*FOCS3 papers
- A*STOC3 papers
- ASDM2 papers
- BLATIN2 papers
- BWG2 papers
- CIWOCA2 papers
- A*PODS2 papers
- A*ICDE1 paper
- BISAAC1 paper
- BWALCOM1 paper
- BFCT1 paper
- CLATA1 paper
- A*ICDM1 paper
- NationalCOCOON1 paper
- MulticonferenceSAC1 paper
- AALENEX1 paper
- ACIKM1 paper
- CDLT1 paper
- NationalFUN1 paper
- BDCC1 paper
- BWADS1 paper
- CCIAC1 paper
- BSPAA1 paper
Papers
89 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | ICDE | Indexing Strings with Utilities. | Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Veronica Guerrini, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis |
| 2024 | SDM | Utility-Oriented String Mining. | Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Veronica Guerrini, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis |
| 2024 | WABI | A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs. | Rocco Ascone, Giulia Bernardini, Alessio Conte, Massimo Equi, Estban Gabory, Roberto Grossi, Nadia Pisanti |
| 2024 | WABI | McDag: Indexing Maximal Common Subsequences in Practice. | Giovanni Buzzega, Alessio Conte, Roberto Grossi, Giulia Punzi |
| 2023 | ISAAC | A Compact DAG for Storing and Searching Maximal Common Subsequences. | Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno |
| 2023 | SDM | An Efficient Algorithm for Assessing the Number of | Giulia Punzi, Alessio Conte, Roberto Grossi, Andrea Marino |
| 2023 | SPIRE | CAGE: Cache-Aware Graphlet Enumeration. | Alessio Conte, Roberto Grossi, Davide Rucci |
| 2023 | WALCOM | Finding the Cyclic Covers of a String. | Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba |
| 2022 | CPM | On Strings Having the Same Length- k Substrings. | Giulia Bernardini, Alessio Conte, Estban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, Michelle Sweering |
| 2022 | WABI | phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering. | Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone, Lorenzo Tattini |
| 2021 | FCT | Beyond the BEST Theorem: Fast Assessment of Eulerian Trails. | Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi |
| 2021 | KDD | On Breaking Truss-Based Communities. | Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Michelle Sweering |
| 2021 | LATA | Succinct Representations for (Non)Deterministic Finite Automata. | Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2020 | CPM | Finding the Anticover of a String. | Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa |
| 2020 | ICDM | Hide and Mine in Strings: Hardness and Algorithms. | Giulia Bernardini, Alessio Conte, Garance Gourdel, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi, Leen Stougie, Michelle Sweering |
| 2019 | ICALP | On the Complexity of String Matching for Graphs. | Massimo Equi, Roberto Grossi, Veli Mkinen, Alexandru I. Tomescu |
| 2019 | MFCS | Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. | Alessio Conte, Roberto Grossi, Mamadou Moustapha Kant, Andrea Marino, Takeaki Uno, Kunihiro Wasa |
| 2019 | SPIRE | Polynomial-Delay Enumeration of Maximal Common Subsequences. | Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno |
| 2018 | COCOON | Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search. | Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari |
| 2018 | ESA | Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables. | Roberto Grossi, Luca Versari |
| 2018 | KDD | Node Similarity with q -Grams for Real-World Labeled Networks. | Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno |
| 2018 | KDD | D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes. | Alessio Conte, Tiziano De Matteis, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari |
| 2018 | LATIN | Efficient Algorithms for Listing k Disjoint st-Paths in Graphs. | Roberto Grossi, Andrea Marino, Luca Versari |
| 2018 | MFCS | Listing Subgraphs by Cartesian Decomposition. | Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari |
| 2018 | SPIRE | Longest Property-Preserved Common Factor. | Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone |
| 2018 | SPIRE | Compressed Communication Complexity of Longest Common Prefixes. | Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Grtz, Eva Rotenberg |
| 2018 | WABI | Degenerate String Comparison and Applications. | Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone |
| 2018 | WG | Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. | Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari |
| 2017 | CPM | On-Line Pattern Matching on Similar Texts. | Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari |
| 2017 | SPIRE | Listing Maximal Independent Sets with Minimal Space and Bounded Delay. | Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari |
| 2017 | WG | On Bubble Generators in Directed Graphs. | Vicente Acua, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri |
| 2016 | ICALP | Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques. | Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari |
| 2016 | IWOCA | Directing Road Networks by Listing Strong Orientations. | Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari |
| 2016 | LATIN | Listing Acyclic Orientations of Graphs with Single and Multiple Sources. | Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi |
| 2016 | SAC | Clique covering of large real-world networks. | Alessio Conte, Roberto Grossi, Andrea Marino |
| 2016 | SODA | New Bounds for Approximating Extremal Distances in Undirected Graphs. | Massimo Cairo, Roberto Grossi, Romeo Rizzi |
| 2015 | IWOCA | Enumerating Cyclic Orientations of a Graph. | Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi |
| 2015 | WABI | Circular Sequence Comparison with q-grams. | Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani |
| 2014 | ESA | Amortized (|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. | Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot |
| 2013 | CPM | A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform. | Maxime Crochemore, Roberto Grossi, Juha Krkkinen, Gad M. Landau |
| 2013 | ESA | Encodings for Range Selection and Top-k Queries. | Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti |
| 2013 | ICALP | Dynamic Compressed Strings with Random Access. | Roberto Grossi, Rajeev Raman, Srinivasa Rao Satti, Rossano Venturini |
| 2013 | SODA | Optimal Listing of Cycles and st-Paths in Undirected Graphs. | Etienne Birmel, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Sacomoto |
| 2013 | SPIRE | Pattern Discovery and Listing in Graphs. | Roberto Grossi |
| 2012 | ALENEX | Fast Compressed Tries through Path Decompositions. | Giuseppe Ottaviano, Roberto Grossi |
| 2012 | CPM | Constant-Time Word-Size String Matching. | Dany Breslauer, Leszek Gasieniec, Roberto Grossi |
| 2012 | PODS | The wavelet trie: maintaining an indexed sequence of strings in compressed space. | Roberto Grossi, Giuseppe Ottaviano |
| 2012 | SPIRE | Efficient Bubble Enumeration in Directed Graphs. | Etienne Birmel, Pierluigi Crescenzi, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot |
| 2011 | CIKM | Semi-indexing semi-structured data in tiny space. | Giuseppe Ottaviano, Roberto Grossi |
| 2011 | CPM | Simple Real-Time Constant-Space String Matching. | Dany Breslauer, Roberto Grossi, Filippo Mignosi |
| 2011 | DLT | Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees. | Giovanni Battaglia, Roberto Grossi, Noemi Scutell |
| 2011 | ESA | Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs. | Rui A. Ferreira, Roberto Grossi, Romeo Rizzi |
| 2010 | ESA | Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound. | Pierluigi Crescenzi, Roberto Grossi, Claudio Imbrenda, Leonardo Lanzi, Andrea Marino |
| 2010 | FUN | Fun with Olympiad in Algorithmics. | Roberto Grossi, Alessio Orlandi, Giuseppe Ottaviano |
| 2010 | ICALP | Optimal Trade-Offs for Succinct String Indexes. | Roberto Grossi, Alessio Orlandi, Rajeev Raman |
| 2009 | CPM | Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques. | Roberto Grossi |
| 2009 | STACS | Optimal Cache-Aware Suffix Selection. | Gianni Franceschini, Roberto Grossi, S. Muthukrishnan |
| 2009 | STACS | More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. | Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao |
| 2009 | WABI | MADMX: A Novel Strategy for Maximal Dense Motif Extraction. | Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin |
| 2008 | PODS | On searching compressed string collections cache-obliviously. | Paolo Ferragina, Roberto Grossi, Ankur Gupta, Rahul Shah, Jeffrey Scott Vitter |
| 2007 | ESA | On the Size of Succinct Indices. | Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao |
| 2006 | SODA | Squeezing succinct data structures into entropy bounds. | Kunihiko Sadakane, Roberto Grossi |
| 2006 | STACS | Amortized Rigidness in Dynamic Cartesian Trees. | Iwona Bialynicka-Birula, Roberto Grossi |
| 2005 | ICALP | Optimal In-place Sorting of Vectors and Records. | Gianni Franceschini, Roberto Grossi |
| 2005 | SPIRE | Rank-Sensitive Data Structures. | Iwona Bialynicka-Birula, Roberto Grossi |
| 2004 | CPM | A Trie-Based Approach for Compacting Automata. | Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi |
| 2004 | DCC | Fast Compression with a Static Model in High-Order Entropy. | Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter |
| 2004 | FOCS | No Sorting? Better Searching! | Gianni Franceschini, Roberto Grossi |
| 2004 | ICALP | A General Technique for Managing Strings in Comparison-Driven Data Structures. | Gianni Franceschini, Roberto Grossi |
| 2004 | SODA | When indexing equals compression: experiments with compressing suffix arrays and applications. | Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter |
| 2003 | ICALP | Optimal Cache-Oblivious Implicit Dictionaries. | Gianni Franceschini, Roberto Grossi |
| 2003 | MFCS | A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum. | Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot |
| 2003 | SODA | Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time. | Gianni Franceschini, Roberto Grossi |
| 2003 | SODA | High-order entropy-compressed text indexes. | Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter |
| 2003 | WADS | Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees. | Gianni Franceschini, Roberto Grossi |
| 2002 | FOCS | Implicit B-Trees: New Results for the Dictionary Problem. | Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli |
| 2000 | STOC | Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract). | Roberto Grossi, Jeffrey Scott Vitter |
| 1999 | ESA | IP Address Lookup Made Fast and Simple. | Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi |
| 1999 | ICALP | Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures. | Roberto Grossi, Giuseppe F. Italiano |
| 1997 | CIAC | A Note on Updating Suffix Tree Labels. | Paolo Ferragina, Roberto Grossi, Manuela Montangero |
| 1997 | ICALP | Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract). | Roberto Grossi, Giuseppe F. Italiano |
| 1997 | STOC | On Sorting Strings in External Memory (Extended Abstract). | Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter |
| 1996 | SODA | Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results. | Paolo Ferragina, Roberto Grossi |
| 1995 | CPM | Multi-Dimensional Pattern Matching with Dimensional Wildcards. | Raffaele Giancarlo, Roberto Grossi |
| 1995 | FOCS | Optimal On-Line Search and Sublinear Time Update in String Matching. | Paolo Ferragina, Roberto Grossi |
| 1995 | ICALP | On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications. | Raffaele Giancarlo, Roberto Grossi |
| 1995 | SODA | Fast Incremental Text Editing. | Paolo Ferragina, Roberto Grossi |
| 1995 | STOC | A fully-dynamic data structure for external substring search (Extended Abstract). | Paolo Ferragina, Roberto Grossi |
| 1993 | SPAA | Parallel Construction and Query of Suffix Trees for Two-Dimensional Matrices. | Raffaele Giancarlo, Roberto Grossi |