The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Andrea Marino" ( http://dblp.L3S.de/Authors/Andrea_Marino )

URL (Homepage):  https://orcid.org/0000-0002-9854-7885  Author page on DBLP  Author page in RDF  Community of Andrea Marino in ASPL-2

Publication years (Num. hits)
2009-2014 (21) 2015-2016 (15) 2017-2018 (16) 2019 (3)
Publication types (Num. hits)
article(21) incollection(1) inproceedings(33)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 56 publication records. Showing 55 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari Listing Maximal Subgraphs Satisfying Strongly Accessible Properties. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pierluigi Crescenzi, Andrea Marino Degrees of Separation and Diameter in Large Graphs. Search on Bibsonomy Encyclopedia of Big Data Technologies The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs. Search on Bibsonomy IWOCA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Paolo Boldi, Andrea Marino, Massimo Santini 0001, Sebastiano Vigna BUbiNG: Massive Crawling for the Masses. Search on Bibsonomy TWEB The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci Data-driven analysis of Bitcoin properties: exploiting the users graph. Search on Bibsonomy Int. J. Data Sci. Anal. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi Efficient enumeration of graph orientations with sources. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari Listing Maximal Subgraphs in Strongly Accessible Set Systems. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci The Graph Structure of Bitcoin. Search on Bibsonomy COMPLEX NETWORKS (2) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Tiziano De Matteis, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes. Search on Bibsonomy KDD The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno Node Similarity with q -Grams for Real-World Labeled Networks. Search on Bibsonomy KDD The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari Listing Subgraphs by Cartesian Decomposition. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari Discovering $k$-Trusses in Large-Scale Networks. Search on Bibsonomy HPEC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search. Search on Bibsonomy COCOON The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Roberto Grossi, Andrea Marino, Luca Versari Efficient Algorithms for Listing k Disjoint st-Paths in Graphs. Search on Bibsonomy LATIN The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci Detecting artificial behaviours in the Bitcoin users graph. Search on Bibsonomy Online Social Networks and Media The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke Computing top-k Closeness Centrality Faster in Unweighted Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari A Fast Algorithm for Large Common Connected Induced Subgraphs. Search on Bibsonomy AlCoB The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari Listing Maximal Independent Sets with Minimal Space and Bounded Delay. Search on Bibsonomy SPIRE The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Roi Blanco, Paolo Boldi, Andrea Marino Using graph distances for named-entity linking. Search on Bibsonomy Sci. Comput. Program. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Paolo Boldi, Andrea Marino, Massimo Santini 0001, Sebastiano Vigna BUbiNG: Massive Crawling for the Masses. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci Uncovering the Bitcoin Blockchain: An Analysis of the Full Users Graph. Search on Bibsonomy DSAA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari Directing Road Networks by Listing Strong Orientations. Search on Bibsonomy IWOCA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques. Search on Bibsonomy ICALP The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino Clique covering of large real-world networks. Search on Bibsonomy SAC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Damiano Di Francesco Maesa, Andrea Marino, Laura Ricci An analysis of the Bitcoin users graph: inferring unusual behaviours. Search on Bibsonomy COMPLEX NETWORKS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke Computing Top-k Closeness Centrality Faster in Unweighted Graphs. Search on Bibsonomy ALENEX The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi Listing Acyclic Orientations of Graphs with Single and Multiple Sources. Search on Bibsonomy LATIN The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta Synchronous context-free grammars and optimal linear parsing strategies. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Michele Borassi, Pierluigi Crescenzi, Andrea Marino Fast and Simple Computation of Top-k Closeness Centralities. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi Enumerating Cyclic Orientations of a Graph. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi Enumerating Cyclic Orientations of a Graph. Search on Bibsonomy IWOCA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Michele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino On Computing the Hyperbolicity of Real-World Graphs. Search on Bibsonomy ESA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Andrea Marino Algorithms for Biological Graphs: Analysis and Enumeration. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2014 DBLP  BibTeX  RDF
1Roi Blanco, Paolo Boldi, Andrea Marino Entity-Linking via Graph-Distance Minimization. Search on Bibsonomy GRAPHITE The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Paulo 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 Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure. Search on Bibsonomy Bioinformatics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Irene Amerini, Roberto Caldelli, Pierluigi Crescenzi, Andrea Del Mastio, Andrea Marino Blind image clustering based on the Normalized Cuts criterion for camera identification. Search on Bibsonomy Sig. Proc.: Image Comm. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Andrea Marino Algorithms for biological graphs: analysis and enumeration. Search on Bibsonomy ICTCS The full citation details ... 2014 DBLP  BibTeX  RDF
1Paolo Boldi, Andrea Marino, Massimo Santini 0001, Sebastiano Vigna BUbiNG: massive crawling for the masses. Search on Bibsonomy WWW (Companion Volume) The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method. Search on Bibsonomy FUN The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Pilu Crescenzi, Roberto Grossi, Michel Habib, Leonardo Lanzi, Andrea Marino On computing the diameter of real-world undirected graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Marie-France Sagot, Paulo Vieira Milreu Telling Stories Fast. Search on Bibsonomy SEA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Sacomoto Optimal Listing of Cycles and st-Paths in Undirected Graphs. Search on Bibsonomy SODA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Etienne 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 Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Vicente 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 Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino On Computing the Diameter of Real-World Directed (Weighted) Graphs. Search on Bibsonomy SEA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ugo Scaiella, Paolo Ferragina, Andrea Marino, Massimiliano Ciaramita Topical clustering of search results. Search on Bibsonomy WSDM The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Etienne Birmelé, Pierluigi Crescenzi, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot Efficient Bubble Enumeration in Directed Graphs. Search on Bibsonomy SPIRE The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Donatella Merlini, Gianluca Rossi, Paola Vocca Smooth movement and Manhattan path based Random Waypoint mobility. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems. Search on Bibsonomy ACL The full citation details ... 2011 DBLP  BibTeX  RDF
1Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs. Search on Bibsonomy TAPAS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pierluigi Crescenzi, Roberto Grossi, Claudio Imbrenda, Leonardo Lanzi, Andrea Marino Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound. Search on Bibsonomy ESA (1) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Gianluca Rossi, Paola Vocca Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. Search on Bibsonomy SIROCCO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #55 of 55 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license