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

Krompass, Denis, Nickel, Maximilian and Tresp, Volker. "Large-scale factorization of type-constrained multi-relational data." Paper presented at the meeting of the International Conference on Data Science and Advanced Analytics, DSAA 2014, Shanghai, China, October 30 - November 1, 2014, 2014.

Doerfel, Stephan and Jäschke, Robert. "An analysis of tag-recommender evaluation procedures." Paper presented at the meeting of the Proceedings of the 7th ACM conference on Recommender systems, New York, NY, USA, 2013.

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

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

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

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

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

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

Pereira Nunes, Bernardo, Kawase, Ricardo, Dietze, Stefan, Taibi, Davide, Casanova, Marco Antonio and Nejdl, Wolfgang. "Can Entities be Friends?." Paper presented at the meeting of the Proceedings of the Web of Linked Entities Workshop in conjuction with the 11th International Semantic Web Conference, 2012.

Pereira Nunes, Bernardo, Kawase, Ricardo, Dietze, Stefan, Taibi, Davide, Casanova, Marco Antonio and Nejdl, Wolfgang. "Can Entities be Friends?." Paper presented at the meeting of the Proceedings of the Web of Linked Entities Workshop in conjuction with the 11th International Semantic Web Conference, 2012.

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

Ugander, Johan, Karrer, Brian, Backstrom, Lars and Marlow, Cameron The Anatomy of the Facebook Social Graph. (2011). , cite arxiv:1111.4503Comment: 17 pages, 9 figures, 1 table .

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

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

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

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

Akoglu, Leman and Faloutsos, Christos. "RTG: A Recursive Realistic Graph Generator Using Random Typing.." Paper presented at the meeting of the ECML/PKDD (1), 2009.

Berlingerio, Michele, Bonchi, Francesco, Bringmann, Björn and Gionis, Aristides. "Mining Graph Evolution Rules.." Paper presented at the meeting of the ECML/PKDD (1), 2009.

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

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

Ghosh, Rumi and Lerman, Kristina Structure of Heterogeneous Networks. (2009). , cite arxiv:0906.2212 .

Maes, Francis, Peters, Stéphane, Denoyer, Ludovic and Gallinari, Patrick. "Simulated Iterative Classification A New Learning Procedure for Graph Labeling.." Paper presented at the meeting of the ECML/PKDD (2), 2009.

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

Butler, S.K.. "Eigenvalues and Structures of Graphs." PhD diss., University of California, San Diego, 2008.

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

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

Nicosia, V., Mangioni, G., Carchiolo, V. and Malgeri, M. Extending the definition of modularity to directed graphs with
overlapping communities. (2008). , cite arxiv:0801.1647 Comment: 22 pages, 11 figures .

Symeonidis, Panagiotis, Nanopoulos, Alexandros and Manolopoulos, Yannis. "Tag recommendations based on tensor dimensionality reduction." Paper presented at the meeting of the RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems, New York, NY, USA, 2008.

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

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

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

Schaeffer, S.E.. "Graph clustering." Computer Science Review 1 , no. 1 (2007): 27--64.

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

Zesch, Torsten and Gurevych, Iryna. "Analysis of the Wikipedia Category Graph for NLP Applications." Paper presented at the meeting of the Proceedings of the TextGraphs-2 Workshop (NAACL-HLT), Rochester, 2007.

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

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

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

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

Frivolt, G. and Pok, O.. "Comparison of Graph Clustering Approaches." (2006): .

Hotho, Andreas, Jäschke, Robert, Schmitz, Christoph and Stumme, Gerd. "Information Retrieval in Folksonomies: Search and Ranking." Paper presented at the meeting of the The Semantic Web: Research and Applications, Heidelberg, 2006.

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

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

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

Schmitz, Christoph, Hotho, Andreas, Jäschke, Robert and Stumme, Gerd. "Content Aggregation on Knowledge Bases using Graph Clustering." Paper presented at the meeting of the The Semantic Web: Research and Applications, Heidelberg, 2006.

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

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

Diestel, Reinhard. Graph Theory. 3 (electronic edition) : Springer-Verlag Heidelberg, New York, 2005.

Lerner, Jürgen. "Role Assignments." In Network Analysis , edited by Ulrik Brandes and Thomas Erlebach , 216-252. Berlin / Heidelberg: Springer, 2005.

White, S. and Smyth, P.. "A spectral clustering approach to finding communities in graph." (2005): .

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

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

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

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

Langville, A.N. and Meyer, C.D.. "Deeper inside pagerank." Internet Mathematics 1 , no. 3 (2004): 335--380.

Batagelj, V. and Zaversnik, M. An O(m) Algorithm for Cores Decomposition of Networks. (2003). , cite arxiv:cs/0310049 .

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

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

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

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

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

Yu, Stella X. and Shi, Jianbo. "Multiclass Spectral Clustering." Paper presented at the meeting of the Proc. International Conference on Computer Vision (ICCV 03), Nice, France, 2003.

Blelloch, Guy. "Graph Separators." 2002.

Brandes, U. and Willhalm, T.. "Visualization of bibliographic networks with a reshaped landscape metaphor." Paper presented at the meeting of the Proceedings of the symposium on Data Visualisation 2002, Aire-la-Ville, Switzerland, Switzerland, 2002.

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

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

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

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

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

Ng, Andrew Y., Jordan, Michael I. and Weiss, Yair. "On spectral clustering: Analysis and an algorithm." Paper presented at the meeting of the Advances in Neural Information Processing Systems 14, 2001.

Aiello, W., Chung, F. and Lu, L.. "A random graph model for massive graphs." (2000): 171--180.

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

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

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

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

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

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

Batagelj, Vladimir, Mrvar, Andrej and Zaveršnik, Matjaž. "Partitioning Approach to Visualization of Large Graphs." In Graph Drawing , edited by Jan Kratochvíyl , 90-97. Berlin / Heidelberg: Springer, 1999.

Brin, Sergey and Page, Lawrence. "The Anatomy of a Large-Scale Hypertextual Web Search Engine." Paper presented at the meeting of the Computer Networks and ISDN Systems, 1998.

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

Karypis, George and Kumar, Vipin. "Multilevel k-way Hypergraph Partitioning." Paper presented at the meeting of the In Proceedings of the Design and Automation Conference, 1998.

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

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

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

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

Alpert, Charles J., Kahng, Andrew B. and zen Yao, So. "Spectral partitioning: The more eigenvectors, the better." Paper presented at the meeting of the Proc. ACM/IEEE Design Automation Conf, 1995.

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

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

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

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

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

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

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

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

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

Karonski, M.. "A review of random graphs." Journal of Graph Theory 6 , no. 4 (1982): .

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

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

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

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