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

Krompass, Denis and Nickel, Maximilian and Tresp, Volker. Large-scale factorization of type-constrained multi-relational data. International Conference on Data Science and Advanced Analytics, DSAA 2014, Shanghai, China, October 30 - November 1, 2014. 18--24, IEEE, Year 2014.

Doerfel, Stephan and Jäschke, Robert. An analysis of tag-recommender evaluation procedures. Proceedings of the 7th ACM conference on Recommender systems. RecSys '13, 343--346, ACM, New York, NY, USA, Year 2013.

Heidtmann, Klaus. Internet-Graphen. In Informatik-Spektrum, (36) 5: 440-448, Springer Berlin Heidelberg, Year 2013.

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

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

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

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

Ugander, Johan and Karrer, Brian and Backstrom, Lars and Marlow, Cameron. The Anatomy of the Facebook Social Graph. Year 2011.

Chakrabarti, Soumen and Pathak, Amit and Gupta, Manish. Index design and query processing for graph conductance search. In The VLDB Journal, 1-26, Springer, Berlin / Heidelberg, Year 2010.

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

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

Akoglu, Leman and Faloutsos, Christos. RTG: A Recursive Realistic Graph Generator Using Random Typing.. ECML/PKDD (1). editor(s) Buntine, Wray L. and Grobelnik, Marko and Mladenic, Dunja and Shawe-Taylor, John. Lecture Notes in Computer Science, (5781) 13-28, Springer, Year 2009.

Berlingerio, Michele and Bonchi, Francesco and Bringmann, Björn and Gionis, Aristides. Mining Graph Evolution Rules.. ECML/PKDD (1). editor(s) Buntine, Wray L. and Grobelnik, Marko and Mladenic, Dunja and Shawe-Taylor, John. Lecture Notes in Computer Science, (5781) 115-130, Springer, Year 2009.

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

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

Ghosh, Rumi and Lerman, Kristina. Structure of Heterogeneous Networks. Year 2009.

Maes, Francis and Peters, Stéphane and Denoyer, Ludovic and Gallinari, Patrick. Simulated Iterative Classification A New Learning Procedure for Graph Labeling.. ECML/PKDD (2). editor(s) Buntine, Wray L. and Grobelnik, Marko and Mladenic, Dunja and Shawe-Taylor, John. Lecture Notes in Computer Science, (5782) 47-62, Springer, Year 2009.

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

Butler, S.K.. Eigenvalues and Structures of Graphs. Year 2008.

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

Jackson, Matthew. Average Distance, Diameter, and Clustering in Social Networks with Homophily. In Internet and Network Economics, 4--11, Year 2008.

Nicosia, V. and Mangioni, G. and Carchiolo, V. and Malgeri, M.. Extending the definition of modularity to directed graphs with
overlapping communities. Year 2008.

Symeonidis, Panagiotis and Nanopoulos, Alexandros and Manolopoulos, Yannis. Tag recommendations based on tensor dimensionality reduction. RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems. 43--50, ACM, New York, NY, USA, Year 2008.

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

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

Luxburg, Ulrike. A tutorial on spectral clustering. In Statistics and Computing, (17) 4: 395--416, Kluwer Academic Publishers, Hingham, MA, USA, Year 2007.

Schaeffer, S.E.. Graph clustering. In Computer Science Review, (1) 1: 27--64, Elsevier, Year 2007.

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

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

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

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

Butler, Steve. Spectral Graph Theory: Three common spectra. Year 2006.

Cantador, I. and Castells, P.. Building Emergent Social Networks and Group Profiles by Semantic User Preference Clustering. Year 2006.

Frivolt, G. and Pok, O.. Comparison of Graph Clustering Approaches. Year 2006.

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

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

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

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

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

Dhillon, Inderjit S. and Guan, Yuqiang and Kulis, Brian. A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts. TR-04-25: Year 2005.

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

Diestel, Reinhard. Graph Theory. I-XVI, 1-344, Springer-Verlag Heidelberg, New York, Year 2005.

Lerner, Jürgen. Role Assignments. Network Analysis. editor(s) Brandes, Ulrik and Erlebach, Thomas. Lecture Notes in Computer Science, (3418) 216-252, Springer, Berlin / Heidelberg, Year 2005.

White, S. and Smyth, P.. A spectral clustering approach to finding communities in graph. SIAM Data Mining. Year 2005.

An, Yuan and Janssen, Jeannette and Milios, Evangelos E.. Characterizing and Mining the Citation Graph of the Computer Science Literature. In Knowl. Inf. Syst., (6) 664--678, Springer-Verlag New York, Inc., New York, NY, USA, Year 2004.

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

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

Flake, G.W. and Tarjan, R.E. and Tsioutsiouliklis, K.. Graph clustering and minimum cut trees. In Internet Mathematics, (1) 4: 385--408, AK Peters, Year 2004.

Langville, A.N. and Meyer, C.D.. Deeper inside pagerank. In Internet Mathematics, (1) 3: 335--380, AK Peters, Year 2004.

Batagelj, V. and Zaversnik, M.. An O(m) Algorithm for Cores Decomposition of Networks. Year 2003.

Brandes, U. and Gaertler, M. and Wagner, D.. Experiments on graph clustering algorithms. In Lecture notes in computer science, 568--579, Springer, Year 2003.

Estrada, E. and Rodriguez-Velázquez, J.A.. Spectral measures of bipartivity in complex networks. In SIAM Rev Phys Rev E, (72) 046105, APS, Year 2003.

Haveliwala, T.H. and Kamvar, S.D.. The second eigenvalue of the Google matrix. In A Stanford University Technical Report http://dbpubs. stanford. edu, Year 2003.

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

Verma, D. and Meila, M.. A comparison of spectral clustering algorithms. In University of Washington, Tech. Rep. UW-CSE-03-05-01, Year 2003.

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

Blelloch, Guy. Graph Separators. Year 2002.

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

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

Soderberg, B.. General formalism for inhomogeneous random graphs. In Phys. Rev. E, (66) 6: 066121, APS, Year 2002.

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

Monien, B.. On Spectral Bounds for the k-Partitioning of Graphs. Year 2001.

Newman, MEJ and Strogatz, SH and Watts, DJ. Random graphs with arbitrary degree distributions and their applications. In Arxiv preprint cond-mat/0007235, Year 2001.

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

Aiello, W. and Chung, F. and Lu, L.. A random graph model for massive graphs. Proceedings of the thirty-second annual ACM symposium on Theory of computing. 171--180, Year 2000.

Butler, S.. Cospectral graphs for both the adjacency and normalized Laplacian matrices. Year 2000.

Gansner, Emden R. and North, Stephen C.. An open graph visualization system and its applications to software engineering. In Software Practice & Experience, (30) 11: 1203--1233, John Wiley & Sons, Inc., New York, NY, USA, Year 2000.

Janson, Svante and Luczak, Tomasz and Rucinski, Andrzej. Theory of random graphs. John Wiley & Sons, New York; Chichester, Year 2000.

Ranade, A.G.. Some uses of spectral methods. Year 2000.

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

Barabasi, A. L. and Albert, R.. Emergence of scaling in random networks. In Science, (286) 5439: 509--512, Department of Physics, University of Notre Dame, Notre Dame, IN 46556, USA., Year 1999.

Batagelj, Vladimir and Mrvar, Andrej and Zaveršnik, Matjaž. Partitioning Approach to Visualization of Large Graphs. Graph Drawing. editor(s) Kratochvíyl, Jan. Lecture Notes in Computer Science, (1731) 90-97, Springer, Berlin / Heidelberg, Year 1999.

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

Guattery, S. and Miller, G.L.. On the quality of spectral separators. In SIAM Journal on Matrix Analysis and Applications, (19) 3: 701--719, [Philadelphia, Pa.: The Society, c1988-, Year 1998.

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

Chung, F. R. K.. Spectral Graph Theory. American Mathematical Society, Year 1997.

Karypis, G. and Aggarwal, R. and Kumar, V. and Shekhar, S.. Multilevel hypergraph partitioning: Application in VLSI domain. Proceedings of the 34th annual conference on Design automation. 526--529, Year 1997.

Mohar, B.. Some applications of Laplace eigenvalues of graphs. In Graph Symmetry: Algebraic Methods and Applications, (497) 227--275, Kluwer, Year 1997.

Spielman, Daniel A. and Teng, Shang. Spectral Partitioning Works: Planar Graphs and Finite Element Meshes. University of California at Berkeley, Berkeley, CA, USA, Year 1996.

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

Molloy, M. and Reed, B.. A critical point for random graphs with a given degree sequence. In Random Structures & Algorithms, (6) 161-179, Year 1995.

Bolla, Marianna and Tusnády, Gábor. Spectra and optimal partitions of weighted graphs. In Discrete Math., (128) 1-3: 1--20, Elsevier Science Publishers B. V., Amsterdam, The Netherlands, The Netherlands, Year 1994.

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

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

Mohar, B.. The Laplacian spectrum of graphs. In Graph Theory, Combinatorics, and Applications, (2) 871--898, New York: Wiley, Year 1991.

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

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

Johnson, David S. and Papadimitriou, Christos H.. On generating all maximal independent sets. In Inf. Process. Lett., (27) 3: 119--123, Elsevier North-Holland, Inc., Amsterdam, The Netherlands, The Netherlands, Year 1988.

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

Karonski, M.. A review of random graphs. In Journal of Graph Theory, (6) 4: Wiley Subscription Services, Inc., A Wiley Company New York, Year 1982.

Bollobas, B.. The diameter of random graphs. In Transactions of the American Mathematical Society, 41--52, American Mathematical Society, Year 1981.

Freeman, Linton C.. A Set of Measures of Centrality Based on Betweenness. In Sociometry, (40) 1: 35--41, American Sociological Association, Year 1977.

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

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