Andrea MARINO

Ruolo attuale:: Professore Associato
SSD:: INFO-01/A - Informatica
Afferenza organizzativa:: Dipartimento di Statistica, Informatica, Applicazioni 'G. Parenti' (DiSIA)

Recapiti

	0552751524
	andrea.marino(AT)unifi.it

Ulteriori Recapiti

	Viale Morgagni, 65 - I piano
	www.andreamarino.it

Andrea MARINO

Orario di ricevimento (aggiornato al 12/03/2019)

Martedì dalle 10.30 alle 12.30

Andrea MARINO

Biografia

Da Febbraio 2022 Professore Associato presso il Dipartimento di Statistica, Informatica, Applicazioni, Università degli Studi di Firenze.

Da Aprile 2021 (fino ad Aprile 2030) Abilitazione Scientifica Nazionale di Prima Fascia

Esperienza

Febbraio 2019 - Gennaio 2022: Ricercatore a Tempo Determinato B (RTD-B) presso il Dipartimento di Statistica, Informatica, Applicazioni, Università degli Studi di Firenze.
Febbraio 2016 – Gennaio 2019: Ricercatore a Tempo Determinato A (RTD-A) presso il Dipartimento di Informatica, Università di Pisa.
Marzo 2015 – Gennaio 2016: Assegno di Ricerca presso il Dipartimento di Informatica, Università di Pisa (PRIN 2012C4E3KT progetto di ricerca nazionale AMANDA — Algorithmics for MAssive and Networked Data).
Marzo 2013 – Febbraio 2015: Assegno di Ricerca presso il Dipartimento di Informatica, Università di Milano, Laboratory for Web Algorithmics (NADINE FET EU project).

Istruzione

Gennaio 2010 – Dicembre 2012: Dottorato di Ricerca in Informatica e Applicazioni presso l'Università di Firenze, supervisionato da Prof. Pierluigi Crescenzi. Argomento di tesi: Algorithms for Biological Graphs: Analysis and Enumeration. Discussione della tesi: 29 aprile 2013.
Ottobre 2007 – Aprile 2009: Laurea Specialistica cum Laude in Scienze e Tecnologie dell'Informazione (Classe 23/S) presso l'Università di Firenze, conseguita in un anno accademico (a.a. 2007–2008) anziché nei due previsti. Data di Laurea: 29 aprile 2009.
Ottobre 2004 – Settembre 2007: Laurea Triennale cum Laude in Informatica presso l'Università di Firenze. Data di Laurea: 28 settembre 2007.

Riconoscimenti

Miglior tesi di dottorato italiana del 2013 su “Algorithms, Automata, Complexity and Game Theory” conferita da Capitolo Italiano dell’EATCS (European Association for Theoretical Computer Science).

Miglior Giovane Ricercatore Italiano in “Theoretical Computer Science” 2022 conferita da Capitolo Italiano dell’EATCS (European Association for Theoretical Computer Science).

Andrea MARINO

Interessi

Ricerca su algoritmi su grafi con applicazioni nel campo dell’analisi di grafi reali, enumerazione, web crawling, bioinformatica, information retrieval, mobile ad hoc networks e linguistica computazionale. Libri, articoli su conferenze e giornali sui profili Google Scholar e DBLP.

Algoritmi di Enumerazione: Autore di un libro (pubblicato da Atlantis Press, 2015) e altre pubblicazioni. Coautore di algoritmi stato dell'arte per generare tutti i cammini e cicli in un grafo (SODA 2013), migliorando l'Algoritmo di Johnson (1975) per grafi non orientati. Coautore di algoritmi stato dell'arte per generare tutte le clique massimali di un grafo (ICALP 2016). Coautore di altri algoritmi e framework stato dell'arte per la generazione di altre sturtture di base in grafi (MFCS 2018 e SIDMA 2019).
Algorithmi per l'analisi di grafi del mondo reale: Coautore di algoritmi stato dell'arte per il calcolo di: diametro, iperbolicità e top-k nodi più centrali (closeness centrality) in grafi di grande dimensione. L'algoritmo per il calcolo del diametro (TCS 2013) è stato usato per calcolare il diametro della rete di Facebook (1.2 miliardi di nodi) da Backstrom, Boldi, Rosa, Ugander e Vigna in “Four degrees of separation” (WebSci 2012) (riportato dal The New York Times, (325):B1, 21 November 2011). Più recentemente interessato in algoritmi per analizzare grafi temporali.
Grafi Temporali: Autore di diverse pubblicazioni che rivistano concetti fondamentali della graph theory nel contesto dei grafi temporali, ad esempio: Menger’s Theorem, Edmond’s Theorem, Eulerian paths and walks, temporal diameter, temporal closeness, temporal neighboorhood function, temporal coloring.
Bitcoin Graph Analysis. Nella rete di Bitcoin, i nodi corrispondono agli indirizzi degli utenti e gli archi rappresentano le transazioni. Capire l'economia di Bitcoin e la sua evoluzione spesso si traduce in misurare proprietà topologiche della rete di Bitcoin.
Web Crawling: Cosviluppatore di BUbiNG; BUbiNG è il web crawler opensource con le più alte prestazioni capace di gestire miliardi di pagine web, sviluppato presso il LAW (Laboratory of Web Algorithmic) dell'università di Milano.
Bioinformatic: Collaboratore di INRIA (Institut National de Recherche en Informatique et en Automatique) BAMBOO & BAOBAB Team,Université Claude Bernard (Lyon 1), di Marie-France Sagot, nell'ambito di metabolic networks e NGS (New Generation Sequence), sviluppando algoritmi di enumerazione ad hoc.

Andrea MARINO

Pubblicazioni

Legenda

Contributo su rivista |

Articolo su libro |

Libro |

Contributo in atti di convegno (proceeding) |

Brevetto |

Curatela | Altro

Altro |

Tesi di Dottorato

Christodoulou, Filippos; Crescenzi, Pierluigi; Marino, Andrea; Silva, Ana; Thilikos, Dimitrios M. (2024). Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional. In: IWOCA, SPRINGER INTERNATIONAL PUBLISHING AG, vol. 14764, pp. 247-258, ISBN:9783031630200 DOI

Bubboloni, Daniela; Catalano, Costanza; Marino, Andrea; Silva, Ana (2024). On Computing Optimal Temporal Branchings and Spanning Subgraphs. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. ???, pp. 1-36, ISSN:0022-0000 DOI Accesso ONLINE all'editore

Costa Isnard; Lopes Raul; Marino Andrea; Silva Ferreira Ana Shirley (2024). On computing large temporal (unilateral) connected components. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 144, pp. 1-20, ISSN:0022-0000 DOI

Costa I.L.; Lopes R.; Marino A.; Silva A. (2023). On Computing Large Temporal (Unilateral) Connected Components. In: 34th International Workshop on Combinatorial Algorithms, IWOCA 2023, twn, 2023, Springer Science and Business Media Deutschland GmbH, vol. 13889, pp. 282-293. DOI

Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Silva (2023). On Computing Optimal Temporal Branchings. In: International Symposium on Fundamentals of Computation Theory, Springer, pp. 103-117. DOI

Giulia Punzi, Alessio Conte, Roberto Grossi, Andrea Marino (2023). An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs. In: SIAM International Conference on Data Mining, SIAM, pp. 289-297.

Marino A.; Silva A. (2022). Coloring temporal graphs. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 123, pp. 171-185, ISSN:0022-0000 DOI

Marino A.; Silva A. (2022). Eulerian Walks in Temporal Graphs. ALGORITHMICA, pp. 0-0, ISSN:0178-4617 DOI

Conte A.; Grossi R.; Marino A.; Uno T.; Versari L. (2022). PROXIMITY SEARCH FOR MAXIMAL SUBGRAPH ENUMERATION. SIAM JOURNAL ON COMPUTING, vol. 51, pp. 1580-1625, ISSN:0097-5397 DOI

Calamai M.; Crescenzi P.; Marino A. (2022). On Computing the Diameter of (Weighted) Link Streams. ACM JOURNAL OF EXPERIMENTAL ALGORITHMICS, vol. 27, pp. 1-28, ISSN:1084-6654 DOI

Calamai M.; Crescenzi P.; Marino A. (2021). On computing the diameter of (weighted) link streams. In: 19th International Symposium on Experimental Algorithms, SEA 2021, fra, 2021, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, vol. 190, pp. 1-21. DOI

Campos V.; Lopes R.; Marino A.; Silva A. (2021). Edge-disjoint branchings in temporal digraphs. ELECTRONIC JOURNAL OF COMBINATORICS, vol. 28, pp. 1-23, ISSN:1077-8926 DOI

Tosoni F.; Ferragina P.; Marino A.; Resta G.; Santi P. (2021). Locality Filtering for Efficient Ride Sharing Platforms. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, pp. 1-20, ISSN:1524-9050 DOI

Bacciu D.; Conte A.; Grossi R.; Landolfi F.; Marino A. (2021). K-plex cover pooling for graph neural networks. DATA MINING AND KNOWLEDGE DISCOVERY, vol. 35, pp. 2200-2220, ISSN:1384-5810 DOI

Uno T.; Marino A. (2021). Preface: WEPA 2018. In: .... Special Issue WEPA 2018, pp. 160-160, RADARWEG 29, 1043 NX AMSTERDAM, NETHERLANDS: Elsevier B.V.. DOI

Marino A.; Silva A. (2021). Königsberg Sightseeing: Eulerian Walks in Temporal Graphs. In: 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021, 2021, Springer Science and Business Media Deutschland GmbH, vol. 12757, pp. 485-500, ISBN:978-3-030-79986-1 DOI

Moghtasedi S.; Muntean C.I.; Nardini F.M.; Grossi R.; Marino A. (2020). High-Quality Prediction of Tourist Movements using Temporal Trajectories in Graphs. In: 12th IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2020, nld, 2020, Institute of Electrical and Electronics Engineers Inc., pp. 348-352, ISBN:978-1-7281-1056-1 DOI

Campos V.; Lopes R.; Marino A.; Silva A. (2020). Edge-Disjoint Branchings in Temporal Graphs. In: 31st International Workshop on Combinatorial Algorithms, IWOCA 2020, fra, 2020, Springer, vol. 12126, pp. 112-125, ISBN:978-3-030-48965-6 DOI

Conte A.; De Sensi D.; Grossi R.; Marino A.; Versari L. (2020). Truly scalable K-Truss and max-truss algorithms for community detection in graphs. IEEE ACCESS, vol. 8, pp. 139096-139109, ISSN:2169-3536 DOI

Conte A.; Grossi R.; Marino A.; Versari L. (2020). Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs. ALGORITHMICA, vol. 82, pp. 1547-1573, ISSN:0178-4617 DOI

Crowcroft, Jon; Di Francesco Maesa, Damiano; Magrini, Alessandro; Marino, Andrea; Ricci, Laura (2020). Leveraging the users graph and trustful transactions for the analysis of Bitcoin price. IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, vol. 8, pp. 1338-1352, ISSN:2327-4697 DOI

Conte A.; Crescenzi P.; Marino A.; Punzi G. (2020). Enumeration of s-d separators in DAGs with application to reliability analysis in temporal graphs. In: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, cze, 2020, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, vol. 170, pp. 1-14. DOI

Crescenzi, Pierluigi; Magnien, Clémence; Marino, Andrea (2020). Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs. ALGORITHMS, vol. 13, pp. 1-27, ISSN:1999-4893 DOI

Grossi R.; Marino A.; Moghtasedi S. (2020). Finding Structurally and Temporally Similar Trajectories in Graphs. In: 18th International Symposium on Experimental Algorithms, SEA 2020, ita, 2020, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, vol. 160, pp. 1-13. DOI

Conte A.; Grossi R.; Marino A.; Tattini L.; Versari L. (2019). A fast discovery algorithm for large common connected induced subgraphs. DISCRETE APPLIED MATHEMATICS, vol. 268, pp. 210-222, ISSN:0166-218X DOI Accesso ONLINE all'editore

Conte A.; Grossi R.; Marino A.; Versari L. (2019). Listing maximal subgraphs satisfying strongly accessible properties∗. SIAM JOURNAL ON DISCRETE MATHEMATICS, vol. 33, pp. 587-613, ISSN:0895-4801 DOI Accesso ONLINE all'editore

Conte A.; Kante M.M.; Marino A.; Uno T. (2019). Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs. In: 30th International Workshop on Combinatorial Algorithms, IWOCA 2019, ita, 2019, Springer Verlag, vol. 11638, pp. 148-159, ISBN:978-3-030-25004-1 DOI Accesso ONLINE all'editore

Maesa D.D.F.; Marino A.; Ricci L. (2019). The bow tie structure of the Bitcoin users graph. APPLIED NETWORK SCIENCE, vol. 4, pp. 1-22, ISSN:2364-8228 DOI Accesso ONLINE all'editore

Di Francesco Maesa, Damiano*; Marino, Andrea; Ricci, Laura (2019). The graph structure of bitcoin. In: 7th International Conference on Complex Networks and their Applications, COMPLEX NETWORKS 2018, gbr, 2018, Springer Verlag, vol. 813, pp. 547-558, ISBN:9783030054137 DOI Accesso ONLINE all'editore

Conte A.; Grossi R.; Marino A. (2019). Large-scale clique cover of real-world networks. INFORMATION AND COMPUTATION, pp. 1-18, ISSN:0890-5401 DOI Accesso ONLINE all'editore

Bergamini, Elisabetta; Borassi, Michele; Crescenzi, Pierluigi; Marino, Andrea; Meyerhenke, Henning (2019). Computing top-k Closeness Centrality Faster in Unweighted Graphs. ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, vol. 13, pp. 1-40, ISSN:1556-4681 DOI Accesso ONLINE all'editore

Crescenzi, Pierluigi; Magnien, Clémence; Marino, Andrea (2019). Approximating the Temporal Neighbourhood Function of Large Temporal Graphs. ALGORITHMS, vol. 12, pp. 211-232, ISSN:1999-4893 DOI

Conte A.; Grossi R.; Kante M.M.; Marino A.; Uno T.; Wasa K. (2019). Listing induced steiner subgraphs as a compact way to discover steiner trees in graphs. In: 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, deu, 2019, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, vol. 138, pp. 1-14. DOI Accesso ONLINE all'editore

Alessio Conte; Gaspare Ferraro; Roberto Grossi; Andrea Marino; Kunihiko Sadakane; Takeaki Uno (2018). Node Similarity with q-Grams for Real-World Labeled Networks. In: Proceedings of the 24th ACM SIGKDD International Conference onKnowledge Discovery & Data Mining, KDD 2018, ACM, pp. 1282-1291. DOI Accesso ONLINE all'editore

Di Francesco Maesa, Damiano; Marino, Andrea; Ricci, Laura (2018). Data-driven analysis of Bitcoin properties: exploiting the users graph. INTERNATIONAL JOURNAL OF DATA SCIENCE AND ANALYTICS, pp. 63-80, ISSN:2364-415X DOI Accesso ONLINE all'editore

Alessio Conte; Daniele De Sensi; Roberto Grossi; Andrea Marino; Luca Versari (2018). Discovering K-Trusses in Large-Scale Networks. In: 2018 IEEE High Performance Extreme Computing Conference, HPEC2018, IEEE, pp. 1-6. DOI Accesso ONLINE all'editore

Roberto Grossi; Andrea Marino; Luca Versari (2018). Efficient Algorithms for Listing k Disjoint st-Paths in Graphs. In: LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Springer Verlag, pp. 544-557. DOI Accesso ONLINE all'editore

Alessio Conte; Roberto Grossi; Andrea Marino; Romeo Rizzi; Takeaki Uno; Luca Versari (2018). Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. In: Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Springer Verlag, pp. 100-110. DOI Accesso ONLINE all'editore

Alessio Conte; Tiziano De Matteis; Daniele De Sensi; Roberto Grossi; Andrea Marino; Luca Versari (2018). Parallel Enumeration: A tool for parallel and distributed enumeration of cliques and diameter two kplexes. Accesso ONLINE all'editore

Conte, Alessio; Grossi, Roberto; Marino, Andrea; Rizzi, Romeo (2018). Efficient enumeration of graph orientations with sources. DISCRETE APPLIED MATHEMATICS, pp. 22-37, ISSN:0166-218X DOI

Alessio Conte; Roberto Grossi; Andrea Marino; Romeo Rizzi; Luca Versari (2018). Listing Subgraphs by Cartesian Decomposition. In: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, LIPIcs, pp. 84:1-84:16. DOI Accesso ONLINE all'editore

Alessio Conte; Roberto Grossi; Andrea Marino; Luca Versari (2018). Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search. In: Computing and Combinatorics - 24th International Conference, COCOON2018, Springer Verlag, pp. 328-340. DOI Accesso ONLINE all'editore

Alessio Conte; Gaspare Ferraro; Roberto Grossi; Andrea Marino; Kunihiko Sadakane; Takeaki Uno (2018). ColorCoding: Implementation of some algorithms for graph similarity based on the color-coding method by Alon-Yuster-Zwick. Accesso ONLINE all'editore

Alessio Conte; Tiziano De Matteis; Daniele De Sensi; Roberto Grossi; Andrea Marino; Luca Versari (2018). D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes. In: Proceedings of the 24th ACM SIGKDD International Conference onKnowledge Discovery & Data Mining, KDD 2018, ACM, pp. 1272-1281. DOI Accesso ONLINE all'editore

Alessio Conte; Roberto Grossi; Andrea Marino; Luca Versari (2018). BC-Cliques: Code to enumerate black connected cliques in the graph obtained by computing the product between two labeled graphs. Accesso ONLINE all'editore

Crescenzi, Pierluigi; Marino, Andrea (2018). Degrees of Separation and Diameter in Large Graphs. In: Sherif Sakr, Albert Zomaya. Encyclopedia of Big Data Technologies, pp. 1-7 Springer, Berlin, Heidelberg, ISBN:978-3-319-63962-8. DOI

Paolo Boldi; Andrea Marino; Massimo Santini; Sebastiano Vigna (2018). BUbiNG: Massive Crawling for the Masses. ACM TRANSACTIONS ON THE WEB, pp. 1-26, ISSN:1559-1131

Conte, Alessio; Grossi, Roberto; Marino, Andrea; Uno, Takeaki; Versari, Luca (2017). Listing maximal independent sets with minimal space and bounded delay. In: 24th International Symposium on String Processing and Information Retrieval, SPIRE 2017, ita, 2017, Springer Verlag, vol. 10508, pp. 144-160, ISBN:9783319674278 DOI Accesso ONLINE all'editore

Conte, Alessio; Grossi, Roberto; Marino, Andrea; Tattini, Lorenzo; Versari, Luca (2017). A fast algorithm for large common connected induced subgraphs. In: 4th International Conference on Algorithms for Computational Biology, AlCoB 2017, prt, 2017, Springer Verlag, vol. 10252, pp. 62-74, ISBN:9783319581620 DOI Accesso ONLINE all'editore

Damiano Di Francesco Maesa; Andrea Marino; Laura Ricci (2017). Detecting artificial behaviours in the Bitcoin users graph. ONLINE SOCIAL NETWORKS AND MEDIA, vol. 3-4, pp. 63-74, ISSN:2468-6964 DOI Accesso ONLINE all'editore

Conte Alessio; Grossi Roberto; Marino Andrea; Rizzi Romeo; Versari Luca (2016). Directing road networks by listing strong orientations. In: 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, fin, 2016, Springer Verlag, vol. 9843, pp. 83-95, ISBN:9783319445427 DOI Accesso ONLINE all'editore

Blanco Roi; Boldi Paolo; Marino Andrea (2016). Using graph distances for named-entity linking. SCIENCE OF COMPUTER PROGRAMMING, pp. 1-13, ISSN:0167-6423 DOI Accesso ONLINE all'editore

Di Francesco Maesa Damiano; Marino Andrea; Ricci Laura (2016). An analysis of the Bitcoin users graph: inferring unusual behaviours,. In: Complex Networks 2016, 5th International Workshop on Complex Networks and their Applications,, Milano, Novembre 2016, Springer Verlag, pp. 749-760.

Bergamini Elisabetta; Borassi Michele; Crescenzi Pierluigi; Marino Andrea; Meyerhenke Henning (2016). Computing top-k closeness centrality faster in unweighted graphs. In: 18th Workshop on Algorithm Engineering and Experiments 2016, ALENEX 2016, usa, 2016, Society for Industrial and Applied Mathematics Publications, vol. 2016-, pp. 68-80, ISBN:9781510819689 Accesso ONLINE all'editore

Conte Alessio; Grossi Roberto; Marino Andrea; Rizzi Romeo (2016). Listing acyclic orientations of graphs with single and multiple sources. In: 12th Latin American Symposium on Theoretical Informatics, LATIN 2016, Ensenada, 11/04/2016-15/04/2016, Springer Verlag, vol. 9644, pp. 319-333, ISBN:9783662495285 DOI Accesso ONLINE all'editore

Conte Alessio; Grossi Roberto; Marino Andrea (2016). Clique covering of large real-world networks. In: 31st Annual ACM Symposium on Applied Computing, SAC 2016, ita, 2016, Association for Computing Machinery, vol. 04-08-, pp. 1134-1139, ISBN:9781450337397 DOI

Di Francesco Maesa Damiano; Marino Andrea; Ricci Laura (2016). Uncovering the Bitcoin Blockchain: An Analysis of the Full Users Graph. In: 2016 IEEE International Conference on Data Science and Advanced Analytics, DSAA 2016, IEEE, pp. 537-546.

Conte Alessio; Grossi Roberto; Marino Andrea; Versari Luca (2016). Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques. In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, ita, 2016, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, vol. 55, pp. 1-15, ISBN:9783959770132 DOI Accesso ONLINE all'editore

Marino Andrea (2015). Analysis and enumeration: algorithms for biological graphs. Amsterdam: Atlantis Press, ISBN:978-94-6239-096-6 DOI Accesso ONLINE all'editore

Borassi, Michele; Crescenzi, Pierluigi; Habib, Michel; Kosters, Walter A.; Marino, Andrea; Takes, Frank W. (2015). Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs. With an application to the six degrees of separation games. THEORETICAL COMPUTER SCIENCE, vol. 586, pp. 59-80, ISSN:0304-3975 DOI Accesso ONLINE all'editore

Crescenzi, Pierluigi; Gildea, Daniel; Marino, Andrea; Rossi, Gianluca; Satta, Giorgio (2015). Synchronous context-free grammars and optimal linear parsing strategies. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 81, pp. 1333-1356, ISSN:0022-0000 DOI

Borassi Michele; Coudert David; Crescenzi Pierluigi; Marino Andrea (2015). On computing the hyperbolicity of real-world graphs. In: 23rd European Symposium on Algorithms, ESA 2015, Patras, Greece, 14/09/2015-16/09/2015, Springer Verlag, vol. 9294, pp. 215-226, ISBN:9783662483497 DOI Accesso ONLINE all'editore

CONTE, ALESSIO; GROSSI, ROBERTO; MARINO, ANDREA; Rizzi, Romeo (2015). Enumerating Cyclic Orientations of a Graph. In: International Workshop on Combinatorial Algorithms (IWOCA 2015), Springer Verlag, pp. 88-99. DOI

P. V. Milreu;C. C. Klein;L. Cottret;V. Acuna;E. Birmele;M. Borassi;C. Junot;A. Marchetti-Spaccamela;A. Marino;L. Stougie;F. Jourdan;P. Crescenzi;V. Lacroix;M.-F. Sagot (2014). Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure. BIOINFORMATICS, vol. 30, pp. 61-70, ISSN:1367-4803 DOI

Blanco, Roi; Boldi, Paolo; MARINO, ANDREA (2014). Entity-linking via graph-distanceminimization. In: 3rd Workshop on GRAPH Inspection and Traversal Engineering, GRAPHITE 2014, Grenoble, France, 05/04/2014, Electronic Proceedings in Theoretical Computer Science, vol. 159, pp. 30-43. DOI Accesso ONLINE all'editore

M. Borassi;P. Crescenzi;M. Habib;W. Kosters;A. Marino;F. Takes (2014). On the Solvability of the Six Degrees of Kevin Bacon Game. In: 7th International Conference on Fun with Algorithms, Springer, vol. 8496, pp. 52-63, ISBN:9783319078892 DOI

Boldi, Paolo; Marino, Andrea; Santini, Massimo; Vigna, Sebastiano (2014). BUbiNG: Massive crawling for the masses. In: 23rd International Conference on World Wide Web, WWW 2014, kor, 2014, Association for Computing Machinery, Inc, pp. 227-228, ISBN:9781450327459 DOI

I. Amerini; R. Caldelli; P. Crescenzi; A. Del Mastio; A. Marino (2014). Blind image clustering based on the Normalized Cuts criterion for camera identification. SIGNAL PROCESSING-IMAGE COMMUNICATION, vol. 29, pp. 831-843, ISSN:0923-5965 DOI

Marino A (2014). Algorithms for Biological Graphs: Analysis and Enumeration. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, pp. 1-6, ISSN:0252-9742

P. Crescenzi; R. Grossi; M. Habib; L. Lanzi; A. Marino (2013). On computing the diameter of real-world undirected graphs. THEORETICAL COMPUTER SCIENCE, vol. 514, pp. 84-95, ISSN:0304-3975 DOI Accesso ONLINE all'editore

M. Borassi;P. Crescenzi;V. Lacroix;A. Marino;M.-F. Sagot;P. Vieira Milreu (2013). Telling Stories Fast. In: 12th International Symposium on Experimental Algorithms, Springer, vol. 7933, pp. 200-211, ISBN:9783642385261 DOI

Andrea Marino (2013). Algorithms for Biological Graphs: Analysis and Enumeration. (Tutor: Pierluigi Crescenzi)

BIRMELE E.; FERREIRA R.; GROSSI, ROBERTO; MARINO, ANDREA; PISANTI, NADIA; RIZZI R. SACOMOTO G. A. (2013). Optimal Listing of Cycles and st-Paths in Undirected Graphs. In: proceedings of 24th ACM/SIAM Symposium On Discrete Algorithms (SODA) 2013, New Orleans, January 2013, ACM SIAM, pp. 1884-1896, ISBN:9781611972511 DOI

Etienne Birmelé;Pierluigi Crescenzi;Rui Ferreira;Roberto Grossi;Vincent Lacroix;Andrea Marino;Nadia Pisanti;Gustavo Sacomoto;Marie-France Sagot (2012). Efficient Bubble Enumeration in Directed Graphs. In: 19th International Symposium on String Processing and Information Retrieval, vol. 7608, pp. 118-129, ISBN:9783642341083 DOI

U. Scaiella; P. Ferragina; A. Marino; M. Ciaramita (2012). Topical clustering of search results. In: Fifth ACM International Conference on Web Search Data Mining, WSDM 2012, Seattle, Washington, February 8-12, 2012, ACM, pp. 223-232. DOI

P. CRESCENZI; R. GROSSI; L. LANZI; A. MARINO (2012). ON COMPUTING THE DIAMETER OF REAL-WORLD DIRECTED (WEIGHTED) GRAPHS. In: 11TH INTERNATIONAL SYMPOSIUM ON EXPERIMENTAL ALGORITHMS, Springer, Berlin, Heidelberg, pp. 99-110, ISBN:9783642308499 DOI

Klein, Cecilia; MARINO, ANDREA; Sagot, Marie France; Milreu, Paulo Vieira; Brilli, Matteo (2012). Structural and dynamical analysis of biological networks. BRIEFINGS IN FUNCTIONAL GENOMICS, vol. 11, pp. 420-433, ISSN:2041-2649 DOI

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). Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets. THEORETICAL COMPUTER SCIENCE, vol. 457, pp. 1-9, ISSN:0304-3975 DOI

P. Crescenzi; R. Grossi; L. Lanzi; A. Marino (2011). A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs. In: First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, Roma, 18-20 aprile 2011, Springer, Berlin, Heidelberg, pp. 92-103, ISBN:9783642197536 DOI

P. Crescenzi; M. Di Ianni; A. Marino; D. Merlini; G. Rossi; P. Vocca (2011). Smooth movement and Manhattan path based random waypoint mobility. INFORMATION PROCESSING LETTERS, vol. 111 (5), pp. 239-246, ISSN:0020-0190 DOI

P. Crescenzi; D. Gildea; A. Marino; G. Rossi; G. Satta (2011). Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems. In: The 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Portland, Oregon, USA, 19-24 June, 2011, Association for Computational Linguistics, pp. 450-459, ISBN:9781932432879

P. Crescenzi; R. Grossi; C. Imbrenda; L. Lanzi; A. Marino (2010). Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound. In: Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool UK, September 6-8, 2010, Springer, Berlin, Heidelberg, pp. 302-313, ISBN:9783642157745 DOI

P. Crescenzi; M. Di Ianni; A. Marino; G. Rossi; P. Vocca (2010). Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications.. In: Structural Information and Communication Complexity, 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Springer, Berlin, Heidelberg, vol. 5869, pp. 154-166, ISBN:9783642114755 DOI

Andrea MARINO

Biography

Born on June 1985. PhD in Computer Science at University of Florence, advised by Pierluigi Crescenzi. Associate Professor at University of Florence. Formerly Assistant Professor at University of Pisa, working with the group of Roberto Grossi, and Post-doc at the Laboratory of Web Algorithmics of University of Milan. Best Italian PhD Thesis on "Algorithms, Automata, Complexity and Game Theory" 2013 and Best Italian Young Researcher in "Theoretical Computer Science" 2022 awarded by Italian Chapter of the EATCS (European Association for Theoretical Computer Science). Interested in Algorithms and Complexity, Complex Networks analysis, Enumeration Algorithms, Temporal graphs.

Andrea MARINO

Curriculum

Since February 2021 Associate Professor at Dipartimento di Statistica, Informatica, Applicazioni, University of Florence.

Since April 2021 (until 2030), qualified for Full Professorship in Computer Science in Italy (in Italian, Abilitazione Scientifica Nazionale di Prima Fascia).

Past Positions

February 2019 - January 2021 Assistant Professor (RTD-B) at Dipartimento di Statistica, Informatica, Applicazioni, University of Florence.
February 2016 – January 2019: Assistant Professor (RTD-A) at Dipartimento di Informatica, University of Pisa.
March 2015 – January 2016: Research Fellow at Dipartimento di Informatica, University of Pisa (PRIN 2012C4E3KT national research project AMANDA — Algorithmics for MAssive and Networked Data).
March 2013 – February 2015: Research Fellow at University of Milan, hosted by LAW, Laboratory for Web Algorithmics (NADINE FET EU project).

Training

PhD degree in Computer Science at University of Florence, advised by Prof. Pierluigi Crescenzi (From January 2010 to December 2012). Subject: Algorithms for Biological Graphs: Analysis and Enumeration. PhD defence: April 29th 2013.
Master’s Degree cum Laude in Computer Science at University of Florence; 1 A.Year instead of the 2 expected (A.Year 2007-2008). Graduation Date: April 29th 2009.
Bachelor’s Degree cum Laude in Computer Science at University of Florence; 3 A.Years as expected (From A.Year 2004-2005 to A.Year 2006-2007). Graduation Date: September 28th 2007.

Awards

Best Italian Young Researcher in “Theoretical Computer Science” 2022.
Italian Chapter of the EATCS (European Association for Theoretical Computer Science).
Best Italian PhD Thesis on “Algorithms, Automata, Complexity and Game Theory” 2013.
Italian Chapter of the EATCS (European Association for Theoretical Computer Science)

Andrea MARINO

Interest

Author of a book, conference papers, and journal papers on graph algorithms with applications to enumeration, web crawling, bioinformatics, real-world graph analysis, information retrieval, mobile ad hoc networks, and computational linguistic.

Checkout the Scholar Profile or the DBLP page

Enumeration Algorithms: Author of a book (published by Atlantis Press, 2015) and other publications in this field. Co-author of the current best algorithm to list all the paths and cycles in a graph (SODA 2013), improving Johnson Algorithm (1975). Co-author of the current best output-sensitive algorithm to list all the maximal cliques in a graph (ICALP 2016). Coauthor of other several state of the art algorithms for listing basic structures of graphs and coauthor of general frameworks (MFCS 2018 and SIDMA 2019).
Algorithms for Real-World Graph Analysis: Co-author of state of the art algorithms to compute: diameter, hyperbolicity, and top-central nodes (closeness centrality) in huge graphs. The diameter algorithm (TCS 2013) has been used to compute the diameter of Facebook networks (1.2 billions of nodes) by Backstrom, Boldi, Rosa, Ugander, and Vigna in “Four degrees of separation” (WebSci 2012) (reported by The New York Times, (325):B1, 21 November 2011). More recently, interested in algorithms for temporal graph analysis extending notions and algorithms of classical graph theory to temporal graphs.
Temporal Graphs: Several publications revisiting fundamental notions of static graph theory for temporal graphs, including Menger’s Theorem, Edmond’s Theorem, Eulerian paths and walks, temporal diameter, temporal closeness, temporal neighboorhood function, temporal coloring.
Bitcoin Graph Analysis. In a Bitcoin network, the nodes are user addresses and each edge represents a transaction from a payer address to a recipient one. Understanding Bitcoin economy and dynamics often translate in measuring properties of these networks. In this context, we have measured how the concentration of richness change over time, showing that “Rich get richer and poor get poorer” and the presence of artificial patterns.
Web Crawling: One of the BUbiNG developers; BUbiNG is the publicly available web crawler currently with the highest performances (downloading, storing, and managing billions of web pages), developed at LAW (Laboratory of Web Algorithmic), University of Milan.
Bioinformatic: Collaborator of INRIA (Institut National de Recherche en Informatique et en Automatique) BAMBOO & BAOBAB Team,Université Claude Bernard (Lyon 1), headed by Marie-France Sagot, working on metabolic networks and NGS (New Generation Sequence), designing ad hoc enumeration algorithms.