Andrea Marino
Orcid: 0000-0002-9854-7885Affiliations:
- Università degli Studi di Firenze, Firenze, Italy
According to our database1,
Andrea Marino
authored at least 79 papers
between 2009 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on id.loc.gov
On csauthors.net:
Bibliography
2023
Proceedings of the 2023 SIAM International Conference on Data Mining, 2023
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023
2022
IEEE Trans. Intell. Transp. Syst., 2022
2021
Leveraging the Users Graph and Trustful Transactions for the Analysis of Bitcoin Price.
IEEE Trans. Netw. Sci. Eng., 2021
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021
2020
Algorithms, 2020
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs.
Algorithmica, 2020
IEEE Access, 2020
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020
Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020
Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2020
2019
Proceedings of the Encyclopedia of Big Data Technologies., 2019
ACM Trans. Knowl. Discov. Data, 2019
SIAM J. Discret. Math., 2019
Discret. Appl. Math., 2019
Algorithms, 2019
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019
2018
Int. J. Data Sci. Anal., 2018
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018
Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018
Proceedings of the Complex Networks and Their Applications VII, 2018
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018
2017
Online Soc. Networks Media, 2017
Proceedings of the String Processing and Information Retrieval, 2017
Proceedings of the Algorithms for Computational Biology, 2017
2016
Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016
Proceedings of the LATIN 2016: Theoretical Informatics, 2016
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016
Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Proceedings of the 2016 IEEE International Conference on Data Science and Advanced Analytics, 2016
Proceedings of the Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30, 2016
2015
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., 2015
J. Comput. Syst. Sci., 2015
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015
Proceedings of the Algorithms - ESA 2015, 2015
2014
Blind image clustering based on the Normalized Cuts criterion for camera identification.
Signal Process. Image Commun., 2014
Proceedings of the Proceedings 3rd Workshop on GRAPH Inspection and Traversal Engineering, 2014
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure.
Bioinform., 2014
On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014
2013
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
2012
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets.
Theor. Comput. Sci., 2012
Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012
Proceedings of the String Processing and Information Retrieval, 2012
2011
Inf. Process. Lett., 2011
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011
Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 2011
2010
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound.
Proceedings of the Algorithms, 2010
2009
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications.
Proceedings of the Structural Information and Communication Complexity, 2009