Andrea Marino

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 63

Top Topics

Graph Structure

Community Detection

Maximal Clique Enumeration

Top Venues

Discret. Appl. Math.

Publications

Andrea Marino, Ana Silva
Eulerian Walks in Temporal Graphs. Algorithmica 85 (3) (2023)
Linus Wagner, Maximilian Mayer, Andrea Marino, Alireza Soldani Nezhad, Hugo Zwaan, Ivano Malavolta
On the Energy Consumption and Performance of WebAssembly Binaries across Programming Languages and Runtimes in IoT. EASE (2023)
Marco Calamai, Pierluigi Crescenzi, Andrea Marino
On Computing the Diameter of (Weighted) Link Streams. ACM J. Exp. Algorithmics 27 (2022)
Francesco Tosoni, Paolo Ferragina, Andrea Marino, Giovanni Resta, Paolo Santi
Locality Filtering for Efficient Ride Sharing Platforms. IEEE Trans. Intell. Transp. Syst. 23 (7) (2022)
Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari
Proximity Search for Maximal Subgraph Enumeration. SIAM J. Comput. 51 (5) (2022)
Andrea Marino, Ana Silva
Coloring temporal graphs. J. Comput. Syst. Sci. 123 (2022)
Allen Ibiapina, Raul Lopes, Andrea Marino, Ana Silva
Menger's Theorem for Temporal Paths (Not Walks). CoRR (2022)
Andrea Marino, Ana Silva
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs. CoRR (2021)
Takeaki Uno, Andrea Marino
Preface: WEPA 2018. Discret. Appl. Math. 303 (2021)
Andrea Marino, Ana Silva
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs. IWOCA (2021)
Marco Calamai, Pierluigi Crescenzi, Andrea Marino
On Computing the Diameter of (Weighted) Link Streams. SEA (2021)
Victor Campos, Raul Lopes, Andrea Marino, Ana Silva
Edge-Disjoint Branchings in Temporal Digraphs. Electron. J. Comb. 28 (4) (2021)
Jon Crowcroft, Damiano Di Francesco Maesa, Alessandro Magrini, Andrea Marino, Laura Ricci
Leveraging the Users Graph and Trustful Transactions for the Analysis of Bitcoin Price. IEEE Trans. Netw. Sci. Eng. 8 (2) (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)
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs. Algorithmica 82 (6) (2020)
Alessio Conte, Pierluigi Crescenzi, Andrea Marino, Giulia Punzi
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs. MFCS (2020)
Pierluigi Crescenzi, Clémence Magnien, Andrea Marino
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs. Algorithms 13 (9) (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)
Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva
Edge-Disjoint Branchings in Temporal Graphs. IWOCA (2020)
Alessio Conte, Roberto Grossi, Andrea Marino
Large-scale clique cover of real-world networks. Inf. Comput. 270 (2020)
Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva
Edge-Disjoint Branchings in Temporal 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)
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)
Pierluigi Crescenzi, Clémence Magnien, Andrea Marino
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs. Algorithms 12 (10) (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, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. IWOCA (2019)
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties. SIAM J. Discret. Math. 33 (2) (2019)
Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci
The bow tie structure of the Bitcoin users graph. Appl. Netw. Sci. 4 (1) (2019)
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
Closeness Centrality Faster in Unweighted Graphs. ACM Trans. Knowl. Discov. Data 13 (5) (2019)
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)
Paolo Boldi, Andrea Marino, Massimo Santini, Sebastiano Vigna
BUbiNG: Massive Crawling for the Masses. ACM Trans. Web 12 (2) (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)
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)
Alessio Conte, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari
Discovering $k$-Trusses in Large-Scale Networks. HPEC (2018)
Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci
Data-driven analysis of Bitcoin properties: exploiting the users graph. Int. J. Data Sci. Anal. 6 (1) (2018)
Roberto Grossi, Andrea Marino, Luca Versari
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs. LATIN (2018)
Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci
The Graph Structure of Bitcoin. COMPLEX NETWORKS (2) (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)
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
Computing top-k Closeness Centrality Faster in Unweighted Graphs. CoRR (2017)
Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari
A Fast Algorithm for Large Common Connected Induced Subgraphs. AlCoB (2017)
Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari
Listing Maximal Independent Sets with Minimal Space and Bounded Delay. SPIRE (2017)
Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci
Detecting artificial behaviours in the Bitcoin users graph. Online Soc. Networks Media (2017)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
Listing Acyclic Orientations of Graphs with Single and Multiple Sources. LATIN (2016)
Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci
An analysis of the Bitcoin users graph: inferring unusual behaviours. COMPLEX NETWORKS (2016)
Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci
Uncovering the Bitcoin Blockchain: An Analysis of the Full Users Graph. DSAA (2016)
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques. ICALP (2016)
Roi Blanco, Paolo Boldi, Andrea Marino
Using graph distances for named-entity linking. Sci. Comput. Program. 130 (2016)
Paolo Boldi, Andrea Marino, Massimo Santini, Sebastiano Vigna
BUbiNG: Massive Crawling for the Masses. CoRR (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)
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
Closeness Centrality Faster in Unweighted Graphs. ALENEX (2016)
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
Synchronous context-free grammars and optimal linear parsing strategies. J. Comput. Syst. Sci. 81 (7) (2015)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
Enumerating Cyclic Orientations of a Graph. IWOCA (2015)
Michele Borassi, Pierluigi Crescenzi, Andrea Marino
Fast and Simple Computation of Top-k Closeness Centralities. CoRR (2015)
Michele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino
On Computing the Hyperbolicity of Real-World Graphs. ESA (2015)
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
Enumerating Cyclic Orientations of a Graph. CoRR (2015)
Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games. Theor. Comput. Sci. 586 (2015)
Andrea Marino
Algorithms for Biological Graphs: Analysis and Enumeration. Bull. EATCS 114 (2014)
Irene Amerini, Roberto Caldelli, Pierluigi Crescenzi, Andrea Del Mastio, Andrea Marino
Blind image clustering based on the Normalized Cuts criterion for camera identification. Signal Process. Image Commun. 29 (8) (2014)
Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes
On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method. FUN (2014)
Roi Blanco, Paolo Boldi, Andrea Marino
Entity-Linking via Graph-Distance Minimization. GRAPHITE (2014)
Paolo Boldi, Andrea Marino, Massimo Santini, Sebastiano Vigna
BUbiNG: massive crawling for the masses. WWW (Companion Volume) (2014)
Andrea Marino
Algorithms for biological graphs: analysis and enumeration. ICTCS (2014)
Paulo Vieira Milreu, Cecilia Coimbra Klein, Ludovic Cottret, Vicente Acuña, Etienne Birmelé, Michele Borassi, Christophe Junot, Alberto Marchetti-Spaccamela, Andrea Marino, Leen Stougie, Fabien Jourdan, Pierluigi Crescenzi, Vincent Lacroix, Marie-France Sagot
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure. Bioinform. 30 (1) (2014)
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies. CoRR (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)
Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Marie-France Sagot, Paulo Vieira Milreu
Telling Stories Fast. SEA (2013)
Vicente Acuña, Etienne Birmelé, Ludovic Cottret, Pierluigi Crescenzi, Fabien Jourdan, Vincent Lacroix, Alberto Marchetti-Spaccamela, Andrea Marino, Paulo Vieira Milreu, Marie-France Sagot, Leen Stougie
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets. Theor. Comput. Sci. 457 (2012)
Etienne Birmelé, Pierluigi Crescenzi, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot
Efficient Bubble Enumeration in Directed Graphs. SPIRE (2012)
Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot
Optimal Listing of Cycles and st-Paths in Undirected Graphs CoRR (2012)
Ugo Scaiella, Paolo Ferragina, Andrea Marino, Massimiliano Ciaramita
Topical clustering of search results. WSDM (2012)
Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino
On Computing the Diameter of Real-World Directed (Weighted) Graphs. SEA (2012)
Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs. TAPAS (2011)
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems. ACL (2011)
Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Donatella Merlini, Gianluca Rossi, Paola Vocca
Smooth movement and Manhattan path based Random Waypoint mobility. Inf. Process. Lett. 111 (5) (2011)
Pierluigi Crescenzi, Roberto Grossi, Claudio Imbrenda, Leonardo Lanzi, Andrea Marino
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound. ESA (1) (2010)
Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Gianluca Rossi, Paola Vocca
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. SIROCCO (2009)