GROSSI, ROBERTO
GROSSI, ROBERTO
SISTEMI E INFORMATICA (attivo dal 01/08/1980 al 31/12/2012)
A fast algorithm for large common connected induced subgraphs
2017 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Tattini, Lorenzo; Versari, Luca
BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs
2018 Alessio Conte; Roberto Grossi; Andrea Marino; Luca Versari
Clique covering of large real-world networks
2016 Conte Alessio; Grossi Roberto; Marino Andrea
ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick
2018 Alessio Conte; Gaspare Ferraro; Roberto Grossi; Andrea Marino; Kunihiko Sadakane; Takeaki Uno
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes
2018 Alessio Conte; Tiziano De Matteis; Daniele De Sensi; Roberto Grossi; Andrea Marino; Luca Versari
Directing road networks by listing strong orientations
2016 Conte Alessio; Grossi Roberto; Marino Andrea; Rizzi Romeo; Versari Luca
Discovering K-Trusses in Large-Scale Networks
2018 Alessio Conte; Daniele De Sensi; Roberto Grossi; Andrea Marino; Luca Versari
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs
2018 Roberto Grossi; Andrea Marino; Luca Versari
Efficient enumeration of graph orientations with sources
2018 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo
Enumerating Cyclic Orientations of a Graph
2015 CONTE, ALESSIO; GROSSI, ROBERTO; MARINO, ANDREA; Rizzi, Romeo
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search
2018 Alessio Conte; Roberto Grossi; Andrea Marino; Luca Versari
Listing acyclic orientations of graphs with single and multiple sources
2016 Conte Alessio; Grossi Roberto; Marino Andrea; Rizzi Romeo
Listing maximal independent sets with minimal space and bounded delay
2017 Conte, Alessio; Grossi, Roberto; Marino, Andrea; Uno, Takeaki; Versari, Luca
Listing Subgraphs by Cartesian Decomposition
2018 Alessio Conte; Roberto Grossi; Andrea Marino; Romeo Rizzi; Luca Versari
Node Similarity with q-Grams for Real-World Labeled Networks
2018 Alessio Conte; Gaspare Ferraro; Roberto Grossi; Andrea Marino; Kunihiko Sadakane; Takeaki Uno
Optimal Listing of Cycles and st-Paths in Undirected Graphs
2013 BIRMELE E.; FERREIRA R.; GROSSI, ROBERTO; MARINO, ANDREA; PISANTI, NADIA; RIZZI R. SACOMOTO G. A.
Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes
2018 Alessio Conte; Tiziano De Matteis; Daniele De Sensi; Roberto Grossi; Andrea Marino; Luca Versari
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques
2016 Conte Alessio; Grossi Roberto; Marino Andrea; Versari Luca
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts
2018 Alessio Conte; Roberto Grossi; Andrea Marino; Romeo Rizzi; Takeaki Uno; Luca Versari
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| A fast algorithm for large common connected induced subgraphs | 2017 | Conte, Alessio; Grossi, Roberto; Marino, Andrea; Tattini, Lorenzo; Versari, Luca | |
| BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs | 2018 | Alessio Conte; Roberto Grossi; Andrea Marino; Luca Versari | |
| Clique covering of large real-world networks | 2016 | Conte Alessio; Grossi Roberto; Marino Andrea | |
| ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick | 2018 | Alessio Conte; Gaspare Ferraro; Roberto Grossi; Andrea Marino; Kunihiko Sadakane; Takeaki Uno | |
| D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes | 2018 | Alessio Conte; Tiziano De Matteis; Daniele De Sensi; Roberto Grossi; Andrea Marino; Luca Versari | |
| Directing road networks by listing strong orientations | 2016 | Conte Alessio; Grossi Roberto; Marino Andrea; Rizzi Romeo; Versari Luca | |
| Discovering K-Trusses in Large-Scale Networks | 2018 | Alessio Conte; Daniele De Sensi; Roberto Grossi; Andrea Marino; Luca Versari | |
| Efficient Algorithms for Listing k Disjoint st-Paths in Graphs | 2018 | Roberto Grossi; Andrea Marino; Luca Versari | |
| Efficient enumeration of graph orientations with sources | 2018 | Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo | |
| Enumerating Cyclic Orientations of a Graph | 2015 | CONTE, ALESSIO; GROSSI, ROBERTO; MARINO, ANDREA; Rizzi, Romeo | |
| Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search | 2018 | Alessio Conte; Roberto Grossi; Andrea Marino; Luca Versari | |
| Listing acyclic orientations of graphs with single and multiple sources | 2016 | Conte Alessio; Grossi Roberto; Marino Andrea; Rizzi Romeo | |
| Listing maximal independent sets with minimal space and bounded delay | 2017 | Conte, Alessio; Grossi, Roberto; Marino, Andrea; Uno, Takeaki; Versari, Luca | |
| Listing Subgraphs by Cartesian Decomposition | 2018 | Alessio Conte; Roberto Grossi; Andrea Marino; Romeo Rizzi; Luca Versari | |
| Node Similarity with q-Grams for Real-World Labeled Networks | 2018 | Alessio Conte; Gaspare Ferraro; Roberto Grossi; Andrea Marino; Kunihiko Sadakane; Takeaki Uno | |
| Optimal Listing of Cycles and st-Paths in Undirected Graphs | 2013 | BIRMELE E.; FERREIRA R.; GROSSI, ROBERTO; MARINO, ANDREA; PISANTI, NADIA; RIZZI R. SACOMOTO G. A. | |
| Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes | 2018 | Alessio Conte; Tiziano De Matteis; Daniele De Sensi; Roberto Grossi; Andrea Marino; Luca Versari | |
| Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques | 2016 | Conte Alessio; Grossi Roberto; Marino Andrea; Versari Luca | |
| Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts | 2018 | Alessio Conte; Roberto Grossi; Andrea Marino; Romeo Rizzi; Takeaki Uno; Luca Versari |