Fun with FUN

Authors Fabien Mathieu, Sébastien Tixeuil

Thumbnail PDF


  • Filesize: 0.74 MB
  • 13 pages

Document Identifiers

Author Details

Fabien Mathieu
  • Swapcard, Paris, France
Sébastien Tixeuil
  • Sorbonne Université, CNRS, LIP6, Paris, France


This work was done at LINCS (

Cite AsGet BibTex

Fabien Mathieu and Sébastien Tixeuil. Fun with FUN. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 21:1-21:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


The notions of scientific community and research field are central elements for researchers and the articles they publish. We propose to explore the evolution of the FUN conference community since its creation from the articles listed in DBLP, authors, program committees, and advertised themes, by means of a novel symmetric embedding, and carefully crafted software tools. Our results make it possible on the one hand to better understand the evolution of the community, and on the other hand to easily integrate new themes or researchers during future editions.

Subject Classification

ACM Subject Classification
  • Information systems → Similarity measures
  • Information systems → Information extraction
  • Natural Language Processing
  • Relevance Propagation
  • Bibliometry
  • Community
  • Scientific Fields


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. A. Aizawa. An information-theoretic perspective of TF-IDF measures. Info. Proc. & Manag., 39(1):45-65, 2003. URL:
  2. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst., 30(1-7):107-117, 1998. URL:
  3. Graham Cormode, S. Muthukrishnan, and Jinyun Yan. Scienceography: The study of how science is written. In Evangelos Kranakis, Danny Krizanc, and Flaminia L. Luccio, editors, Fun with Algorithms - 6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012. Proceedings, volume 7288 of Lecture Notes in Computer Science, pages 379-391. Springer, 2012. URL:
  4. Bruno Gaume and Fabien Mathieu. PageRank Induced Topology for Real-World Networks. working paper or preprint, May 2016. URL:
  5. D. Hong, T. D. Huynh, and F. Mathieu. D-Iteration: diffusion approach for solving PageRank. CoRR, abs/1501.06350, 2015. URL:
  6. John H. Marburger III, Julia I. Lane, Stephanie S. Shipp, and Kaye Husbands Fealing, editors. The Science of Science Policy: A Handbook. Stanford University Press, 2011. URL:
  7. Michael Kuhn and Roger Wattenhofer. The theoretic center of computer science. SIGACT News, 38(4):54-63, 2007. URL:
  8. Fabien Mathieu. Generic Information Search with a Mind of its Own (Gismo). URL:
  9. J. Otterbacher, G. Erkan, and D. Radev. Using random walks for question-focused sentence retrieval. In HLT/EMNLP, pages 915-922, 2005. URL:
  10. F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay. Scikit-learn: Machine learning in Python. Journal of Machine Learning Research, 12:2825-2830, 2011. Google Scholar
  11. Martin Rosvall and Carl T. Bergstrom. Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences, 105(4):1118-1123, 2008. URL:
  12. Dashun Wang and Albert-László Barabási. The Science of Science. Cambridge University Press, 2021. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail