| Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
|---|---|---|---|---|---|
| Thomas, J., Moallemy-Oureh, A., Beddar-Wiesing, S. & Holzhüter, C. | Graph Neural Networks Designed for Different Graph Types: A Survey | 2023 | Transactions on Machine Learning Research | article | URL |
| Krompass, D., Nickel, M. & Tresp, V. | Large-scale factorization of type-constrained multi-relational data | 2014 | International Conference on Data Science and Advanced Analytics, DSAA 2014, Shanghai, China, October 30 - November 1, 2014 | inproceedings | DOIURL |
| Doerfel, S. & Jäschke, R. | An analysis of tag-recommender evaluation procedures | 2013 | Proceedings of the 7th ACM conference on Recommender systems | inproceedings | DOIURL |
| Heidtmann, K. | Internet-Graphen | 2013 | Informatik-Spektrum | article | DOIURL |
| 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 | 2013 | cs.IR | article | URL |
| 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 | 2013 | cs.IR | article | URL |
| 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 | 2013 | cs.IR | article | URL |
| Liu, X., Zhang, J. & Guo, C. | Full-Text Citation Analysis: A New Method to Enhance Scholarly Network | 2012 | Journal of the American Society for Information Science and Technology | article | URL |
| Liu, X., Zhang, J. & Guo, C. | Full-Text Citation Analysis: A New Method to Enhance Scholarly Network | 2012 | Journal of the American Society for Information Science and Technology | article | URL |
| Pereira Nunes, B., Kawase, R., Dietze, S., Taibi, D., Casanova, M. A. & Nejdl, W. | Can Entities be Friends? | 2012 | Proceedings of the Web of Linked Entities Workshop in conjuction with the 11th International Semantic Web Conference Rizzo, G.; Mendes, P.; Charton, E.; Hellmann, S. & Kalyanpur, A. (ed.) |
inproceedings | URL |
| Pereira Nunes, B., Kawase, R., Dietze, S., Taibi, D., Casanova, M. A. & Nejdl, W. | Can Entities be Friends? | 2012 | Proceedings of the Web of Linked Entities Workshop in conjuction with the 11th International Semantic Web Conference Rizzo, G.; Mendes, P.; Charton, E.; Hellmann, S. & Kalyanpur, A. (ed.) |
inproceedings | URL |
| Batagelj, V. & Zaveršnik, M. | Fast algorithms for determining (generalized) core groups in social networks | 2011 | Advances in Data Analysis and Classification | article | DOIURL |
| Ugander, J., Karrer, B., Backstrom, L. & Marlow, C. | The Anatomy of the Facebook Social Graph | 2011 | misc | URL | |
| Chakrabarti, S., Pathak, A. & Gupta, M. | Index design and query processing for graph conductance search | 2010 | The VLDB Journal | article | DOIURL |
| Isella, L., Stehlé, J., Barrat, A., Cattuto, C., Pinton, J.-F. & den Broeck, W. V. | What's in a crowd? Analysis of face-to-face behavioral networks | 2010 | CoRR | article | URL |
| Mitzlaff, F., Benz, D., Stumme, G. & Hotho, A. | Visit me, click me, be my friend: An analysis of evidence networks of user relationships in Bibsonomy | 2010 | Proceedings of the 21st ACM conference on Hypertext and hypermedia | inproceedings | URL |
| Mitzlaff, F., Benz, D., Stumme, G. & Hotho, A. | Visit me, click me, be my friend: An analysis of evidence networks of user relationships in Bibsonomy | 2010 | Proceedings of the 21st ACM conference on Hypertext and hypermedia | inproceedings | URL |
| Akoglu, L. & Faloutsos, C. | RTG: A Recursive Realistic Graph Generator Using Random Typing. | 2009 | ECML/PKDD (1) Buntine, W. L.; Grobelnik, M.; Mladenic, D. & Shawe-Taylor, J. (ed.) |
inproceedings | URL |
| Berlingerio, M., Bonchi, F., Bringmann, B. & Gionis, A. | Mining Graph Evolution Rules. | 2009 | ECML/PKDD (1) Buntine, W. L.; Grobelnik, M.; Mladenic, D. & Shawe-Taylor, J. (ed.) |
inproceedings | URL |
| Fürnkranz, J., Hüllermeier, E. & Vanderlooy, S. | Binary Decomposition Methods for Multipartite Ranking | 2009 | Machine Learning and Knowledge Discovery in Databases | article | URL |
| Gansner, E. R., Hu, Y. & Kobourov, S. G. | GMap: Drawing Graphs as Maps | 2009 | cs.CG | article | URL |
| Ghosh, R. & Lerman, K. | Structure of Heterogeneous Networks | 2009 | misc | URL | |
| Maes, F., Peters, S., Denoyer, L. & Gallinari, P. | Simulated Iterative Classification A New Learning Procedure for Graph Labeling. | 2009 | ECML/PKDD (2) Buntine, W. L.; Grobelnik, M.; Mladenic, D. & Shawe-Taylor, J. (ed.) |
inproceedings | URL |
| Murata, T. | Modularities for Bipartite Networks | 2009 | HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia | inproceedings | |
| Butler, S. | Eigenvalues and Structures of Graphs | 2008 | School: University of California, San Diego | phdthesis | |
| Filippone, M., Camastra, F., Masulli, F. & Rovetta, S. | A survey of kernel and spectral methods for clustering | 2008 | Pattern recognition | article | |
| Jackson, M. | Average Distance, Diameter, and Clustering in Social Networks with Homophily | 2008 | Internet and Network Economics | article | URL |
| Nicosia, V., Mangioni, G., Carchiolo, V. & Malgeri, M. | Extending the definition of modularity to directed graphs with overlapping communities | 2008 | misc | URL | |
| Symeonidis, P., Nanopoulos, A. & Manolopoulos, Y. | Tag recommendations based on tensor dimensionality reduction | 2008 | RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems | inproceedings | DOIURL |
| Baur, M., Gaertler, M., Görke, R., Krug, M. & Wagner, D. | Generating Graphs with Predefined k-Core Structure | 2007 | Proceedings of the European Conference of Complex Systems | inproceedings | URL |
| Brandes, U., Delling, D., Gaertler, M., Görke, R., Hoefer, M., Nikoloski, Z. & Wagner, D. | On Finding Graph Clusterings with Maximum Modularity | 2007 | Graph-Theoretic Concepts in Computer Science Brandstädt, A.; Kratsch, D. & Müller, H. (ed.) |
incollection | DOIURL |
| Luxburg, U. | A tutorial on spectral clustering | 2007 | Statistics and Computing | article | DOIURL |
| Schaeffer, S. | Graph clustering | 2007 | Computer Science Review | article | URL |
| Spielman, D. | Spectral Graph Theory and its Applications | 2007 | Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on | article | DOI |
| Zesch, T. & Gurevych, I. | Analysis of the Wikipedia Category Graph for NLP Applications | 2007 | Proceedings of the TextGraphs-2 Workshop (NAACL-HLT) | inproceedings | URL |
| Butler, S. | Spectral Graph Theory: Applications of Courant Fischer | 2006 | unpublished | ||
| Butler, S. | Spectral Graph Theory: Cheeger constants and discrepancy | 2006 | unpublished | ||
| Butler, S. | Spectral Graph Theory: Three common spectra | 2006 | unpublished | ||
| Cantador, I. & Castells, P. | Building Emergent Social Networks and Group Profiles by Semantic User Preference Clustering | 2006 | article | ||
| Frivolt, G. & Pok, O. | Comparison of Graph Clustering Approaches | 2006 | article | ||
| Hotho, A., Jäschke, R., Schmitz, C. & Stumme, G. | Information Retrieval in Folksonomies: Search and Ranking | 2006 | The Semantic Web: Research and Applications Sure, Y. & Domingue, J. (ed.) |
inproceedings | |
| Newman, M. E. J. | Modularity and community structure in networks | 2006 | Proceedings of the National Academy of Sciences | article | DOI |
| Newman, M. | Finding community structure in networks using the eigenvectors of matrices | 2006 | Physical Review E | article | |
| Newman, M. | Modularity and community structure in networks | 2006 | Proceedings of the National Academy of Sciences | article | |
| Schmitz, C., Hotho, A., Jäschke, R. & Stumme, G. | Content Aggregation on Knowledge Bases using Graph Clustering | 2006 | The Semantic Web: Research and Applications Sure, Y. & Domingue, J. (ed.) |
inproceedings | URL |
| Dhillon, I. S., Guan, Y. & Kulis, B. | A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts | 2005 | techreport | URL | |
| Dias, V. M., de Figueiredo, C. M. & Szwarcfiter, J. L. | Generating bicliques of a graph in lexicographic order | 2005 | Theoretical Computer Science | article | DOIURL |
| Diestel, R. | Graph Theory | 2005 | book | URL | |
| Lerner, J. | Role Assignments | 2005 | Network Analysis Brandes, U. & Erlebach, T. (ed.) |
incollection | DOIURL |
| White, S. & Smyth, P. | A spectral clustering approach to finding communities in graph | 2005 | SIAM Data Mining | article | |
| An, Y., Janssen, J. & Milios, E. E. | Characterizing and Mining the Citation Graph of the Computer Science Literature | 2004 | Knowl. Inf. Syst. | article | DOIURL |
| Bollobás*, B. & Riordan, O. | The Diameter of a Scale-Free Random Graph | 2004 | Combinatorica | article | URL |
| Drineas, P., Frieze, A., Kannan, R., Vempala, S. & Vinay, V. | Clustering large graphs via the singular value decomposition | 2004 | Machine Learning | article | URL |
| Flake, G., Tarjan, R. & Tsioutsiouliklis, K. | Graph clustering and minimum cut trees | 2004 | Internet Mathematics | article | URL |
| Langville, A. & Meyer, C. | Deeper inside pagerank | 2004 | Internet Mathematics | article | URL |
| Batagelj, V. & Zaversnik, M. | An O(m) Algorithm for Cores Decomposition of Networks | 2003 | misc | URL | |
| Brandes, U., Gaertler, M. & Wagner, D. | Experiments on graph clustering algorithms | 2003 | Lecture notes in computer science | article | URL |
| Estrada, E. & Rodriguez-Velázquez, J. | Spectral measures of bipartivity in complex networks | 2003 | SIAM Rev Phys Rev E | article | |
| Haveliwala, T. & Kamvar, S. | The second eigenvalue of the Google matrix | 2003 | A Stanford University Technical Report http://dbpubs. stanford. edu | article | |
| Newman, M. E. J. | The structure and function of complex networks | 2003 | SIAM Review | article | |
| Verma, D. & Meila, M. | A comparison of spectral clustering algorithms | 2003 | University of Washington, Tech. Rep. UW-CSE-03-05-01 | article | |
| Yu, S. X. & Shi, J. | Multiclass Spectral Clustering | 2003 | Proc. International Conference on Computer Vision (ICCV 03) | inproceedings | |
| Blelloch, G. | Graph Separators | 2002 | unpublished | ||
| Brandes, U. & Willhalm, T. | Visualization of bibliographic networks with a reshaped landscape metaphor | 2002 | Proceedings of the symposium on Data Visualisation 2002 | inproceedings | URL |
| Snijders, T. | Markov chain Monte Carlo estimation of exponential random graph models | 2002 | Journal of Social Structure | article | |
| Soderberg, B. | General formalism for inhomogeneous random graphs | 2002 | Phys. Rev. E | article | |
| Dhillon, I. S. | Co-clustering documents and words using bipartite spectral graph partitioning | 2001 | KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining | inproceedings | DOIURL |
| Monien, B. | On Spectral Bounds for the k-Partitioning of Graphs | 2001 | misc | ||
| Newman, M., Strogatz, S. & Watts, D. | Random graphs with arbitrary degree distributions and their applications | 2001 | Arxiv preprint cond-mat/0007235 | article | |
| Ng, A. Y., Jordan, M. I. & Weiss, Y. | On spectral clustering: Analysis and an algorithm | 2001 | Advances in Neural Information Processing Systems 14 | inproceedings | |
| Aiello, W., Chung, F. & Lu, L. | A random graph model for massive graphs | 2000 | Proceedings of the thirty-second annual ACM symposium on Theory of computing | article | URL |
| Butler, S. | Cospectral graphs for both the adjacency and normalized Laplacian matrices | 2000 | article | ||
| Gansner, E. R. & North, S. C. | An open graph visualization system and its applications to software engineering | 2000 | Software Practice & Experience | article | DOIURL |
| Janson, S., Luczak, T. & Rucinski, A. | Theory of random graphs | 2000 | book | URL | |
| Ranade, A. | Some uses of spectral methods | 2000 | unpublished | ||
| Anderson, C., Wasserman, S. & Crouch, B. | A p* primer: Logit models for social networks | 1999 | Social Networks | article | |
| Barabasi, A. L. & Albert, R. | Emergence of scaling in random networks | 1999 | Science | article | URL |
| Batagelj, V., Mrvar, A. & Zaveršnik, M. | Partitioning Approach to Visualization of Large Graphs | 1999 | Graph Drawing Kratochvíyl, J. (ed.) |
incollection | DOIURL |
| Brin, S. & Page, L. | The Anatomy of a Large-Scale Hypertextual Web Search Engine | 1998 | Computer Networks and ISDN Systems | inproceedings | URL |
| Guattery, S. & Miller, G. | On the quality of spectral separators | 1998 | SIAM Journal on Matrix Analysis and Applications | article | |
| Karypis, G. & Kumar, V. | Multilevel k-way Hypergraph Partitioning | 1998 | In Proceedings of the Design and Automation Conference | inproceedings | |
| Chung, F. R. K. | Spectral Graph Theory | 1997 | book | ||
| Karypis, G., Aggarwal, R., Kumar, V. & Shekhar, S. | Multilevel hypergraph partitioning: Application in VLSI domain | 1997 | Proceedings of the 34th annual conference on Design automation | article | |
| Mohar, B. | Some applications of Laplace eigenvalues of graphs | 1997 | Graph Symmetry: Algebraic Methods and Applications | article | |
| Spielman, D. A. & Teng, S. | Spectral Partitioning Works: Planar Graphs and Finite Element Meshes | 1996 | techreport | ||
| Alpert, C. J., Kahng, A. B. & zen Yao, S. | Spectral partitioning: The more eigenvectors, the better | 1995 | Proc. ACM/IEEE Design Automation Conf | inproceedings | |
| Molloy, M. & Reed, B. | A critical point for random graphs with a given degree sequence | 1995 | Random Structures & Algorithms | misc | URL |
| Bolla, M. & Tusnády, G. | Spectra and optimal partitions of weighted graphs | 1994 | Discrete Math. | article | DOIURL |
| Chan, P. K., Schlag, M. D. F. & Zien, J. Y. | Spectral K-way ratio-cut partitioning and clustering. | 1994 | IEEE Trans. on CAD of Integrated Circuits and Systems | article | URL |
| Hagen, L. W. & Kahng, A. B. | New spectral methods for ratio cut partitioning and clustering. | 1992 | IEEE Trans. on CAD of Integrated Circuits and Systems | article | URL |
| Mohar, B. | The Laplacian spectrum of graphs | 1991 | Graph Theory, Combinatorics, and Applications | article | |
| Pothen, A., Simon, H. & Liou, K. | Partitioning Sparse Matrices with Eigenvectors of Graphs | 1990 | SIAM J. MATRIX ANAL. APPLIC. | article | URL |
| Frank, O. | Random sampling and social networks: a survey of various approaches | 1988 | Math. Sci. Humaines | article | |
| Johnson, D. S. & Papadimitriou, C. H. | On generating all maximal independent sets | 1988 | Inf. Process. Lett. | article | DOIURL |
| Seidman, S. B. | Network structure and minimum degree | 1983 | Social Networks | article | DOIURL |
| Karonski, M. | A review of random graphs | 1982 | Journal of Graph Theory | article | |
| Bollobas, B. | The diameter of random graphs | 1981 | Transactions of the American Mathematical Society | article | |
| Freeman, L. C. | A Set of Measures of Centrality Based on Betweenness | 1977 | Sociometry | article | URL |
| Fiedler, M. | A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory | 1975 | Czechoslovak Mathematical Journal | article | |
| Donath, W. & Hoffman, A. | Lower bounds for the partitioning of graphs | 1973 | IBM Journal of Research and Development | article |
Created by JabRef export filters on 01/05/2024 by the social publication management platform PUMA