default search action
Andrea Marino 0001
Person information
- affiliation: Università degli Studi di Firenze, Firenze, Italy
Other persons with the same name
- Andrea Marino 0002
— Vrije Universiteit Amsterdam, Amsterdam, The Netherlands
- Andrea Marino 0003 — Sapienza University, Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j33]Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Silva:
On computing optimal temporal branchings and spanning subgraphs. J. Comput. Syst. Sci. 148: 103596 (2025) - 2024
- [j32]Isnard Lopes Costa, Raul Lopes, Andrea Marino, Ana Silva:
On computing large temporal (unilateral) connected components. J. Comput. Syst. Sci. 144: 103548 (2024) - [c44]Filippos Christodoulou, Pierluigi Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos:
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional. IWOCA 2024: 247-258 - 2023
- [j31]Andrea Marino
Eulerian Walks in Temporal Graphs. Algorithmica 85(3): 805-830 (2023) - [c43]Daniela Bubboloni, Costanza Catalano
On Computing Optimal Temporal Branchings. FCT 2023: 103-117 - [c42]Isnard Lopes Costa, Raul Lopes, Andrea Marino, Ana Silva:
On Computing Large Temporal (Unilateral) Connected Components. IWOCA 2023: 282-293 - [c41]Giulia Punzi, Alessio Conte, Roberto Grossi, Andrea Marino:
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs. SDM 2023: 289-297 - [i13]Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Silva:
On Computing Optimal Temporal Branchings and Spanning Subgraphs. CoRR abs/2312.11390 (2023) - 2022
- [j30]Andrea Marino, Ana Silva
Coloring temporal graphs. J. Comput. Syst. Sci. 123: 171-185 (2022) - [j29]Marco Calamai
On Computing the Diameter of (Weighted) Link Streams. ACM J. Exp. Algorithmics 27: 4.3:1-4.3:28 (2022) - [j28]Alessio Conte
Proximity Search for Maximal Subgraph Enumeration. SIAM J. Comput. 51(5): 1580-1625 (2022) - [j27]Francesco Tosoni
Locality Filtering for Efficient Ride Sharing Platforms. IEEE Trans. Intell. Transp. Syst. 23(7): 7785-7804 (2022) - [i12]Allen Ibiapina, Raul Lopes, Andrea Marino, Ana Silva
Menger's Theorem for Temporal Paths (Not Walks). CoRR abs/2206.15251 (2022) - 2021
- [j26]Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva
Edge-Disjoint Branchings in Temporal Digraphs. Electron. J. Comb. 28(4) (2021) - [j25]Takeaki Uno, Andrea Marino:
Preface: WEPA 2018. Discret. Appl. Math. 303: 160 (2021) - [j24]Davide Bacciu, Alessio Conte, Roberto Grossi, Francesco Landolfi
K-plex cover pooling for graph neural networks. Data Min. Knowl. Discov. 35(5): 2200-2220 (2021) - [j23]Jon Crowcroft
Leveraging the Users Graph and Trustful Transactions for the Analysis of Bitcoin Price. IEEE Trans. Netw. Sci. Eng. 8(2): 1338-1352 (2021) - [c40]Andrea Marino, Ana Silva
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs. IWOCA 2021: 485-500 - [c39]Marco Calamai, Pierluigi Crescenzi
On Computing the Diameter of (Weighted) Link Streams. SEA 2021: 11:1-11:21 - [i11]Andrea Marino, Ana Silva:
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs. CoRR abs/2103.07522 (2021) - 2020
- [j22]Alessio Conte
Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs. IEEE Access 8: 139096-139109 (2020) - [j21]Alessio Conte
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs. Algorithmica 82(6): 1547-1573 (2020) - [j20]Pierluigi Crescenzi
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs. Algorithms 13(9): 211 (2020) - [j19]Alessio Conte, Roberto Grossi, Andrea Marino:
Large-scale clique cover of real-world networks. Inf. Comput. 270 (2020) - [c38]Shima Moghtasedi, Cristina Ioana Muntean, Franco Maria Nardini
High-Quality Prediction of Tourist Movements using Temporal Trajectories in Graphs. ASONAM 2020: 348-352 - [c37]Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva
Edge-Disjoint Branchings in Temporal Graphs. IWOCA 2020: 112-125 - [c36]Alessio Conte, Pierluigi Crescenzi
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs. MFCS 2020: 25:1-25:14 - [c35]Roberto Grossi, Andrea Marino, Shima Moghtasedi:
Finding Structurally and Temporally Similar Trajectories in Graphs. SEA 2020: 24:1-24:13 - [i10]Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva:
Edge-Disjoint Branchings in Temporal Graphs. CoRR abs/2002.12694 (2020) - [i9]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Efficient Estimation of Graph Trussness. CoRR abs/2010.00967 (2020)
2010 – 2019
- 2019
- [j18]Pierluigi Crescenzi
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs. Algorithms 12(10): 211 (2019) - [j17]Damiano Di Francesco Maesa
The bow tie structure of the Bitcoin users graph. Appl. Netw. Sci. 4(1): 56:1-56:22 (2019) - [j16]Alessio Conte
A fast discovery algorithm for large common connected induced subgraphs. Discret. Appl. Math. 268: 210-222 (2019) - [j15]Alessio Conte
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties. SIAM J. Discret. Math. 33(2): 587-613 (2019) - [j14]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi
Computing top-k Closeness Centrality Faster in Unweighted Graphs. ACM Trans. Knowl. Discov. Data 13(5): 53:1-53:40 (2019) - [c34]Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno:
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. IWOCA 2019: 148-159 - [c33]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: 73:1-73:14 - [r1]Pierluigi Crescenzi, Andrea Marino:
Degrees of Separation and Diameter in Large Graphs. Encyclopedia of Big Data Technologies 2019 - [i8]Alessio Conte, Andrea Marino, Roberto Grossi, Takeaki Uno, Luca Versari:
Proximity Search For Maximal Subgraph Enumeration. CoRR abs/1912.13446 (2019) - 2018
- [j13]Alessio Conte, Roberto Grossi, Andrea Marino
Efficient enumeration of graph orientations with sources. Discret. Appl. Math. 246: 22-37 (2018) - [j12]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): 63-80 (2018) - [j11]Paolo Boldi, Andrea Marino, Massimo Santini, Sebastiano Vigna
BUbiNG: Massive Crawling for the Masses. ACM Trans. Web 12(2): 12:1-12:26 (2018) - [c32]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search. COCOON 2018: 328-340 - [c31]Damiano Di Francesco Maesa
The Graph Structure of Bitcoin. COMPLEX NETWORKS (2) 2018: 547-558 - [c30]Alessio Conte, Daniele De Sensi
Discovering $k$-Trusses in Large-Scale Networks. HPEC 2018: 1-6 - [c29]Alessio Conte, Tiziano De Matteis
D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes. KDD 2018: 1272-1281 - [c28]Alessio Conte, Gaspare Ferraro
Node Similarity with q -Grams for Real-World Labeled Networks. KDD 2018: 1282-1291 - [c27]Roberto Grossi, Andrea Marino, Luca Versari:
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs. LATIN 2018: 544-557 - [c26]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari:
Listing Subgraphs by Cartesian Decomposition. MFCS 2018: 84:1-84:16 - [c25]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: 100-110 - [i7]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Listing Maximal Subgraphs in Strongly Accessible Set Systems. CoRR abs/1803.03659 (2018) - 2017
- [j10]Damiano Di Francesco Maesa
Detecting artificial behaviours in the Bitcoin users graph. Online Soc. Networks Media 3-4: 63-74 (2017) - [c24]Alessio Conte, Roberto Grossi, Andrea Marino
A Fast Algorithm for Large Common Connected Induced Subgraphs. AlCoB 2017: 62-74 - [c23]Alessio Conte, Roberto Grossi, Andrea Marino
Listing Maximal Independent Sets with Minimal Space and Bounded Delay. SPIRE 2017: 144-160 - [i6]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing top-k Closeness Centrality Faster in Unweighted Graphs. CoRR abs/1704.01077 (2017) - 2016
- [j9]Roi Blanco, Paolo Boldi
Using graph distances for named-entity linking. Sci. Comput. Program. 130: 24-36 (2016) - [c22]Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke:
Computing Top-k Closeness Centrality Faster in Unweighted Graphs. ALENEX 2016: 68-80 - [c21]Damiano Di Francesco Maesa
An analysis of the Bitcoin users graph: inferring unusual behaviours. COMPLEX NETWORKS 2016: 749-760 - [c20]Damiano Di Francesco Maesa
Uncovering the Bitcoin Blockchain: An Analysis of the Full Users Graph. DSAA 2016: 537-546 - [c19]Alessio Conte, Roberto Grossi, Andrea Marino
Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques. ICALP 2016: 148:1-148:15 - [c18]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari:
Directing Road Networks by Listing Strong Orientations. IWOCA 2016: 83-95 - [c17]Alessio Conte, Roberto Grossi, Andrea Marino
Listing Acyclic Orientations of Graphs with Single and Multiple Sources. LATIN 2016: 319-333 - [c16]Alessio Conte, Roberto Grossi, Andrea Marino
Clique covering of large real-world networks. SAC 2016: 1134-1139 - [i5]Paolo Boldi, Andrea Marino, Massimo Santini, Sebastiano Vigna:
BUbiNG: Massive Crawling for the Masses. CoRR abs/1601.06919 (2016) - 2015
- [j8]Pierluigi Crescenzi
Synchronous context-free grammars and optimal linear parsing strategies. J. Comput. Syst. Sci. 81(7): 1333-1356 (2015) - [j7]Michele Borassi
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: 59-80 (2015) - [c15]Michele Borassi, David Coudert, Pierluigi Crescenzi
On Computing the Hyperbolicity of Real-World Graphs. ESA 2015: 215-226 - [c14]Alessio Conte, Roberto Grossi, Andrea Marino
Enumerating Cyclic Orientations of a Graph. IWOCA 2015: 88-99 - [i4]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi:
Enumerating Cyclic Orientations of a Graph. CoRR abs/1506.05977 (2015) - [i3]Michele Borassi, Pierluigi Crescenzi, Andrea Marino:
Fast and Simple Computation of Top-k Closeness Centralities. CoRR abs/1507.01490 (2015) - 2014
- [j6]Paulo Vieira Milreu, Cecilia Coimbra Klein, Ludovic Cottret
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure. Bioinform. 30(1): 61-70 (2014) - [j5]Andrea Marino:
Algorithms for Biological Graphs: Analysis and Enumeration. Bull. EATCS 114 (2014) - [j4]Irene Amerini
Blind image clustering based on the Normalized Cuts criterion for camera identification. Signal Process. Image Commun. 29(8): 831-843 (2014) - [c13]Michele Borassi, Pierluigi Crescenzi
On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method. FUN 2014: 52-63 - [c12]Andrea Marino:
Algorithms for biological graphs: analysis and enumeration. ICTCS 2014: 15-19 - [c11]Paolo Boldi
BUbiNG: massive crawling for the masses. WWW (Companion Volume) 2014: 227-228 - [c10]Roi Blanco, Paolo Boldi
Entity-Linking via Graph-Distance Minimization. GRAPHITE 2014: 30-43 - 2013
- [j3]Pilu Crescenzi
On computing the diameter of real-world undirected graphs. Theor. Comput. Sci. 514: 84-95 (2013) - [c9]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: 1884-1896 - [c8]Michele Borassi, Pierluigi Crescenzi
Telling Stories Fast. SEA 2013: 200-211 - [i2]Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta:
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies. CoRR abs/1311.6421 (2013) - 2012
- [b1]Andrea Marino:
Algorithms for biological graphs. University of Florence, Italy, 2012 - [j2]Vicente Acuña, Etienne Birmelé, Ludovic Cottret
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets. Theor. Comput. Sci. 457: 1-9 (2012) - [c7]Etienne Birmelé, Pierluigi Crescenzi
Efficient Bubble Enumeration in Directed Graphs. SPIRE 2012: 118-129 - [c6]Pierluigi Crescenzi
On Computing the Diameter of Real-World Directed (Weighted) Graphs. SEA 2012: 99-110 - [c5]Ugo Scaiella, Paolo Ferragina
Topical clustering of search results. WSDM 2012: 223-232 - [i1]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 abs/1205.2766 (2012) - 2011
- [j1]Pilu Crescenzi
Smooth movement and Manhattan path based Random Waypoint mobility. Inf. Process. Lett. 111(5): 239-246 (2011) - [c4]Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta:
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems. ACL 2011: 450-459 - [c3]Pierluigi Crescenzi
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs. TAPAS 2011: 92-103 - 2010
- [c2]Pierluigi Crescenzi
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound. ESA (1) 2010: 302-313
2000 – 2009
- 2009
- [c1]Pilu Crescenzi
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. SIROCCO 2009: 154-166
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-22 19:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: