Publications

  • [P12] Crescenzi, P., D'Angelo, G., Severini, L., Velaj, Y.: Greedily Improving Our Own Centrality in a Network. Proceedings of 14th International Symposium on Experimental Algorithms, Lecture Notes in Computer Science, vol. 9125, 43-55. Springer (2015).
  • [P11] Borassi, M., Coudert, D., Crescenzi, P., Marino, A., Takes, F.W.: On Computing the Hyperbolicity of Real-World Graphs. Proceedings of 23rd Annual European Symposium on Algorithms (to appear).
  • [P10] Borassi, M., Crescenzi, P., Habib, M., Kosters, W.A., Marino, A., Takes, F.W.: 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, 586, 59-80 (2015).
  • [P9] Borassi, M., Crescenzi, P., Habib, M., Kosters, W.A., Marino, A., Takes, F.W.: On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method. Proceedings of 7th International Conference on Fun with Algorithms, Lecture Notes in Computer Science, vol. 8496, 52-63. Springer (2014).
  • [P8] Acuña, P., Birmelé, E., Cottret, L., Crescenzi, P., Jourdan, F., Lacroix, V., Marchetti-Spaccamela, A., Marino, A., Vieira Milreu, P., Sagot, M.-F., Stougie, S.: Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets. Theoretical Computer Science, 457, 1-9 (2012).
  • [P7] Vieira Milreu, P., Coimbra Klein, C., Cottret, L., Acuña, V., Birmelé, E., Borassi, M., Junot, C., Marchetti-Spaccamela, A., Marino, A., Stougie, L., Jourdan, F., Crescenzi, P., Lacroix, V., Sagot, M.-F.: Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure. Bioinformatics 30(1), 61-70 (2014).
  • [P6] Borassi, M., Crescenzi, P., Lacroix, V., Marino, A., Vieira Milreu, P., Sagot, M.-F.: Telling Stories Fast Via Linear-Time Delay Pitch Enumeration. Proceedings of 12th International Symposium on Experimental Algorithms, Lecture Notes in Computer Science, vol. 7933, 200-211. Springer (2013).
  • [P5] Crescenzi, P., Grossi, R., Habib, M., Lanzi, L., Marino, A.: On Computing the Diameter of Real-World Undirected Graphs. Theoretical Computer Science, 514, 84-95 (2013).
  • [P4] Crescenzi, P., Grossi, R., Lanzi, L., Marino, A.: On Computing the Diameter of Real-World (Weighted) Directed Graphs. Proceedings of 11th International Symposium on Experimental Algorithms. Lecture Notes in Computer Science, vol. 7276, 99-110. Springer (2012).
  • [P3] Lanzi, L.: Complex Networks: Algorithms, Analysis, and Models, Ph.D. dissertation thesis, University of Florence (2012).
  • [P2] Crescenzi, P., Grossi, R., Lanzi, L., Marino, A.: A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs. Proceedings of 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems. Lecture Notes in Computer Science, vol. 6595. Springer (2011).
  • [P1] Crescenzi, P., Grossi, R., Imbrenda, C., Lanzi, L., Marino, A.: Finding the Diameter in Real-World Graphs: Experimentally Turning a Lower Bound into an Upper Bound. Proceedings of 18th Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 6346, 302-313. Springer (2010).
TOP

Ingredients

TOP