• K.A. Zweig: "Good versus optimal: Why network analytic methods need more systematic evaluation", Central European Journal of Computer Science, 1, p. 137-153, Jan. 2011 PDF version, more...
  • K.A. Zweig and Michael Kaufmann: "A systematic approach to the one-mode projection of bipartite graphs", Social Network Analysis and Mining, 1, p. 187-218, Jan. 2011
    PDF version


  • K.A. Zweig, Gergely Palla and Tamas Vicsek: "What makes a phase transition?", Physical Review A, 389, 1501--1511, 2010 PDF version
  • Sudarshan R. Iyengar, K.A. Zweig, Abhiram Natarajan, and C.E. Veni Madhavan: "A network analysis approach to understand the human-wayfinding problem", Proceedings of the 33rd annual meeting of the Cognitive Science Society, 2011 PDF version .
  • K.A. Zweig (Invited for publication in a special issue of 'Social Network Analysis and Mining'): "How to forget the second side of the story - A new method for the one-mode projection of bipartite graphs", Proceedings of the second International Conference on Advances in Social Network Analysis and Mining (ASONAM'10), pp. 200-207, IEEE Computer Society, 2010 PDF version
  • Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis and Katharina Zweig: "Drawing Trees in a Streaming Model", Proceedings of the 76th International Symposium on Graph Drawing (GD'09), 2010




  • Johannes Putzke, Thomas Seehawer, K.A. Zweig and Kai Fischbach: "Patent Citation and Corporate Market Value -- A Study Using Social Network Analysis", Proceedings of the 4th Conference on Applications of Social Networks Analysis (ASNA), 2007

  • K.A. Lehmann and Stephan Kottler: "Visualizing Large and Complex Networks", Proceedings of the 14th International Symposium on Graph Drawing (GD'06), 2007

    PDF version


  • K.A. Lehmann, Michael Kaufmann, Stephan Steigele and Kay Nieselt: "On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences", Algorithms For Molecular Biology 1, 9, 2006, PDF version

  • K.A. Lehmann, Hendrik Post, Michael Kaufmann: "Hybrid Graphs as a Framework for the Small-World Effect", Physical Review E 73, 056108, 2006

    PDF version
  • Guiseppe DiBattista, P. Francesco Cortese, Francesco Frati, Luca Grilli, K.A. Lehmann, Guiseppe Liotta, Ian Tollis: "On the Topologies of Local Minimum Spanning Trees", Proceedings of the 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN'06), 2006

    PDF version
  • Michael Kaufmann, Jan Kratochvil, K.A. Lehmann, and Amarendran Subramanian: "Max-Tolerance Graphs as Intersection Graphs: Cliques, Cycles, and Recognition", Proceedings of the 17th ACM Symposium on Discrete Algorithms (SODA'06), 2006

    PDF version



  • Eva Herker, H. Jungwirth, K.A. Lehmann K.A., Corinna Maldener, Kai-Uwe Fröhlich, Silke Wissing, Stephan Buttner, Markus Fehr, S. Sigrist, Francesco Madeo: "Chronological aging leads to apoptosis in yeast", Journal of Cell Biology 164(4), 501-507, 2004



  • K.A. Zweig: "On local behavior and global structures in the evolution of complex networks", Ph.D. thesis, University of Tübingen, 2007.

    PDF version