Francesco Gullo

Computational Theory and Mathematics · 2013

A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 1 researcher here, as inferred from the citation graph.

Subfields

Whom Francesco Gullo trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Moses Charikar

Who trusts Francesco Gullo overall

  1. Bryan Perozzi

Papers from Francesco Gullo's perspective

Ordered by how strongly the researchers Francesco Gullo trusts endorse each paper. Same corpus, a different order for every researcher.

  1. The Dense k -Subgraph Problem (Algorithmica)
  2. The Structure and Function of Complex Networks
  3. Massive Quasi-Clique Detection (Latin American Symposium on Theoretical Informatics)
  4. Greedy approximation algorithms for finding dense components in a graph (International Workshop on Approximation Algorithms for Combinatorial Optimization)
  5. The community-search problem and how to plan a successful cocktail party (Knowledge Discovery and Data Mining)
  6. Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique (45th Annual IEEE Symposium on Foundations of Computer Science)
  7. The Average Distance in a Random Graph with Given Expected Degrees (Internet Mathematics)
  8. The Probabilistic Method
  9. A threshold of ln n for approximating set cover (preliminary version)
  10. Reducibility Among Combinatorial Problems

Their papers