Andrea Marino

According to our database1, Andrea Marino authored at least 48 papers between 2009 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Degrees of Separation and Diameter in Large Graphs.
Proceedings of the Encyclopedia of Big Data Technologies., 2019

Listing Maximal Subgraphs Satisfying Strongly Accessible Properties.
SIAM J. Discrete Math., 2019

The bow tie structure of the Bitcoin users graph.
Applied Network Science, 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
Data-driven analysis of Bitcoin properties: exploiting the users graph.
Int. J. Data Sci. Anal., 2018

Efficient enumeration of graph orientations with sources.
Discrete Applied Mathematics, 2018

Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Listing Subgraphs by Cartesian Decomposition.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Efficient Algorithms for Listing k Disjoint st-Paths in Graphs.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Node Similarity with q -Grams for Real-World Labeled Networks.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Discovering $k$-Trusses in Large-Scale Networks.
Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018

The Graph Structure of Bitcoin.
Proceedings of the Complex Networks and Their Applications VII, 2018

Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Detecting artificial behaviours in the Bitcoin users graph.
Online Social Networks and Media, 2017

Listing Maximal Independent Sets with Minimal Space and Bounded Delay.
Proceedings of the String Processing and Information Retrieval, 2017

A Fast Algorithm for Large Common Connected Induced Subgraphs.
Proceedings of the Algorithms for Computational Biology, 2017

2016
Using graph distances for named-entity linking.
Sci. Comput. Program., 2016

Clique covering of large real-world networks.
Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016

Listing Acyclic Orientations of Graphs with Single and Multiple Sources.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Directing Road Networks by Listing Strong Orientations.
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

Uncovering the Bitcoin Blockchain: An Analysis of the Full Users Graph.
Proceedings of the 2016 IEEE International Conference on Data Science and Advanced Analytics, 2016

An analysis of the Bitcoin users graph: inferring unusual behaviours.
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

Computing Top-k Closeness Centrality Faster in Unweighted Graphs.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 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

Synchronous context-free grammars and optimal linear parsing strategies.
J. Comput. Syst. Sci., 2015

Enumerating Cyclic Orientations of a Graph.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

On Computing the Hyperbolicity of Real-World Graphs.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Blind image clustering based on the Normalized Cuts criterion for camera identification.
Sig. Proc.: Image Comm., 2014

Entity-Linking via Graph-Distance Minimization.
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.
Bioinformatics, 2014

BUbiNG: massive crawling for the masses.
Proceedings of the 23rd International World Wide Web Conference, 2014

Algorithms for biological graphs: analysis and enumeration.
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 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
On computing the diameter of real-world undirected graphs.
Theor. Comput. Sci., 2013

Telling Stories Fast.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Optimal Listing of Cycles and st-Paths in Undirected Graphs.
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

Topical clustering of search results.
Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

On Computing the Diameter of Real-World Directed (Weighted) Graphs.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Efficient Bubble Enumeration in Directed Graphs.
Proceedings of the String Processing and Information Retrieval, 2012

2011
Smooth movement and Manhattan path based Random Waypoint mobility.
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

Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems.
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


  Loading...