R. Barzilay and K. R. Mckeown, Sentence fusion for multidocument news summarization, pp.297-328, 2005.

D. M. Blei, A. Y. Ng, and M. I. Jordan, Latent dirichlet allocation, Journal Machine Learning Research, issue.3, pp.993-1022, 2003.

F. Boudin and E. Morin, Keyphrase extraction for n-best reranking in multi-sentence compression, Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp.298-305, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00816353

K. Filippova, Multi-sentence compression: Finding shortest paths in word graphs, COLING, pp.322-330, 2010.

J. K. Lenstra, A. R. Kan, E. L. Lawler, and D. Shmoys, The traveling salesman problem: a guided tour of combinatorial optimization, 1985.

C. Lin, ROUGE: A package for automatic evaluation of summaries, ACL workshop on Text Summarization Branches Out, 2004.

E. Linhares-pontes, A. C. Linhares, and J. Torres-moreno, Sasi: sumarizador automático de documentos baseado no problema do subconjunto independente de vértices. Anais do Simpósio Brasileiro de Pesquisa Operacional, 2014.

E. Linhares-pontes, A. C. Linhares, and J. Torres-moreno, Lia-rag: a system based on graphs and divergence of probabilities applied to speech-to-text summarization. CCCS (Call Centre Conversation Summarization) Multiling, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01779304

R. Mihalcea, P. Tarau, T. Textrank-;-¨-oncan, ?. I. Alt?nel, and G. Laporte, A comparative analysis of several asymmetric traveling salesman problem formulations, Proceedings of EMNLP04and the 2004 Conference on Empirical Methods in Natural Language Processing, pp.637-654, 2004.

G. Pataki, Teaching integer programming formulations using the traveling salesman problem. SIAM review, v. 45, pp.116-123, 2003.

J. Torres-moreno, Automatic Text Summarization, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01473135