@inproceedings{1454017,
  address = {New York, NY, USA},
  author = {Symeonidis, Panagiotis and Nanopoulos, Alexandros and Manolopoulos, Yannis},
  booktitle = {RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems},
  doi = {http://doi.acm.org/10.1145/1454008.1454017},
  interhash = {8ee38f4ffc05845fcb98f121fb265d48},
  intrahash = {e93afe409833a632af02290bbe134cba},
  isbn = {978-1-60558-093-7},
  location = {Lausanne, Switzerland},
  pages = {43--50},
  publisher = {ACM},
  title = {Tag recommendations based on tensor dimensionality reduction},
  url = {http://portal.acm.org/citation.cfm?id=1454017},
  year = 2008
}

@article{reichardt2006smc,
  author = {Reichardt, J. and Bornholdt, S.},
  interhash = {968ba40de011d4560e3d1279bee169ac},
  intrahash = {787390b28f103b690a59e0949898d93d},
  journal = {Arxiv preprint cond-mat/0603718},
  title = {{Statistical mechanics of community detection}},
  year = 2006
}

@inproceedings{Alpert95spectralpartitioning:,
  author = {Alpert, Charles J. and Kahng, Andrew B. and zen Yao, So},
  booktitle = {Proc. ACM/IEEE Design Automation Conf},
  interhash = {8384ccbb6b91c08c6ce73b2bde86bfd9},
  intrahash = {13da262902e2a4425f7799a519163b99},
  pages = {195--200},
  title = {Spectral partitioning: The more eigenvectors, the better},
  year = 1995
}

@article{estrada2003smb,
  author = {Estrada, E. and Rodr{\'\i}guez-Vel{\'a}zquez, J.A.},
  interhash = {c010f2da83d3f54d6ca8c4e1a792879c},
  intrahash = {2a2cfdf7b25c7fe86be3ea81aa2324e2},
  journal = {SIAM Rev Phys Rev E},
  pages = 046105,
  publisher = {APS},
  title = {{Spectral measures of bipartivity in complex networks}},
  volume = 72,
  year = 2003
}

@article{journals/tcad/ChanSZ94,
  author = {Chan, Pak K. and Schlag, Martine D. F. and Zien, Jason Y.},
  date = {2006-05-31},
  ee = {http://doi.ieeecomputersociety.org/10.1109/43.310898},
  interhash = {f6aa8b385e7b3c62384596f70e7de423},
  intrahash = {9aabfb2ef97763db1ae308576b8c0258},
  journal = {IEEE Trans. on CAD of Integrated Circuits and Systems},
  number = 9,
  pages = {1088-1096},
  title = {Spectral K-way ratio-cut partitioning and clustering.},
  url = {http://dblp.uni-trier.de/db/journals/tcad/tcad13.html#ChanSZ94},
  volume = 13,
  year = 1994
}

@article{guimera2007mib,
  author = {Guimer{\`a}, R. and Sales-Pardo, M. and Amaral, L.A.N.},
  interhash = {a87821c7c8e7d5ca89cb369e6215a0f3},
  intrahash = {6145a42fe04aee556fa7a68c7cea7db3},
  journal = {Physical review. E, Statistical, nonlinear, and soft matter physics},
  number = {3 Pt 2},
  pages = 036102,
  publisher = {NIH Public Access},
  title = {{Module identification in bipartite and directed networks}},
  volume = 76,
  year = 2007
}

@article{newman2006mac,
  author = {Newman, MEJ},
  interhash = {e664336d414a1e21d89f30cc56f5e739},
  intrahash = {9104cb1678a39c96b06ed838a8aa3a63},
  journal = {Proceedings of the National Academy of Sciences},
  number = 23,
  pages = {8577--8582},
  publisher = {National Acad Sciences},
  title = {{Modularity and community structure in networks}},
  volume = 103,
  year = 2006
}

@article{barber2007mac,
  author = {Barber, M.J.},
  interhash = {e1d9f528c49b34ff4a05b2b0060bd653},
  intrahash = {ca152b41e2865976f0166f68364603f0},
  journal = {Physical Review E},
  number = 6,
  title = {{Modularity and community detection in bipartite networks}},
  volume = 76,
  year = 2007
}

@misc{Brandes2006,
  abstract = {Several algorithms have been proposed to compute partitions of networks
	into communities that score high on a graph clustering index called
	modularity. While publications on these algorithms typically contain
	experimental evaluations to emphasize the plausibility of results,
	none of these algorithms has been shown to actually compute optimal
	partitions. We here settle the unknown complexity status of modularity
	maximization by showing that the corresponding decision version is
	NP-complete in the strong sense. As a consequence, any efficient,
	i.e. polynomial-time, algorithm is only heuristic and yields suboptimal
	partitions on many instances.},
  author = {Brandes, U. and Delling, D. and Gaertler, M. and Goerke, R. and Hoefer, M. and Nikoloski, Z. and Wagner, D.},
  interhash = {3e2bf460cff3138de1e855a7cf5d659d},
  intrahash = {b5185cbb85b90294fa15dd2e8ea53f5e},
  note = {cite arxiv:physics/0608255 Comment: 10 pages, 1 figure},
  title = {Maximizing Modularity is hard},
  url = {http://arxiv.org/abs/physics/0608255},
  year = 2006
}

@article{freeman2003fsg,
  author = {Freeman, L.C.},
  booktitle = {Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers},
  interhash = {563243fe694f79b8abfeabe79518918f},
  intrahash = {9d65217331256c63be4712db235af3bf},
  organization = {National Academy Press},
  pages = 39,
  title = {{Finding social groups: A meta-analysis of the southern women data}},
  year = 2003
}

@article{blondel2008fuc,
  author = {Blondel, V.D. and Guillaume, J.L. and Lambiotte, R. and Mech, E.L.J.S.},
  interhash = {e4065c1dcd8f12fac7996dc7b2fc9476},
  intrahash = {66b99a8248d2934e843f5314532340fb},
  journal = {J. Stat. Mech},
  pages = {P10008},
  title = {{Fast unfolding of communities in large networks}},
  year = 2008
}

@article{newman2004dcs,
  author = {Newman, MEJ},
  interhash = {cad361c7a0742a941d85c18107e1f15e},
  intrahash = {08e78d384cb4c9a499de39a6a6253d02},
  journal = {The European Physical Journal B-Condensed Matter},
  number = 2,
  pages = {321--330},
  publisher = {Springer},
  title = {{Detecting community structure in networks}},
  volume = 38,
  year = 2004
}

@article{danon2005ccs,
  author = {Danon, L. and Diaz-Guilera, A. and Duch, J. and Arenas, A.},
  interhash = {fcc89d1c563019d2ce655c175f6a2ac2},
  intrahash = {4924a7de6a5d733f79aafe26d7146416},
  journal = {Journal of Statistical Mechanics: Theory and Experiment},
  pages = {P09008},
  publisher = {Institute of Physics Publishing},
  title = {{Comparing community structure identification}},
  volume = 9,
  year = 2005
}

@article{GirNew02,
  author = {Girvan, M. and Newman, M. E. J.},
  interhash = {ecd7a48a37f660ab421472140168c892},
  intrahash = {ec20851eb4909dd27cefec2dc9883fa4},
  journal = {PNAS},
  month = {June},
  number = 12,
  pages = {7821-7826},
  title = {Community structure in social and biological networks},
  volume = 99,
  year = 2002
}

@inproceedings{coclustering01,
  address = {New York, NY, USA},
  author = {Dhillon, Inderjit S.},
  booktitle = {KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining},
  citeulike-article-id = {1168281},
  doi = {10.1145/502512.502550},
  interhash = {d112b6041dab4b4677368c7bf101f1ee},
  intrahash = {f07d9cc4813f3ecda75e6f0c8025cece},
  isbn = {158113391X},
  pages = {269--274},
  priority = {2},
  publisher = {ACM Press},
  title = {Co-clustering documents and words using bipartite spectral graph partitioning},
  url = {http://portal.acm.org/citation.cfm?id=502512.502550},
  year = 2001
}

@article{fiedler1973acg,
  author = {Fiedler, M.},
  interhash = {7747a5cdabc3de597c1ea135af0af003},
  intrahash = {fa3b9893724c88593d659fdaf761671b},
  journal = {Czechoslovak Mathematical Journal},
  number = 98,
  pages = {298--305},
  title = {{Algebraic connectivity of graphs}},
  volume = 23,
  year = 1973
}

@article{1288832,
  address = {Hingham, MA, USA},
  author = {Luxburg, Ulrike},
  doi = {http://dx.doi.org/10.1007/s11222-007-9033-z},
  interhash = {ea91cbed60cf8e3dd610a1829afff18f},
  intrahash = {2f579735afb8bbba1da168f1b83e10c7},
  issn = {0960-3174},
  journal = {Statistics and Computing},
  number = 4,
  pages = {395--416},
  publisher = {Kluwer Academic Publishers},
  title = {A tutorial on spectral clustering},
  url = {http://portal.acm.org/citation.cfm?id=1288832},
  volume = 17,
  year = 2007
}

@article{filippone2008ska,
  author = {Filippone, M. and Camastra, F. and Masulli, F. and Rovetta, S.},
  interhash = {3f9fe20110b6e183530cd675bb0ba3e6},
  intrahash = {30fe8946a31d33d0fa81c16ec04287aa},
  journal = {Pattern recognition},
  number = 1,
  pages = {176--190},
  publisher = {Elsevier},
  title = {{A survey of kernel and spectral methods for clustering}},
  volume = 41,
  year = 2008
}

@article{white2005sca,
  author = {White, S. and Smyth, P.},
  booktitle = {SIAM Data Mining},
  interhash = {180d37026ab6ea4f4c3f6aba9c405929},
  intrahash = {310763d5fe7195d89883c91c90681e03},
  title = {{A spectral clustering approach to finding communities in graph}},
  year = 2005
}

@article{verma2003csc,
  author = {Verma, D. and Meila, M.},
  interhash = {dbf30d8faf00e7187c8e6b620c455b9a},
  intrahash = {829d5543415a8d8cd6c0db75c025c9d3},
  journal = {University of Washington, Tech. Rep. UW-CSE-03-05-01},
  title = {{A comparison of spectral clustering algorithms}},
  year = 2003
}