Andrea Marino

104 papers A* 5A 4B 14C 9Misc 3Journal 52Unranked 14
YearRankTypeTitle / Venue / Authors
2026 J jnl
Making the interval membership width of temporal graphs connected and bidirectional.
J. Comput. Syst. Sci.
Filippos Christodoulou, Pierluigi Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos
2026 J jnl
Revisiting the Sparse Matrix Compression Problem.
CoRR
Vincent Jugé, Dominik Köppl, Vincent Limouzy, Andrea Marino, Jannik Olblich, Giulia Punzi, Takeaki Uno
2025 — conf
Designing Output Sensitive Algorithms for Subgraph Enumeration.
From Strings to Graphs, and Back Again
Alessio Conte, Kazuhiro Kurita, Andrea Marino, Giulia Punzi, Takeaki Uno, Kunihiro Wasa
2025 — conf
Disjoint Temporal Walks Under Waiting Time Constraints.
CIAC (2)
Allen Ibiapina, Raul Lopes, Andrea Marino, Ana Silva
2025 — ed.
From Strings to Graphs, and Back Again: A Festschrift for Roberto Grossi's 60th Birthday, Grossi's Festschrift, Venice, Italy, July 25, 2025
Grossi's Festschrift
Alessio Conte, Andrea Marino, Giovanna Rosone, Jeffrey Scott Vitter
2025 J jnl
Listing maximal H-free subgraphs.
Discret. Appl. Math.
Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno
2025 — conf
Matching and Edge Cover in Temporal Graphs.
SAND
Lapo Cioni, Riccardo Dondi, Andrea Marino, Jason Schoeters, Ana Silva
2025 J jnl
Matching and Edge Cover in Temporal Graphs.
CoRR
Lapo Cioni, Riccardo Dondi, Andrea Marino, Jason Schoeters, Ana Silva
2025 J jnl
On computing optimal temporal branchings and spanning subgraphs.
J. Comput. Syst. Sci.
Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Silva
2025 J jnl
Output-sensitive enumeration of maximal cliques in temporal graphs.
Discret. Appl. Math.
Filippo Brunelli, Alessio Conte, Roberto Grossi, Andrea Marino
2025 — conf
Spanner Enumeration for Temporal Graphs.
SAND
Kazuhiro Kurita, Andrea Marino, Jason Schoeters, Takeaki Uno
2025 — conf
Temporal Cycle Detection and Acyclic Temporalizations.
ALGOWIN
Davi de Andrade, Júlio Araújo, Allen Ibiapina, Andrea Marino, Jason Schoeters, Ana Silva
2025 J jnl
Temporal Cycle Detection and Acyclic Temporization.
CoRR
Davi de Andrade, Júlio Araújo, Allen Ibiapina, Andrea Marino, Jason Schoeters, Ana Silva
2024 C conf
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional.
IWOCA
Filippos Christodoulou, Pierluigi Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos
2024 J jnl
On computing large temporal (unilateral) connected components.
J. Comput. Syst. Sci.
Isnard Lopes Costa, Raul Lopes, Andrea Marino, Ana Silva
2023 A conf
An Efficient Algorithm for Assessing the Number of
SDM
Giulia Punzi, Alessio Conte, Roberto Grossi, Andrea Marino
2023 J jnl
Eulerian Walks in Temporal Graphs.
Algorithmica
Andrea Marino, Ana Silva
2023 C conf
On Computing Large Temporal (Unilateral) Connected Components.
IWOCA
Isnard Lopes Costa, Raul Lopes, Andrea Marino, Ana Silva
2023 J jnl
On Computing Optimal Temporal Branchings and Spanning Subgraphs.
CoRR
Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Silva
2023 B conf
On Computing Optimal Temporal Branchings.
FCT
Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Silva
2022 J jnl
Coloring temporal graphs.
J. Comput. Syst. Sci.
Andrea Marino, Ana Silva
2022 J jnl
Locality Filtering for Efficient Ride Sharing Platforms.
IEEE Trans. Intell. Transp. Syst.
Francesco Tosoni, Paolo Ferragina, Andrea Marino, Giovanni Resta, Paolo Santi
2022 J jnl
Menger's Theorem for Temporal Paths (Not Walks).
CoRR
Allen Ibiapina, Raul Lopes, Andrea Marino, Ana Silva
2022 J jnl
On Computing the Diameter of (Weighted) Link Streams.
ACM J. Exp. Algorithmics
Marco Calamai, Pierluigi Crescenzi, Andrea Marino
2022 J jnl
Proximity Search for Maximal Subgraph Enumeration.
SIAM J. Comput.
Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari
2021 J jnl
Edge-Disjoint Branchings in Temporal Digraphs.
Electron. J. Comb.
Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva
2021 J jnl
K-plex cover pooling for graph neural networks.
Data Min. Knowl. Discov.
Davide Bacciu, Alessio Conte, Roberto Grossi, Francesco Landolfi, Andrea Marino
2021 C conf
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs.
IWOCA
Andrea Marino, Ana Silva
2021 J jnl
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs.
CoRR
Andrea Marino, Ana Silva
2021 J jnl
Leveraging the Users Graph and Trustful Transactions for the Analysis of Bitcoin Price.
IEEE Trans. Netw. Sci. Eng.
Jon Crowcroft, Damiano Di Francesco Maesa, Alessandro Magrini, Andrea Marino, Laura Ricci
2021 B conf
On Computing the Diameter of (Weighted) Link Streams.
SEA
Marco Calamai, Pierluigi Crescenzi, Andrea Marino
2021 J jnl
Preface: WEPA 2018.
Discret. Appl. Math.
Takeaki Uno, Andrea Marino
2020 C conf
Edge-Disjoint Branchings in Temporal Graphs.
IWOCA
Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva
2020 J jnl
Edge-Disjoint Branchings in Temporal Graphs.
CoRR
Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva
2020 J jnl
Efficient Estimation of Graph Trussness.
CoRR
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
2020 B conf
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs.
MFCS
Alessio Conte, Pierluigi Crescenzi, Andrea Marino, Giulia Punzi
2020 B conf
Finding Structurally and Temporally Similar Trajectories in Graphs.
SEA
Roberto Grossi, Andrea Marino, Shima Moghtasedi
2020 J jnl
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs.
Algorithms
Pierluigi Crescenzi, Clémence Magnien, Andrea Marino
2020 B conf
High-Quality Prediction of Tourist Movements using Temporal Trajectories in Graphs.
ASONAM
Shima Moghtasedi, Cristina Ioana Muntean, Franco Maria Nardini, Roberto Grossi, Andrea Marino
2020 J jnl
Large-scale clique cover of real-world networks.
Inf. Comput.
Alessio Conte, Roberto Grossi, Andrea Marino
2020 J jnl
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs.
Algorithmica
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
2020 J jnl
Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs.
IEEE Access
Alessio Conte, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari
2019 J jnl
A fast discovery algorithm for large common connected induced subgraphs.
Discret. Appl. Math.
Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari
2019 J jnl
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs.
Algorithms
Pierluigi Crescenzi, Clémence Magnien, Andrea Marino
2019 J jnl
Computing top-
ACM Trans. Knowl. Discov. Data
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
2019 — ch.
Degrees of Separation and Diameter in Large Graphs.
Encyclopedia of Big Data Technologies
Pierluigi Crescenzi, Andrea Marino
2019 B conf
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs.
MFCS
Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa
2019 J jnl
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties.
SIAM J. Discret. Math.
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
2019 C conf
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs.
IWOCA
Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno
2019 J jnl
Proximity Search For Maximal Subgraph Enumeration.
CoRR
Alessio Conte, Andrea Marino, Roberto Grossi, Takeaki Uno, Luca Versari
2019 J jnl
The bow tie structure of the Bitcoin users graph.
Appl. Netw. Sci.
Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci
2018 J jnl
BUbiNG: Massive Crawling for the Masses.
ACM Trans. Web
Paolo Boldi, Andrea Marino, Massimo Santini, Sebastiano Vigna
2018 A* conf
D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes.
KDD
Alessio Conte, Tiziano De Matteis, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari
2018 J jnl
Data-driven analysis of Bitcoin properties: exploiting the users graph.
Int. J. Data Sci. Anal.
Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci
2018 — conf
Discovering $k$-Trusses in Large-Scale Networks.
HPEC
Alessio Conte, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari
2018 B conf
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs.
LATIN
Roberto Grossi, Andrea Marino, Luca Versari
2018 J jnl
Efficient enumeration of graph orientations with sources.
Discret. Appl. Math.
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
2018 Misc conf
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search.
COCOON
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
2018 J jnl
Listing Maximal Subgraphs in Strongly Accessible Set Systems.
CoRR
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
2018 B conf
Listing Subgraphs by Cartesian Decomposition.
MFCS
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari
2018 A* conf
Node Similarity with q -Grams for Real-World Labeled Networks.
KDD
Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno
2018 — conf
The Graph Structure of Bitcoin.
COMPLEX NETWORKS (2)
Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci
2018 B conf
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts.
WG
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari
2017 — conf
A Fast Algorithm for Large Common Connected Induced Subgraphs.
AlCoB
Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari
2017 J jnl
Computing top-k Closeness Centrality Faster in Unweighted Graphs.
CoRR
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
2017 J jnl
Detecting artificial behaviours in the Bitcoin users graph.
Online Soc. Networks Media
Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci
2017 C conf
Listing Maximal Independent Sets with Minimal Space and Bounded Delay.
SPIRE
Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari
2016 — conf
An analysis of the Bitcoin users graph: inferring unusual behaviours.
COMPLEX NETWORKS
Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci
2016 J jnl
BUbiNG: Massive Crawling for the Masses.
CoRR
Paolo Boldi, Andrea Marino, Massimo Santini, Sebastiano Vigna
2016 Misc conf
Clique covering of large real-world networks.
SAC
Alessio Conte, Roberto Grossi, Andrea Marino
2016 A conf
Computing Top-
ALENEX
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
2016 C conf
Directing Road Networks by Listing Strong Orientations.
IWOCA
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari
2016 B conf
Listing Acyclic Orientations of Graphs with Single and Multiple Sources.
LATIN
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
2016 A* conf
Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques.
ICALP
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari
2016 B conf
Uncovering the Bitcoin Blockchain: An Analysis of the Full Users Graph.
DSAA
Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci
2016 J jnl
Using graph distances for named-entity linking.
Sci. Comput. Program.
Roi Blanco, Paolo Boldi, Andrea Marino
2015 C conf
Enumerating Cyclic Orientations of a Graph.
IWOCA
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
2015 J jnl
Enumerating Cyclic Orientations of a Graph.
CoRR
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi
2015 J jnl
Fast and Simple Computation of Top-k Closeness Centralities.
CoRR
Michele Borassi, Pierluigi Crescenzi, Andrea Marino
2015 J jnl
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.
Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes
2015 A conf
On Computing the Hyperbolicity of Real-World Graphs.
ESA
Michele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino
2015 J jnl
Synchronous context-free grammars and optimal linear parsing strategies.
J. Comput. Syst. Sci.
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
2014 J jnl
Algorithms for Biological Graphs: Analysis and Enumeration.
Bull. EATCS
Andrea Marino
2014 — conf
Algorithms for biological graphs: analysis and enumeration.
ICTCS
Andrea Marino
2014 — conf
BUbiNG: massive crawling for the masses.
WWW (Companion Volume)
Paolo Boldi, Andrea Marino, Massimo Santini, Sebastiano Vigna
2014 J jnl
Blind image clustering based on the Normalized Cuts criterion for camera identification.
Signal Process. Image Commun.
Irene Amerini, Roberto Caldelli, Pierluigi Crescenzi, Andrea Del Mastio, Andrea Marino
2014 — conf
Entity-Linking via Graph-Distance Minimization.
GRAPHITE
Roi Blanco, Paolo Boldi, Andrea Marino
2014 Misc conf
On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method.
FUN
Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes
2014 J jnl
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure.
Bioinform.
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
2013 J jnl
On computing the diameter of real-world undirected graphs.
Theor. Comput. Sci.
Pilu Crescenzi, Roberto Grossi, Michel Habib, Leonardo Lanzi, Andrea Marino
2013 A* conf
Optimal Listing of Cycles and st-Paths in Undirected Graphs.
SODA
Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Sacomoto
2013 J jnl
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies.
CoRR
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
2013 B conf
Telling Stories Fast.
SEA
Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Marie-France Sagot, Paulo Vieira Milreu
2012 — —
Algorithms for biological graphs.
Andrea Marino
2012 C conf
Efficient Bubble Enumeration in Directed Graphs.
SPIRE
Etienne Birmelé, Pierluigi Crescenzi, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot
2012 B conf
On Computing the Diameter of Real-World Directed (Weighted) Graphs.
SEA
Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino
2012 J jnl
Optimal Listing of Cycles and st-Paths in Undirected Graphs
CoRR
Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot
2012 J jnl
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets.
Theor. Comput. Sci.
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
2012 A conf
Topical clustering of search results.
WSDM
Ugo Scaiella, Paolo Ferragina, Andrea Marino, Massimiliano Ciaramita
2011 — conf
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs.
TAPAS
Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino
2011 A* conf
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems.
ACL
Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta
2011 J jnl
Smooth movement and Manhattan path based Random Waypoint mobility.
Inf. Process. Lett.
Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Donatella Merlini, Gianluca Rossi, Paola Vocca
2010 — conf
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound.
ESA (1)
Pierluigi Crescenzi, Roberto Grossi, Claudio Imbrenda, Leonardo Lanzi, Andrea Marino
2009 B conf
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications.
SIROCCO
Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Gianluca Rossi, Paola Vocca