I am Michele Borassi, and I am attending a PhD course in Computer Science at IMT.
I graduated in Mathematics on April 21, 2013 in Pisa University with a Master Thesis presenting an enumeration algorithm of particular subgraphs.
My non-academic interests include Othello, athletics and Nineteenth Century European Dance of Society.
For more information, see my personal web page.
Research Interests
Publications
MICHELE BORASSI, PIERLUIGI CRESCENZI, and MICHEL HABIB.
Quadratic Lower Bounds on the Complexity of Betweeness, Closeness, and Hyperbolicity
A Collection of Old and Original Results
9th International Conference on Algorithms and Complexity, 2014
Submitted.
MICHELE BORASSI, PIERLUIGI CRESCENZI, MICHEL HABIB, WALTER KOSTERS, ANDREA MARINO, and FRANK TAKES.
Fast Diameter and Radius BFS-based Computation in (Weakly Connected) Real-World Graphs
With an Application to the Six Degrees of Kevin Bacon Game
Theoretical Computer Science, Special Issue - Fun With Algorithms, 2014
Submitted.
MICHELE BORASSI, PIERLUIGI CRESCENZI, MICHEL HABIB, WALTER KOSTERS, ANDREA MARINO, and FRANK TAKES.
On the Solvability of the Six Degree of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method.
In Proceedings of the Seventh International Conference on Fun with Algorithms, 2014.
PAULO 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
Bioinformatics, 2014, Oxford University Press.
MICHELE BORASSI, PIERLUIGI CRESCENZI, VINCENT LACROIX, ANDREA MARINO, MARIE-FRANCE SAGOT, PAULO VIEIRA MILREU
Telling Stories Fast via Linear-Time Delay Pitch Enumeration
In Proceedings of 12th International Symposium on Experimental Algorithms, 2013
Springer Berlin Heidelberg.