@inproceedings{baur2007generating,
  abstract = {The modeling of realistic networks is of great importance for modern complex systems research. Previous procedures typically model the natural growth of networks by means of iteratively adding nodes, geometric positioning information, a definition of link connectivity based on the preference for nearest neighbors or already highly connected nodes, or combine several of these approaches. Our novel model is based on the well-know concept of k-cores, originally introduced in social network analysis. Recent studies exposed the significant k-core structure of several real world systems, e.g. the AS network of the Internet. We present a simple and efficient method for generating networks which strictly adhere to the characteristics of a given k-core structure, called core fingerprint. We show-case our algorithm in a comparative evaluation with two well-known AS network generators. },
  author = {Baur, Michael and Gaertler, Marco and Görke, Robert and Krug, Marcus and Wagner, Dorothea},
  booktitle = {Proceedings of the European Conference of Complex Systems},
  interhash = {387eebb80bbfaafab5ac201c88ebd263},
  intrahash = {e2fef8dce15087afbcc3489f2029d2c6},
  month = oct,
  title = {Generating Graphs with Predefined k-Core Structure},
  url = {http://i11www.ira.uka.de/extra/publications/bggkw-ggpcs-07.pdf},
  year = 2007
}

@incollection{springerlink:10.1007/978-3-540-74839-7_12,
  abstract = {Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the complex systems literature, although its properties are not well understood. We study the problem of finding clusterings with maximum modularity, thus providing theoretical foundations for past and present work based on this measure. More precisely, we prove the conjectured hardness of maximizing modularity both in the general case and with the restriction to cuts, and give an Integer Linear Programming formulation. This is complemented by first insights into the behavior and performance of the commonly applied greedy agglomaration approach.},
  address = {Berlin / Heidelberg},
  affiliation = {Department of Computer and Information Science, University of Konstanz},
  author = {Brandes, Ulrik and Delling, Daniel and Gaertler, Marco and Görke, Robert and Hoefer, Martin and Nikoloski, Zoran and Wagner, Dorothea},
  booktitle = {Graph-Theoretic Concepts in Computer Science},
  doi = {10.1007/978-3-540-74839-7_12},
  editor = {Brandstädt, Andreas and Kratsch, Dieter and Müller, Haiko},
  interhash = {b335302041d1865d7cfec7467e8e2999},
  intrahash = {6fd10991ee4e3880c64c11862884ead7},
  isbn = {978-3-540-74838-0},
  keyword = {Computer Science},
  openurl = {http://www.blub.de},
  pages = {121-132},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {On Finding Graph Clusterings with Maximum Modularity},
  url = {http://dx.doi.org/10.1007/978-3-540-74839-7_12},
  volume = 4769,
  year = 2007
}

@inproceedings{delling2007engineeringa,
  author = {Delling, Daniel and Gaertler, Marco and G{\"o}rke, Robert and Nikoloski, Zoran and Wagner, Dorothea},
  booktitle = {Proceedings of the European Conference of Complex Systems (ECCS'07)},
  interhash = {5c88c6ad4f9a66de094125b3ce600a55},
  intrahash = {fa6b1f4966b69da84f9582c2aba82cab},
  month = {October},
  note = {as poster},
  pdf = {http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/dggnw-eect-07_poster.pdf},
  title = {Engineering the Evaluation of Clustering Techniques},
  url = {http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/dggnw-eect-07_poster.pdf},
  year = 2007
}

@inproceedings{delling2007engineering,
  author = {Delling, Daniel and Gaertler, Marco and G{\"o}rke, Robert and Wagner, Dorothea},
  booktitle = {Proceedings of the European Conference of Complex Systems (ECCS'07)},
  interhash = {b0b92b2ead46ef60435173a6fb803045},
  intrahash = {48417fa551e51439159e5fdd575825df},
  month = {October},
  note = {as poster},
  pdf = {http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/dggw-ecgc-07_poster.pdf},
  title = {Engineering Comparators for Graph Clusterings},
  url = {http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/dggw-ecgc-07_poster.pdf},
  year = 2007
}