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

Inproceedings (DBLP:conf/dsaa/KrompassNT14)
Krompass, D.; Nickel, M. & Tresp, V.
Large-scale factorization of type-constrained multi-relational data
IEEE, 2014, 18-24

Inproceedings (doerfel2013analysis)
Doerfel, S. & Jäschke, R.
An analysis of tag-recommender evaluation procedures
ACM, 2013, 343-346

Article (noKey)
Heidtmann, K.
Internet-Graphen
Informatik-Spektrum, Springer Berlin Heidelberg, 2013, 36, 440-448

Article (landia2013deeper)
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
cs.IR, 2013, 1310.1498

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

Inproceedings (pereiranunes2012entities)
Pereira Nunes, B.; Kawase, R.; Dietze, S.; Taibi, D.; Casanova, M. A. & Nejdl, W.
Rizzo, G.; Mendes, P.; Charton, E.; Hellmann, S. & Kalyanpur, A. (ed.)
Can Entities be Friends?
Bernardo Pereira Nunes, Ricardo Kawase, Stefan Dietze, Davide Taibi, Marco Antonio Casanova, Wolfgang Nejdl, 2012, 906, 45-57

Article (batagelj2011algorithms)
Batagelj, V. & Zaveršnik, M.
Fast algorithms for determining (generalized) core groups in social networks
Advances in Data Analysis and Classification, Springer, 2011, 5, 129-145

Misc (ugander2011anatomy)
Ugander, J.; Karrer, B.; Backstrom, L. & Marlow, C.
The Anatomy of the Facebook Social Graph
2011

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

Article (journals/corr/abs-1006-1260)
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
CoRR, 2010, abs/1006.1260

Inproceedings (mitzlaff2010visit)
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

Inproceedings (conf/pkdd/AkogluF09)
Akoglu, L. & Faloutsos, C.
Buntine, W. L.; Grobelnik, M.; Mladenic, D. & Shawe-Taylor, J. (ed.)
RTG: A Recursive Realistic Graph Generator Using Random Typing.
Springer, 2009, 5781, 13-28

Inproceedings (conf/pkdd/BerlingerioBBG09)
Berlingerio, M.; Bonchi, F.; Bringmann, B. & Gionis, A.
Buntine, W. L.; Grobelnik, M.; Mladenic, D. & Shawe-Taylor, J. (ed.)
Mining Graph Evolution Rules.
Springer, 2009, 5781, 115-130

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

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

Misc (Ghosh2009)
Ghosh, R. & Lerman, K.
Structure of Heterogeneous Networks
2009

Inproceedings (conf/pkdd/MaesPDG09)
Maes, F.; Peters, S.; Denoyer, L. & Gallinari, P.
Buntine, W. L.; Grobelnik, M.; Mladenic, D. & Shawe-Taylor, J. (ed.)
Simulated Iterative Classification A New Learning Procedure for Graph Labeling.
Springer, 2009, 5782, 47-62

Inproceedings (murata2009modularities)
Murata, T.
Modularities for Bipartite Networks
ACM, 2009

Phdthesis (butler2008eas)
Butler, S.
Eigenvalues and Structures of Graphs
University of California, San Diego, 2008

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

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

Misc (Nicosia2008)
Nicosia, V.; Mangioni, G.; Carchiolo, V. & Malgeri, M.
Extending the definition of modularity to directed graphs with
overlapping communities
2008

Inproceedings (1454017)
Symeonidis, P.; Nanopoulos, A. & Manolopoulos, Y.
Tag recommendations based on tensor dimensionality reduction
ACM, 2008, 43-50

Inproceedings (baur2007generating)
Baur, M.; Gaertler, M.; Görke, R.; Krug, M. & Wagner, D.
Generating Graphs with Predefined k-Core Structure
2007

Incollection (springerlink:10.1007/978-3-540-74839-7_12)
Brandes, U.; Delling, D.; Gaertler, M.; Görke, R.; Hoefer, M.; Nikoloski, Z. & Wagner, D.
Brandstädt, A.; Kratsch, D. & Müller, H. (ed.)
On Finding Graph Clusterings with Maximum Modularity
Springer, 2007, 4769, 121-132

Article (1288832)
Luxburg, U.
A tutorial on spectral clustering
Statistics and Computing, Kluwer Academic Publishers, 2007, 17, 395-416

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

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

Inproceedings (zesch2007analysis)
Zesch, T. & Gurevych, I.
Analysis of the Wikipedia Category Graph for NLP Applications
Association for Computational Linguistics, 2007, 1-8

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

Unpublished (butler2006-3)
Butler, S.
Spectral Graph Theory: Cheeger constants and discrepancy
2006

Unpublished (butler2006-1)
Butler, S.
Spectral Graph Theory: Three common spectra
2006

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

Article (frivolt:cgc)
Frivolt, G. & Pok, O.
Comparison of Graph Clustering Approaches
2006

Inproceedings (hotho2006information)
Hotho, A.; Jäschke, R.; Schmitz, C. & Stumme, G.
Sure, Y. & Domingue, J. (ed.)
Information Retrieval in Folksonomies: Search and Ranking
Springer, 2006, 4011, 411-426

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

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

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

Inproceedings (schmitz2006content)
Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G.
Sure, Y. & Domingue, J. (ed.)
Content Aggregation on Knowledge Bases using Graph Clustering
Springer, 2006, 4011, 530-544

Techreport (Dhillon:EtAl:05)
Dhillon, I. S.; Guan, Y. & Kulis, B.
A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts
University of Texas Dept. of Computer Science, 2005

Article (Dias2005240)
Dias, V. M.; de Figueiredo, C. M. & Szwarcfiter, J. L.
Generating bicliques of a graph in lexicographic order
Theoretical Computer Science, 2005, 337, 240 - 248

Book (diestel2006graphentheorie)
Diestel, R.
Graph Theory
Springer-Verlag Heidelberg, New York, 2005, I-XVI, 1-344

Incollection (lerner2005assignments)
Lerner, J.
Brandes, U. & Erlebach, T. (ed.)
Role Assignments
Springer, 2005, 3418, 216-252

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

Article (an2004characterizing)
An, Y.; Janssen, J. & Milios, E. E.
Characterizing and Mining the Citation Graph of the Computer Science Literature
Knowl. Inf. Syst., Springer-Verlag New York, Inc., 2004, 6, 664-678

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

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

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

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

Misc (batagelj2003algorithm)
Batagelj, V. & Zaversnik, M.
An O(m) Algorithm for Cores Decomposition of Networks
2003

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

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

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

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

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

Inproceedings (yu2003multiclass)
Yu, S. X. & Shi, J.
Multiclass Spectral Clustering
2003

Unpublished (graphseparators02)
Blelloch, G.
Graph Separators
2002

Inproceedings (Brandes:2002:VBN:509740.509765)
Brandes, U. & Willhalm, T.
Visualization of bibliographic networks with a reshaped landscape metaphor
Eurographics Association, 2002, 159-ff

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

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

Inproceedings (coclustering01)
Dhillon, I. S.
Co-clustering documents and words using bipartite spectral graph partitioning
ACM Press, 2001, 269-274

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

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

Inproceedings (Ng01onspectral)
Ng, A. Y.; Jordan, M. I. & Weiss, Y.
On spectral clustering: Analysis and an algorithm
MIT Press, 2001, 849-856

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

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

Article (gansner2000graph)
Gansner, E. R. & North, S. C.
An open graph visualization system and its applications to software engineering
Software Practice & Experience, John Wiley & Sons, Inc., 2000, 30, 1203-1233

Book (janson2000theory)
Janson, S.; Luczak, T. & Rucinski, A.
Theory of random graphs
John Wiley & Sons, 2000

Unpublished (ranade:sus)
Ranade, A.
Some uses of spectral methods
2000

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

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

Incollection (batagelj1999partitioning)
Batagelj, V.; Mrvar, A. & Zaveršnik, M.
Kratochvíyl, J. (ed.)
Partitioning Approach to Visualization of Large Graphs
Springer, 1999, 1731, 90-97

Inproceedings (Brin98theanatomy)
Brin, S. & Page, L.
The Anatomy of a Large-Scale Hypertextual Web Search Engine
1998, 107-117

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

Inproceedings (Karypis98multilevelk-way)
Karypis, G. & Kumar, V.
Multilevel k-way Hypergraph Partitioning
1998, 343-348

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

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

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

Techreport (Spielman:1996)
Spielman, D. A. & Teng, S.
Spectral Partitioning Works: Planar Graphs and Finite Element Meshes
University of California at Berkeley, 1996

Inproceedings (Alpert95spectralpartitioning:)
Alpert, C. J.; Kahng, A. B. & zen Yao, S.
Spectral partitioning: The more eigenvectors, the better
1995, 195-200

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

Article (179359)
Bolla, M. & Tusnády, G.
Spectra and optimal partitions of weighted graphs
Discrete Math., Elsevier Science Publishers B. V., 1994, 128, 1-20

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

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

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

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

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

Article (46243)
Johnson, D. S. & Papadimitriou, C. H.
On generating all maximal independent sets
Inf. Process. Lett., Elsevier North-Holland, Inc., 1988, 27, 119-123

Article (seidman1983network)
Seidman, S. B.
Network structure and minimum degree
Social Networks, 1983, 5, 269 - 287

Article (karonski1982rrg)
Karonski, M.
A review of random graphs
Journal of Graph Theory, Wiley Subscription Services, Inc., A Wiley Company New York, 1982, 6

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

Article (citeulike:1025135)
Freeman, L. C.
A Set of Measures of Centrality Based on Betweenness
Sociometry, American Sociological Association, 1977, 40, 35-41

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

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