Doerfel, S. & Jäschke, R.: An analysis of tag-recommender evaluation procedures. Proceedings of the 7th ACM conference on Recommender systems. New York, NY, USA: ACM, 2013RecSys '13 , S. 343-346
[Volltext]

Heidtmann, K.: Internet-Graphen. In: Informatik-Spektrum 36 (2013), Nr. 5, S. 440-448
[Volltext]

Landia, N.; Doerfel, S.; Jäschke, R.; Anand, S. S.; Hotho, A. & Griffiths, N.: Deeper Into the Folksonomy Graph: FolkRank Adaptations and Extensions for Improved Tag Recommendations. In: cs.IR 1310.1498 (2013),
[Volltext]

Ghosh, R. & Lerman, K.: Structure of Heterogeneous Networks. , 2009
[Volltext]

Noack, A.: Modularity clustering is force-directed layout. , 2008
[Volltext]

Zhu, F.; Chen, C.; Yan, X.; Han, J. & Yu, P. S.: Graph OLAP: Towards Online Analytical Processing on Graphs. Proc. 2008 Int. Conf. on Data Mining (ICDM'08), Pisa, Italy, Dec. 2008.. 2008

Hotho, A.; Jäschke, R.; Schmitz, C. & Stumme, G.: Information Retrieval in Folksonomies: Search and Ranking. Proceedings of the 3rd European Semantic Web Conference. Springer, 2006Lecture Notes in Computer Science , S. 411-426

Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G.: Content Aggregation on Knowledge Bases using Graph Clustering. In: Sure, Y. & Domingue, J. (Hrsg.): The Semantic Web: Research and Applications. Heidelberg: Springer, 2006 (LNAI 4011), S. 530-544
[Volltext]

This paper provides a graph clustering technique on
knowledge bases for that purpose. Using this clustering, we can show
that our strategy requires up to 58% fewer queries than the
baselines to yield full recall in a bibliographic P2PKM scenario.

Brandes, U. & Willhalm, T.: Visualization of bibliographic networks with a reshaped landscape metaphor. Proceedings of the symposium on Data Visualisation 2002. Aire-la-Ville, Switzerland, Switzerland: Eurographics Association, 2002VISSYM '02 , S. 159-ff
[Volltext]

Eklund, P.; Groh, B.; Stumme, G. & Wille, R.: Contextual-Logic Extension of TOSCANA.. In: Ganter, B. & Mineau, G. W. (Hrsg.): Conceptual Structures: Logical, Linguistic, and Computational. Heidelberg: Springer, 2000 (LNAI 1867), S. 453-467
[Volltext]

Prediger, S. & Wille, R.: The Lattice of Concept Graphs of a Relationally Scaled Context. In: Tepfenhart, W. M. & Cyre, W. R. (Hrsg.): ICCS. Springer, 1999 (Lecture Notes in Computer Science 1640), S. 401-414
[Volltext]

Wille, R.: Conceptual Graphs and Formal Concept Analysis. In: Lukose, D.; Delugach, H.; Keeler, M.; Searle, L. & Sowa, J. F. (Hrsg.): Conceptual Structures: Fulfilling Peirce's Dream. Heidelberg: Springer, 1997 (Lecture Notes in Artificial Intelligence 1257), S. 290-303

Stumme, G. & Wille, R.: A Geometrical Heuristic for Drawing Concept Lattices. In: Tamassia, R. & Tollis, I. (Hrsg.): Graph Drawing. Heidelberg: Springer, 1995 (LNCS 894), S. 452-459
[Volltext]