DIN 1505-2

Thomas, Josephine, Moallemy-Oureh, Alice, Beddar-Wiesing, Silvia, Holzhüter, Clara, Graph Neural Networks Designed for Different Graph Types: A Survey, in: Transactions on Machine Learning Research (2023).

Krompass, Denis, Nickel, Maximilian, Tresp, Volker: Large-scale factorization of type-constrained multi-relational data. In: International Conference on Data Science and Advanced Analytics, {DSAA} 2014, Shanghai, China, October 30 - November 1, 2014 : {IEEE}, 2014. - ISBN 978-1-4799-6991-3, S. 18--24

Doerfel, Stephan, Jäschke, Robert: An analysis of tag-recommender evaluation procedures. In: Proceedings of the 7th ACM conference on Recommender systems. New York, NY, USA : ACM, 2013 (RecSys '13). - ISBN 978-1-4503-2409-0, S. 343--346

Heidtmann, Klaus, Internet-Graphen, in: Informatik-Spektrum 36 5 (2013), S. 440-448.

Landia, Nikolas, Doerfel, Stephan, Jäschke, Robert, Anand, Sarabjot Singh, Hotho, Andreas, Griffiths, Nathan, Deeper Into the Folksonomy Graph: FolkRank Adaptations and Extensions for Improved Tag Recommendations, in: cs.IR 1310.1498 (2013).

Liu, Xiaozhong, Zhang, Jinsong, Guo, Chun, Full-Text Citation Analysis: A New Method to Enhance Scholarly Network, in: Journal of the American Society for Information Science and Technology (2012).

Pereira Nunes, Bernardo, Kawase, Ricardo, Dietze, Stefan, Taibi, Davide, Casanova, Marco Antonio, Nejdl, Wolfgang ; Rizzo, Giuseppe, Mendes, Pablo, Charton, Eric, Hellmann, Sebastian, Kalyanpur, Aditya: Can Entities be Friends?. 906. In: Proceedings of the Web of Linked Entities Workshop in conjuction with the 11th International Semantic Web Conference, 2012 (CEUR-WS.org), S. 45--57

Batagelj, Vladimir, Zaveršnik, Matjaž, Fast algorithms for determining (generalized) core groups in social networks, in: Advances in Data Analysis and Classification 5 2 (2011), S. 129-145.

Ugander, Johan, Karrer, Brian, Backstrom, Lars, Marlow, Cameron, Rezension zu: The Anatomy of the Facebook Social Graph (2011).

Chakrabarti, Soumen, Pathak, Amit, Gupta, Manish, Index design and query processing for graph conductance search, in: The VLDB Journal (2010), S. 1-26.

Isella, Lorenzo, Stehlé, Juliette, Barrat, Alain, Cattuto, Ciro, Pinton, Jean-François, den Broeck, Wouter Van, What's in a crowd? Analysis of face-to-face behavioral networks, in: CoRR abs/1006.1260 (2010).

Mitzlaff, Folke, Benz, Dominik, Stumme, Gerd, Hotho, Andreas: Visit me, click me, be my friend: An analysis of evidence networks of user relationships in Bibsonomy. In: Proceedings of the 21st ACM conference on Hypertext and hypermedia. Toronto, Canada, 2010. - (to appear)

Akoglu, Leman, Faloutsos, Christos ; Buntine, Wray L., Grobelnik, Marko, Mladenic, Dunja, Shawe-Taylor, John: RTG: A Recursive Realistic Graph Generator Using Random Typing.. 5781. In: ECML/PKDD (1) : Springer, 2009 (Lecture Notes in Computer Science). - ISBN 978-3-642-04179-2, S. 13-28

Berlingerio, Michele, Bonchi, Francesco, Bringmann, Björn, Gionis, Aristides ; Buntine, Wray L., Grobelnik, Marko, Mladenic, Dunja, Shawe-Taylor, John: Mining Graph Evolution Rules.. 5781. In: ECML/PKDD (1) : Springer, 2009 (Lecture Notes in Computer Science). - ISBN 978-3-642-04179-2, S. 115-130

Fürnkranz, Johannes, Hüllermeier, Eyke, Vanderlooy, Stijn, Binary Decomposition Methods for Multipartite Ranking, in: Machine Learning and Knowledge Discovery in Databases (2009), S. 359--374.

Gansner, Emden R., Hu, Yifan, Kobourov, Stephen G., {GMap}: Drawing Graphs as Maps, in: cs.CG arXiv:0907.2585v1 (2009).

Ghosh, Rumi, Lerman, Kristina, Rezension zu: Structure of Heterogeneous Networks (2009).

Maes, Francis, Peters, Stéphane, Denoyer, Ludovic, Gallinari, Patrick ; Buntine, Wray L., Grobelnik, Marko, Mladenic, Dunja, Shawe-Taylor, John: Simulated Iterative Classification A New Learning Procedure for Graph Labeling.. 5782. In: ECML/PKDD (2) : Springer, 2009 (Lecture Notes in Computer Science). - ISBN 978-3-642-04173-0, S. 47-62

Murata, Tsuyoshi: Modularities for Bipartite Networks. In: HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia. New York, NY, USA : ACM, 2009

Butler, S.K.: {Eigenvalues and Structures of Graphs}. University of California, San Diego, 2008

Filippone, M., Camastra, F., Masulli, F., Rovetta, S., {A survey of kernel and spectral methods for clustering}, in: Pattern recognition 41 1 (2008), S. 176--190.

Jackson, Matthew, Average Distance, Diameter, and Clustering in Social Networks with Homophily, in: Internet and Network Economics (2008), S. 4--11.

Nicosia, V., Mangioni, G., Carchiolo, V., Malgeri, M., Rezension zu: Extending the definition of modularity to directed graphs with overlapping communities (2008).

Symeonidis, Panagiotis, Nanopoulos, Alexandros, Manolopoulos, Yannis: Tag recommendations based on tensor dimensionality reduction. In: RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems. New York, NY, USA : ACM, 2008. - ISBN 978-1-60558-093-7, S. 43--50

Baur, Michael, Gaertler, Marco, Görke, Robert, Krug, Marcus, Wagner, Dorothea: Generating Graphs with Predefined k-Core Structure. In: Proceedings of the European Conference of Complex Systems, 2007

Brandes, Ulrik, Delling, Daniel, Gaertler, Marco, Görke, Robert, Hoefer, Martin, Nikoloski, Zoran, Wagner, Dorothea, On Finding Graph Clusterings with Maximum Modularity, in: Brandstädt, Andreas, Kratsch, Dieter, Müller, Haiko (Hrsg.), Graph-Theoretic Concepts in Computer Science, Bd. 4769, Berlin / Heidelberg 2007, S. 121-132.

Luxburg, Ulrike, A tutorial on spectral clustering, in: Statistics and Computing 17 4 (2007), S. 395--416.

Schaeffer, S.E., {Graph clustering}, in: Computer Science Review 1 1 (2007), S. 27--64.

Spielman, D.A., Spectral Graph Theory and its Applications, in: Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on (2007), S. 29-38.

Zesch, Torsten, Gurevych, Iryna: Analysis of the Wikipedia Category Graph for NLP Applications. In: Proceedings of the TextGraphs-2 Workshop (NAACL-HLT). Rochester : Association for Computational Linguistics, 2007, S. 1--8

Butler, Steve: Spectral Graph Theory: Applications of Courant Fischer, 2006. -

Butler, Steve: Spectral Graph Theory: Cheeger constants and discrepancy, 2006. -

Cantador, I., Castells, P., {Building Emergent Social Networks and Group Profiles by Semantic User Preference Clustering} (2006).

Hotho, Andreas, Jäschke, Robert, Schmitz, Christoph, Stumme, Gerd ; Sure, York, Domingue, John: Information Retrieval in Folksonomies: Search and Ranking. 4011. In: The Semantic Web: Research and Applications. Heidelberg : Springer, 2006 (Lecture Notes in Computer Science), S. 411-426

Newman, M. E. J., Modularity and community structure in networks, in: Proceedings of the National Academy of Sciences 103 23 (2006), S. 8577--8582.

Newman, MEJ, {Finding community structure in networks using the eigenvectors of matrices}, in: Physical Review E 74 3 (2006), S. 36104.

Newman, MEJ, {Modularity and community structure in networks}, in: Proceedings of the National Academy of Sciences 103 23 (2006), S. 8577--8582.

Schmitz, Christoph, Hotho, Andreas, Jäschke, Robert, Stumme, Gerd ; Sure, York, Domingue, John: Content Aggregation on Knowledge Bases using Graph Clustering. 4011. In: The Semantic Web: Research and Applications. Heidelberg : Springer, 2006 (LNAI), S. 530-544

Dhillon, Inderjit S. ; Guan, Yuqiang ; Kulis, Brian ; University of Texas Dept. of Computer Science (Hrsg.): A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts. TR-04-25, 2005

Dias, Vânia M.F., de Figueiredo, Celina M.H., Szwarcfiter, Jayme L., Generating bicliques of a graph in lexicographic order, in: Theoretical Computer Science 337 1-3 (2005), S. 240 - 248.

Lerner, Jürgen, Role Assignments, in: Brandes, Ulrik, Erlebach, Thomas (Hrsg.), Network Analysis, Bd. 3418, Berlin / Heidelberg 2005, S. 216-252.

White, S., Smyth, P., {A spectral clustering approach to finding communities in graph} (2005).

An, Yuan, Janssen, Jeannette, Milios, Evangelos E., Characterizing and Mining the Citation Graph of the Computer Science Literature, in: Knowl. Inf. Syst. 6 (2004), S. 664--678.

Bollobás*, Béla, Riordan, Oliver, The Diameter of a Scale-Free Random Graph, in: Combinatorica 24 1 (2004), S. 5--34.

Drineas, P., Frieze, A., Kannan, R., Vempala, S., Vinay, V., {Clustering large graphs via the singular value decomposition}, in: Machine Learning 56 1 (2004), S. 9--33.

Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K., {Graph clustering and minimum cut trees}, in: Internet Mathematics 1 4 (2004), S. 385--408.

Langville, A.N., Meyer, C.D., {Deeper inside pagerank}, in: Internet Mathematics 1 3 (2004), S. 335--380.

Batagelj, V., Zaversnik, M., Rezension zu: An O(m) Algorithm for Cores Decomposition of Networks (2003).

Brandes, U., Gaertler, M., Wagner, D., {Experiments on graph clustering algorithms}, in: Lecture notes in computer science (2003), S. 568--579.

Estrada, E., Rodriguez-Velázquez, J.A., {Spectral measures of bipartivity in complex networks}, in: SIAM Rev Phys Rev E 72 (2003), S. 046105.

Haveliwala, T.H., Kamvar, S.D., {The second eigenvalue of the Google matrix}, in: A Stanford University Technical Report http://dbpubs. stanford. edu (2003).

Newman, M. E. J., The structure and function of complex networks, in: SIAM Review 45 2 (2003), S. 167-256.

Verma, D., Meila, M., {A comparison of spectral clustering algorithms}, in: University of Washington, Tech. Rep. UW-CSE-03-05-01 (2003).

Yu, Stella X., Shi, Jianbo: Multiclass Spectral Clustering. In: Proc. International Conference on Computer Vision (ICCV 03). Nice, France, 2003

Brandes, U., Willhalm, T.: Visualization of bibliographic networks with a reshaped landscape metaphor. In: Proceedings of the symposium on Data Visualisation 2002. Aire-la-Ville, Switzerland, Switzerland : Eurographics Association, 2002 (VISSYM '02). - ISBN 1-58113-536-X, S. 159--ff

Snijders, T.A.B., {Markov chain Monte Carlo estimation of exponential random graph models}, in: Journal of Social Structure 3 2 (2002), S. 1--40.

Soderberg, B., {General formalism for inhomogeneous random graphs}, in: Phys. Rev. E 66 6 (2002), S. 066121.

Dhillon, Inderjit S.: Co-clustering documents and words using bipartite spectral graph partitioning. In: KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining. New York, NY, USA : ACM Press, 2001. - ISBN 158113391X, S. 269--274

Monien, B., Rezension zu: On Spectral Bounds for the k-Partitioning of Graphs (2001).

Newman, MEJ, Strogatz, SH, Watts, DJ, {Random graphs with arbitrary degree distributions and their applications}, in: Arxiv preprint cond-mat/0007235 (2001).

Ng, Andrew Y., Jordan, Michael I., Weiss, Yair: On spectral clustering: Analysis and an algorithm. In: Advances in Neural Information Processing Systems 14 : MIT Press, 2001, S. 849--856

Aiello, W., Chung, F., Lu, L., {A random graph model for massive graphs} (2000), S. 171--180.

Butler, S., {Cospectral graphs for both the adjacency and normalized Laplacian matrices} (2000).

Gansner, Emden R., North, Stephen C., An open graph visualization system and its applications to software engineering, in: Software Practice \& Experience 30 11 (2000), S. 1203--1233.

Janson, Svante, Luczak, Tomasz, Rucinski, Andrzej Theory of random graphs, New York; Chichester 2000.

Anderson, C.J., Wasserman, S., Crouch, B., {A p* primer: Logit models for social networks}, in: Social Networks 21 1 (1999), S. 37--66.

Barabasi, A. L., Albert, R., Emergence of scaling in random networks, in: Science 286 5439 (1999), S. 509--512.

Batagelj, Vladimir, Mrvar, Andrej, Zaveršnik, Matjaž, Partitioning Approach to Visualization of Large Graphs, in: Kratochvíyl, Jan (Hrsg.), Graph Drawing, Bd. 1731, Berlin / Heidelberg 1999, S. 90-97.

Brin, Sergey, Page, Lawrence: The Anatomy of a Large-Scale Hypertextual Web Search Engine. In: Computer Networks and ISDN Systems, 1998, S. 107--117

Guattery, S., Miller, G.L., {On the quality of spectral separators}, in: SIAM Journal on Matrix Analysis and Applications 19 3 (1998), S. 701--719.

Karypis, George, Kumar, Vipin: Multilevel k-way Hypergraph Partitioning. In: In Proceedings of the Design and Automation Conference, 1998, S. 343--348

Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S., {Multilevel hypergraph partitioning: Application in VLSI domain} (1997), S. 526--529.

Mohar, B., {Some applications of Laplace eigenvalues of graphs}, in: Graph Symmetry: Algebraic Methods and Applications 497 (1997), S. 227--275.

Spielman, Daniel A. ; Teng, Shang ; (Hrsg.): Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. Berkeley, CA, USA, 1996

Alpert, Charles J., Kahng, Andrew B., zen Yao, So: Spectral partitioning: The more eigenvectors, the better. In: Proc. ACM/IEEE Design Automation Conf, 1995, S. 195--200

Molloy, M., Reed, B., Rezension zu: A critical point for random graphs with a given degree sequence, in: Random Structures & Algorithms (1995), S. 161-179.

Bolla, Marianna, Tusnády, Gábor, Spectra and optimal partitions of weighted graphs, in: Discrete Math. 128 1-3 (1994), S. 1--20.

Chan, Pak K., Schlag, Martine D. F., Zien, Jason Y., Spectral K-way ratio-cut partitioning and clustering., in: IEEE Trans. on CAD of Integrated Circuits and Systems 13 9 (1994), S. 1088-1096.

Hagen, Lars W., Kahng, Andrew B., New spectral methods for ratio cut partitioning and clustering., in: IEEE Trans. on CAD of Integrated Circuits and Systems 11 9 (1992), S. 1074-1085.

Mohar, B., {The Laplacian spectrum of graphs}, in: Graph Theory, Combinatorics, and Applications 2 (1991), S. 871--898.

Pothen, A., Simon, H.D., Liou, K.P., {Partitioning Sparse Matrices with Eigenvectors of Graphs}, in: SIAM J. MATRIX ANAL. APPLIC. 11 3 (1990), S. 430--452.

Frank, O., {Random sampling and social networks: a survey of various approaches}, in: Math. Sci. Humaines 104 (1988), S. 19--33.

Johnson, David S., Papadimitriou, Christos H., On generating all maximal independent sets, in: Inf. Process. Lett. 27 3 (1988), S. 119--123.

Seidman, Stephen B., Network structure and minimum degree, in: Social Networks 5 3 (1983), S. 269 - 287.

Karonski, M., {A review of random graphs}, in: Journal of Graph Theory 6 4 (1982).

Bollobas, B., {The diameter of random graphs}, in: Transactions of the American Mathematical Society (1981), S. 41--52.

Freeman, Linton C., A Set of Measures of Centrality Based on Betweenness, in: Sociometry 40 1 (1977), S. 35--41.

Fiedler, M., {A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory}, in: Czechoslovak Mathematical Journal 25 100 (1975), S. 619--633.

Donath, W.E., Hoffman, A.J., {Lower bounds for the partitioning of graphs}, in: IBM Journal of Research and Development 17 5 (1973), S. 420--425.