diff --git a/README.md b/README.md
index 8a5c9907d0fe58732ae8c227e08aeb0dd4b8e47e..6bff00acecd9428dd9da7db62f7e105ec7517d80 100644
--- a/README.md
+++ b/README.md
@@ -62,7 +62,9 @@ $ python3 absinth.py -t
 ## References
 
 Di Marco, Antonio and Navigli, Roberto (2013). Clustering and Diversifying Web Search Results with Graph-Based Word Sense Induction. Computational Linguistics, 39(3). doi:10.1162/COLI_a_00148
+
 Kruskal, J. (1956). On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proceedings of the American Mathematical Society, 7(1), 48-50. doi:10.2307/2033241
+
 Véronis, Jean. (2004). HyperLex: Lexical cartography for information retrieval. Computer Speech & Language. doi:10.1016/j.csl.2004.05.002
 
 ## Authors