Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. - Pilu Crescenzi; Miriam Di Ianni; Andrea Marino 001; Gianluca Rossi; Paola Vocca (SIROCCO, 2009)

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 001 (ESA (1), 2010)

Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems. - Pierluigi Crescenzi; Daniel Gildea; Andrea Marino 001; Gianluca Rossi; Giorgio Satta (ACL, 2011)

A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs. - Pierluigi Crescenzi; Roberto Grossi; Leonardo Lanzi; Andrea Marino 001 (TAPAS, 2011)

Smooth movement and Manhattan path based Random Waypoint mobility. - Pilu Crescenzi; Miriam Di Ianni; Andrea Marino 001; Donatella Merlini; Gianluca Rossi; Paola Vocca (Inf. Process. Lett., 2011)

Efficient Bubble Enumeration in Directed Graphs. - Etienne Birmelé; Pierluigi Crescenzi; Rui A. Ferreira; Roberto Grossi; Vincent Lacroix; Andrea Marino 001; Nadia Pisanti; Gustavo Akio Tominaga Sacomoto; Marie-France Sagot (SPIRE, 2012)

On Computing the Diameter of Real-World Directed (Weighted) Graphs. - Pierluigi Crescenzi; Roberto Grossi; Leonardo Lanzi; Andrea Marino 001 (SEA, 2012)

Topical clustering of search results. - Ugo Scaiella; Paolo Ferragina; Andrea Marino 001; Massimiliano Ciaramita (WSDM, 2012)

Optimal Listing of Cycles and st-Paths in Undirected Graphs - Etienne Birmelé; Rui A. Ferreira; Roberto Grossi; Andrea Marino 001; Nadia Pisanti; Romeo Rizzi; Gustavo Akio Tominaga Sacomoto; Marie-France Sagot (CoRR, 2012)

Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets. - Vicente Acuña; Etienne Birmelé; Ludovic Cottret; Pierluigi Crescenzi; Fabien Jourdan; Vincent Lacroix; Alberto Marchetti-Spaccamela; Andrea Marino 001; Paulo Vieira Milreu; Marie-France Sagot; Leen Stougie (Theor. Comput. Sci., 2012)

Algorithms for biological graphs. - Andrea Marino 001 (2012)

Optimal Listing of Cycles and st-Paths in Undirected Graphs. - Etienne Birmelé; Rui A. Ferreira; Roberto Grossi; Andrea Marino 001; Nadia Pisanti; Romeo Rizzi; Gustavo Sacomoto (SODA, 2013)

Telling Stories Fast. - Michele Borassi; Pierluigi Crescenzi; Vincent Lacroix; Andrea Marino 001; Marie-France Sagot; Paulo Vieira Milreu (SEA, 2013)

On computing the diameter of real-world undirected graphs. - Pilu Crescenzi; Roberto Grossi; Michel Habib; Leonardo Lanzi; Andrea Marino 001 (Theor. Comput. Sci., 2013)

On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method. - Michele Borassi; Pierluigi Crescenzi; Michel Habib; Walter A. Kosters; Andrea Marino 001; Frank W. Takes (FUN, 2014)

Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure. - Paulo Vieira Milreu; Cecilia Coimbra Klein; Ludovic Cottret; Vicente Acuña; Etienne Birmelé; Michele Borassi; Christophe Junot; Alberto Marchetti-Spaccamela; Andrea Marino 001; Leen Stougie; Fabien Jourdan; Pierluigi Crescenzi; et al. (Bioinform., 2014)

Entity-Linking via Graph-Distance Minimization. - Roi Blanco; Paolo Boldi; Andrea Marino 001 (GRAPHITE, 2014)

Algorithms for Biological Graphs: Analysis and Enumeration. - Andrea Marino 001 (Bull. EATCS, 2014)

Blind image clustering based on the Normalized Cuts criterion for camera identification. - Irene Amerini; Roberto Caldelli; Pierluigi Crescenzi; Andrea Del Mastio; Andrea Marino 001 (Signal Process. Image Commun., 2014)

On Computing the Hyperbolicity of Real-World Graphs. - Michele Borassi; David Coudert; Pierluigi Crescenzi; Andrea Marino 001 (ESA, 2015)

Enumerating Cyclic Orientations of a Graph. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Romeo Rizzi (IWOCA, 2015)

Fast and Simple Computation of Top-k Closeness Centralities. - Michele Borassi; Pierluigi Crescenzi; Andrea Marino 001 (CoRR, 2015)

Synchronous context-free grammars and optimal linear parsing strategies. - Pierluigi Crescenzi; Daniel Gildea; Andrea Marino 001; Gianluca Rossi; Giorgio Satta (J. Comput. Syst. Sci., 2015)

Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games. - Michele Borassi; Pierluigi Crescenzi; Michel Habib; Walter A. Kosters; Andrea Marino 001; Frank W. Takes (Theor. Comput. Sci., 2015)

An analysis of the Bitcoin users graph: inferring unusual behaviours. - Damiano Di Francesco Maesa; Andrea Marino 001; Laura Ricci (COMPLEX NETWORKS, 2016)

Uncovering the Bitcoin Blockchain: An Analysis of the Full Users Graph. - Damiano Di Francesco Maesa; Andrea Marino 001; Laura Ricci (DSAA, 2016)

Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Luca Versari (ICALP, 2016)

Directing Road Networks by Listing Strong Orientations. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Romeo Rizzi; Luca Versari (IWOCA, 2016)

Listing Acyclic Orientations of Graphs with Single and Multiple Sources. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Romeo Rizzi (LATIN, 2016)

Clique covering of large real-world networks. - Alessio Conte; Roberto Grossi; Andrea Marino 001 (SAC, 2016)

Using graph distances for named-entity linking. - Roi Blanco; Paolo Boldi; Andrea Marino 001 (Sci. Comput. Program., 2016)

A Fast Algorithm for Large Common Connected Induced Subgraphs. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Lorenzo Tattini; Luca Versari (AlCoB, 2017)

Listing Maximal Independent Sets with Minimal Space and Bounded Delay. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Takeaki Uno; Luca Versari (SPIRE, 2017)

Computing top-k Closeness Centrality Faster in Unweighted Graphs. - Elisabetta Bergamini; Michele Borassi; Pierluigi Crescenzi; Andrea Marino 001; Henning Meyerhenke (CoRR, 2017)

Detecting artificial behaviours in the Bitcoin users graph. - Damiano Di Francesco Maesa; Andrea Marino 001; Laura Ricci (Online Soc. Networks Media, 2017)

Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Luca Versari (COCOON, 2018)

The Graph Structure of Bitcoin. - Damiano Di Francesco Maesa; Andrea Marino 001; Laura Ricci (COMPLEX NETWORKS (2), 2018)

Discovering $k$-Trusses in Large-Scale Networks. - Alessio Conte; Daniele De Sensi; Roberto Grossi; Andrea Marino 001; Luca Versari (HPEC, 2018)

Node Similarity with q -Grams for Real-World Labeled Networks. - Alessio Conte; Gaspare Ferraro; Roberto Grossi; Andrea Marino 001; Kunihiko Sadakane; Takeaki Uno (KDD, 2018)

D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes. - Alessio Conte; Tiziano De Matteis; Daniele De Sensi; Roberto Grossi; Andrea Marino 001; Luca Versari (KDD, 2018)

Efficient Algorithms for Listing k Disjoint st-Paths in Graphs. - Roberto Grossi; Andrea Marino 001; Luca Versari (LATIN, 2018)

Listing Subgraphs by Cartesian Decomposition. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Romeo Rizzi; Luca Versari (MFCS, 2018)

Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Romeo Rizzi; Takeaki Uno; Luca Versari (WG, 2018)

Listing Maximal Subgraphs in Strongly Accessible Set Systems. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Luca Versari (CoRR, 2018)

Efficient enumeration of graph orientations with sources. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Romeo Rizzi (Discret. Appl. Math., 2018)

Data-driven analysis of Bitcoin properties: exploiting the users graph. - Damiano Di Francesco Maesa; Andrea Marino 001; Laura Ricci (Int. J. Data Sci. Anal., 2018)

BUbiNG: Massive Crawling for the Masses. - Paolo Boldi; Andrea Marino 001; Massimo Santini 001; Sebastiano Vigna (ACM Trans. Web, 2018)

Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. - Alessio Conte; Mamadou Moustapha Kanté; Andrea Marino 001; Takeaki Uno (IWOCA, 2019)

Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. - Alessio Conte; Roberto Grossi; Mamadou Moustapha Kanté; Andrea Marino 001; Takeaki Uno; Kunihiro Wasa (MFCS, 2019)

Approximating the Temporal Neighbourhood Function of Large Temporal Graphs. - Pierluigi Crescenzi; Clémence Magnien; Andrea Marino 001 (Algorithms, 2019)

The bow tie structure of the Bitcoin users graph. - Damiano Di Francesco Maesa; Andrea Marino 001; Laura Ricci (Appl. Netw. Sci., 2019)

A fast discovery algorithm for large common connected induced subgraphs. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Lorenzo Tattini; Luca Versari (Discret. Appl. Math., 2019)

Listing Maximal Subgraphs Satisfying Strongly Accessible Properties. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Luca Versari (SIAM J. Discret. Math., 2019)

Computing top-k Closeness Centrality Faster in Unweighted Graphs. - Elisabetta Bergamini; Michele Borassi; Pierluigi Crescenzi; Andrea Marino 001; Henning Meyerhenke (ACM Trans. Knowl. Discov. Data, 2019)

Degrees of Separation and Diameter in Large Graphs. - Pierluigi Crescenzi; Andrea Marino 001 (Encyclopedia of Big Data Technologies, 2019)

High-Quality Prediction of Tourist Movements using Temporal Trajectories in Graphs. - Shima Moghtasedi; Cristina Ioana Muntean; Franco Maria Nardini; Roberto Grossi; Andrea Marino 001 (ASONAM, 2020)

Edge-Disjoint Branchings in Temporal Graphs. - Victor A. Campos; Raul Lopes 001; Andrea Marino 001; Ana Silva 001 (IWOCA, 2020)

Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs. - Alessio Conte; Pierluigi Crescenzi; Andrea Marino 001; Giulia Punzi (MFCS, 2020)

Finding Structurally and Temporally Similar Trajectories in Graphs. - Roberto Grossi; Andrea Marino 001; Shima Moghtasedi (SEA, 2020)

Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs. - Alessio Conte; Daniele De Sensi; Roberto Grossi; Andrea Marino 001; Luca Versari (IEEE Access, 2020)

Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Luca Versari (Algorithmica, 2020)

Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs. - Pierluigi Crescenzi; Clémence Magnien; Andrea Marino 001 (Algorithms, 2020)

Efficient Estimation of Graph Trussness. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Luca Versari (CoRR, 2020)

Large-scale clique cover of real-world networks. - Alessio Conte; Roberto Grossi; Andrea Marino 001 (Inf. Comput., 2020)

Königsberg Sightseeing: Eulerian Walks in Temporal Graphs. - Andrea Marino 001; Ana Silva 001 (IWOCA, 2021)

Edge-Disjoint Branchings in Temporal Digraphs. - Victor A. Campos; Raul Lopes 001; Andrea Marino 001; Ana Silva 001 (Electron. J. Comb., 2021)

Preface: WEPA 2018. - Takeaki Uno; Andrea Marino 001 (Discret. Appl. Math., 2021)

K-plex cover pooling for graph neural networks. - Davide Bacciu; Alessio Conte; Roberto Grossi; Francesco Landolfi; Andrea Marino 001 (Data Min. Knowl. Discov., 2021)

Leveraging the Users Graph and Trustful Transactions for the Analysis of Bitcoin Price. - Jon Crowcroft; Damiano Di Francesco Maesa; Alessandro Magrini; Andrea Marino 001; Laura Ricci (IEEE Trans. Netw. Sci. Eng., 2021)

Menger's Theorem for Temporal Paths (Not Walks). - Allen Ibiapina; Raul Lopes 001; Andrea Marino 001; Ana Silva 001 (CoRR, 2022)

Coloring temporal graphs. - Andrea Marino 001; Ana Silva 001 (J. Comput. Syst. Sci., 2022)

On Computing the Diameter of (Weighted) Link Streams. - Marco Calamai; Pierluigi Crescenzi; Andrea Marino 001 (ACM J. Exp. Algorithmics, 2022)

Proximity Search for Maximal Subgraph Enumeration. - Alessio Conte; Roberto Grossi; Andrea Marino 001; Takeaki Uno; Luca Versari (SIAM J. Comput., 2022)

Locality Filtering for Efficient Ride Sharing Platforms. - Francesco Tosoni 001; Paolo Ferragina; Andrea Marino 001; Giovanni Resta; Paolo Santi (IEEE Trans. Intell. Transp. Syst., 2022)

On Computing Optimal Temporal Branchings. - Daniela Bubboloni; Costanza Catalano; Andrea Marino 001; Ana Silva 001 (FCT, 2023)

An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs. - Giulia Punzi; Alessio Conte; Roberto Grossi; Andrea Marino 001 (SDM, 2023)

Eulerian Walks in Temporal Graphs. - Andrea Marino 001; Ana Silva 001 (Algorithmica, 2023)

On computing large temporal (unilateral) connected components. - Isnard Lopes Costa; Raul Lopes 001; Andrea Marino 001; Ana Silva 001 (J. Comput. Syst. Sci., 2024)

Designing Output Sensitive Algorithms for Subgraph Enumeration. - Alessio Conte; Kazuhiro Kurita; Andrea Marino 001; Giulia Punzi; Takeaki Uno; Kunihiro Wasa (From Strings to Graphs, and Back Again, 2025)

Disjoint Temporal Walks Under Waiting Time Constraints. - Allen Ibiapina; Raul Lopes 001; Andrea Marino 001; Ana Silva 001 (CIAC (2), 2025)

Matching and Edge Cover in Temporal Graphs. - Lapo Cioni; Riccardo Dondi; Andrea Marino 001; Jason Schoeters; Ana Silva 001 (SAND, 2025)

Spanner Enumeration for Temporal Graphs. - Kazuhiro Kurita; Andrea Marino 001; Jason Schoeters; Takeaki Uno (SAND, 2025)

Output-sensitive enumeration of maximal cliques in temporal graphs. - Filippo Brunelli; Alessio Conte; Roberto Grossi; Andrea Marino 001 (Discret. Appl. Math., 2025)

Listing maximal H-free subgraphs. - Alessio Conte; Roberto Grossi; Mamadou Moustapha Kanté; Andrea Marino 001; Takeaki Uno (Discret. Appl. Math., 2025)

On computing optimal temporal branchings and spanning subgraphs. - Daniela Bubboloni; Costanza Catalano; Andrea Marino 001; Ana Silva 001 (J. Comput. Syst. Sci., 2025)

Temporal Cycle Detection and Acyclic Temporization. - Davi de Andrade; Júlio Araújo 001; Allen Ibiapina; Andrea Marino 001; Jason Schoeters; Ana Silva 001 (CoRR, 2025)

Making the interval membership width of temporal graphs connected and bidirectional. - Filippos Christodoulou; Pierluigi Crescenzi; Andrea Marino 001; Ana Silva 001; Dimitrios M. Thilikos (J. Comput. Syst. Sci., 2026)