Thomas, J., Moallemy-Oureh, A., Beddar-Wiesing, S. & Holzhüter, C. (2023). Graph Neural Networks Designed for Different Graph Types: A Survey. Transactions on Machine Learning Research, .

Krompass, D., Nickel, M. & Tresp, V. (2014). 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 (p./pp. 18--24), : IEEE. ISBN: 978-1-4799-6991-3

Doerfel, S. & Jäschke, R. (2013). An analysis of tag-recommender evaluation procedures. Proceedings of the 7th ACM conference on Recommender systems (p./pp. 343--346), New York, NY, USA: ACM. ISBN: 978-1-4503-2409-0

Heidtmann, K. (2013). Internet-Graphen. Informatik-Spektrum, 36, 440-448. doi: 10.1007/s00287-012-0654-z

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

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

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

Liu, X., Zhang, J. & Guo, C. (2012). Full-Text Citation Analysis: A New Method to Enhance Scholarly Network. Journal of the American Society for Information Science and Technology, .

Liu, X., Zhang, J. & Guo, C. (2012). Full-Text Citation Analysis: A New Method to Enhance Scholarly Network. Journal of the American Society for Information Science and Technology, .

Pereira Nunes, B., Kawase, R., Dietze, S., Taibi, D., Casanova, M. A. & Nejdl, W. (2012). Can Entities be Friends?. In G. Rizzo, P. Mendes, E. Charton, S. Hellmann & A. Kalyanpur (eds.), Proceedings of the Web of Linked Entities Workshop in conjuction with the 11th International Semantic Web Conference (p./pp. 45--57), November, .

Pereira Nunes, B., Kawase, R., Dietze, S., Taibi, D., Casanova, M. A. & Nejdl, W. (2012). Can Entities be Friends?. In G. Rizzo, P. Mendes, E. Charton, S. Hellmann & A. Kalyanpur (eds.), Proceedings of the Web of Linked Entities Workshop in conjuction with the 11th International Semantic Web Conference (p./pp. 45--57), November, .

Batagelj, V. & Zaveršnik, M. (2011). Fast algorithms for determining (generalized) core groups in social networks. Advances in Data Analysis and Classification, 5, 129-145. doi: 10.1007/s11634-010-0079-y

Ugander, J., Karrer, B., Backstrom, L. & Marlow, C. (2011). The Anatomy of the Facebook Social Graph (cite arxiv:1111.4503Comment: 17 pages, 9 figures, 1 table)

Chakrabarti, S., Pathak, A. & Gupta, M. (2010). Index design and query processing for graph conductance search. The VLDB Journal, , 1-26. doi: 10.1007/s00778-010-0204-8

Isella, L., Stehlé, J., Barrat, A., Cattuto, C., Pinton, J.-F. & den Broeck, W. V. (2010). What's in a crowd? Analysis of face-to-face behavioral networks. CoRR, abs/1006.1260.

Mitzlaff, F., Benz, D., Stumme, G. & Hotho, A. (2010). 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.

Mitzlaff, F., Benz, D., Stumme, G. & Hotho, A. (2010). 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.

Akoglu, L. & Faloutsos, C. (2009). RTG: A Recursive Realistic Graph Generator Using Random Typing.. In W. L. Buntine, M. Grobelnik, D. Mladenic & J. Shawe-Taylor (eds.), ECML/PKDD (1) (p./pp. 13-28), : Springer. ISBN: 978-3-642-04179-2

Berlingerio, M., Bonchi, F., Bringmann, B. & Gionis, A. (2009). Mining Graph Evolution Rules.. In W. L. Buntine, M. Grobelnik, D. Mladenic & J. Shawe-Taylor (eds.), ECML/PKDD (1) (p./pp. 115-130), : Springer. ISBN: 978-3-642-04179-2

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

Gansner, E. R., Hu, Y. & Kobourov, S. G. (2009). GMap: Drawing Graphs as Maps. cs.CG, arXiv:0907.2585v1.

Ghosh, R. & Lerman, K. (2009). Structure of Heterogeneous Networks (cite arxiv:0906.2212 )

Maes, F., Peters, S., Denoyer, L. & Gallinari, P. (2009). Simulated Iterative Classification A New Learning Procedure for Graph Labeling.. In W. L. Buntine, M. Grobelnik, D. Mladenic & J. Shawe-Taylor (eds.), ECML/PKDD (2) (p./pp. 47-62), : Springer. ISBN: 978-3-642-04173-0

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

Butler, S. (2008). Eigenvalues and Structures of Graphs. Unpublished doctoral dissertation , University of California, San Diego .

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

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

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

Symeonidis, P., Nanopoulos, A. & Manolopoulos, Y. (2008). Tag recommendations based on tensor dimensionality reduction. RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems (p./pp. 43--50), New York, NY, USA: ACM. ISBN: 978-1-60558-093-7

Baur, M., Gaertler, M., Görke, R., Krug, M. & Wagner, D. (2007). Generating Graphs with Predefined k-Core Structure. Proceedings of the European Conference of Complex Systems, October, .

Brandes, U., Delling, D., Gaertler, M., Görke, R., Hoefer, M., Nikoloski, Z. & Wagner, D. (2007). On Finding Graph Clusterings with Maximum Modularity. In A. Brandstädt, D. Kratsch & H. Müller (ed.), Graph-Theoretic Concepts in Computer Science , Vol. 4769 (pp. 121-132) . Springer . ISBN: 978-3-540-74838-0.

Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and Computing, 17, 395--416. doi: http://dx.doi.org/10.1007/s11222-007-9033-z

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

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

Zesch, T. & Gurevych, I. (2007). Analysis of the Wikipedia Category Graph for NLP Applications. Proceedings of the TextGraphs-2 Workshop (NAACL-HLT) (p./pp. 1--8), April, Rochester: Association for Computational Linguistics.

Butler, S. (2006). Spectral Graph Theory: Applications of Courant Fischer

Butler, S. (2006). Spectral Graph Theory: Cheeger constants and discrepancy

Butler, S. (2006). Spectral Graph Theory: Three common spectra

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

Frivolt, G. & Pok, O. (2006). Comparison of Graph Clustering Approaches. , .

Hotho, A., Jäschke, R., Schmitz, C. & Stumme, G. (2006). Information Retrieval in Folksonomies: Search and Ranking. In Y. Sure & J. Domingue (eds.), The Semantic Web: Research and Applications (p./pp. 411-426), June, Heidelberg: Springer.

Newman, M. E. J. (2006). Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103, 8577--8582. doi: 10.1073/pnas.0601602103

Newman, M. (2006). Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74, 36104.

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

Schmitz, C., Hotho, A., Jäschke, R. & Stumme, G. (2006). Content Aggregation on Knowledge Bases using Graph Clustering. In Y. Sure & J. Domingue (eds.), The Semantic Web: Research and Applications (p./pp. 530-544), Heidelberg: Springer.

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

Dias, V. M., de Figueiredo, C. M. & Szwarcfiter, J. L. (2005). Generating bicliques of a graph in lexicographic order. Theoretical Computer Science, 337, 240 - 248. doi: DOI: 10.1016/j.tcs.2005.01.014

Diestel, R. (2005). Graph Theory. Springer-Verlag Heidelberg, New York.

Lerner, J. (2005). Role Assignments. In U. Brandes & T. Erlebach (ed.), Network Analysis , Vol. 3418 (pp. 216-252) . Springer .

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

An, Y., Janssen, J. & Milios, E. E. (2004). Characterizing and Mining the Citation Graph of the Computer Science Literature. Knowl. Inf. Syst., 6, 664--678. doi: http://dx.doi.org/10.1007/s10115-003-0128-3

Bollobás*, B. & Riordan, O. (2004). The Diameter of a Scale-Free Random Graph. Combinatorica, 24, 5--34.

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

Flake, G., Tarjan, R. & Tsioutsiouliklis, K. (2004). Graph clustering and minimum cut trees. Internet Mathematics, 1, 385--408.

Langville, A. & Meyer, C. (2004). Deeper inside pagerank. Internet Mathematics, 1, 335--380.

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

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

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

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

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

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

Yu, S. X. & Shi, J. (2003). Multiclass Spectral Clustering. Proc. International Conference on Computer Vision (ICCV 03), October, Nice, France.

Blelloch, G. (2002). Graph Separators

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

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

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

Dhillon, I. S. (2001). 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 (p./pp. 269--274), New York, NY, USA: ACM Press. ISBN: 158113391X

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

Newman, M., Strogatz, S. & Watts, D. (2001). Random graphs with arbitrary degree distributions and their applications. Arxiv preprint cond-mat/0007235, .

Ng, A. Y., Jordan, M. I. & Weiss, Y. (2001). On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems 14 (p./pp. 849--856), : MIT Press.

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

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

Gansner, E. R. & North, S. C. (2000). An open graph visualization system and its applications to software engineering. Software Practice & Experience, 30, 1203--1233. doi: 10.1002/1097-024X(200009)30:11<1203::AID-SPE338>3.3.CO;2-E

Janson, S., Luczak, T.,, Rucinski, A. (2000). Theory of random graphs. New York; Chichester: John Wiley & Sons. ISBN: 0471175412 9780471175414

Ranade, A. (2000). Some uses of spectral methods

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

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

Batagelj, V., Mrvar, A. & Zaveršnik, M. (1999). Partitioning Approach to Visualization of Large Graphs. In J. Kratochvíyl (ed.), Graph Drawing , Vol. 1731 (pp. 90-97) . Springer . ISBN: 978-3-540-66904-3.

Brin, S. & Page, L. (1998). The Anatomy of a Large-Scale Hypertextual Web Search Engine. Computer Networks and ISDN Systems (p./pp. 107--117), .

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

Karypis, G. & Kumar, V. (1998). Multilevel k-way Hypergraph Partitioning. In Proceedings of the Design and Automation Conference (p./pp. 343--348), .

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

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

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

Spielman, D. A. & Teng, S. (1996). Spectral Partitioning Works: Planar Graphs and Finite Element Meshes (). .

Alpert, C. J., Kahng, A. B. & zen Yao, S. (1995). Spectral partitioning: The more eigenvectors, the better. Proc. ACM/IEEE Design Automation Conf (p./pp. 195--200), .

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

Bolla, M. & Tusnády, G. (1994). Spectra and optimal partitions of weighted graphs. Discrete Math., 128, 1--20. doi: http://dx.doi.org/10.1016/0012-365X(94)90100-7

Chan, P. K., Schlag, M. D. F. & Zien, J. Y. (1994). Spectral K-way ratio-cut partitioning and clustering.. IEEE Trans. on CAD of Integrated Circuits and Systems, 13, 1088-1096.

Hagen, L. W. & Kahng, A. B. (1992). New spectral methods for ratio cut partitioning and clustering.. IEEE Trans. on CAD of Integrated Circuits and Systems, 11, 1074-1085.

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

Pothen, A., Simon, H. & Liou, K. (1990). Partitioning Sparse Matrices with Eigenvectors of Graphs. SIAM J. MATRIX ANAL. APPLIC., 11, 430--452.

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

Johnson, D. S. & Papadimitriou, C. H. (1988). On generating all maximal independent sets. Inf. Process. Lett., 27, 119--123. doi: http://dx.doi.org/10.1016/0020-0190(88)90065-8

Seidman, S. B. (1983). Network structure and minimum degree. Social Networks, 5, 269 - 287. doi: 10.1016/0378-8733(83)90028-X

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

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

Freeman, L. C. (1977). A Set of Measures of Centrality Based on Betweenness. Sociometry, 40, 35--41.

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

Donath, W. & Hoffman, A. (1973). Lower bounds for the partitioning of graphs. IBM Journal of Research and Development, 17, 420--425.