2022

• Hanna Hoffmann, Verena Vogt, Marc P. Hauer, Katharina Zweig. Fairness by awareness? On the inclusion of protected features in algorithmic decisions. In: Computer Law & Security Review. Elsevir. Preprint.

2021

• Lisa Jöckel, Thomas Bauer, Michael Kläs, Marc P. Hauer, Janek Groß. Towards a Common Testing Terminology for Software Engineering and Artificial Intelligence Experts. In: International Conference on Product-Focused Software Process Improvement. Springer.

• Marc P. Hauer, Johannes Kevekordes, Maryam Amir Haeri. Legal perspective on possible fairness measures – A legal discussion using the example of hiring decisions. In: Computer Law & Security Review. Elsevir. Preprint.

• Marc P Hauer, Rasmus Adler, Katharina Zweig. Assuring Fairness of Algorithmic Decision Making. In: 2021 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW). S. 110-113. IEEE. Author version.

• Tobias D. Krafft, Martin Reber, Roman Krafft, Anna Coutrier, Katharina A. Zweig. Crucial Challenges in Large-Scale Black Box Analyses. In: International Workshop on Algorithmic Bias in Search and Recommendation. S. 143-155. Springer, Cham.

• Pascal D König, Tobias D Krafft. Evaluating the evidence in algorithmic evidence-based decision-making: the case of US pretrial risk assessment tools In: Current Issues in Criminal Justice. S1-23. 2021.

2020

• Adam Harkens, Karen Yeung, Anja Achtziger, Julia Felfel, Tobias Krafft, Pascal Koenig, Johannes Schmees, Wolfgang Schultz, Georg Wenzelburger, Katharina Zweig. The rise of ai-based decision-making tools in the criminal justice: Implications for judicial integrity In: Commonwealth Judicial Journal, 25(2), 2020.

• Tobias D Krafft, Katharina A Zweig, Pascal D König. How to regulate algorithmic decision‐making: A framework of regulatory requirements for different applications Regulation & Governance (2020).

• Marc P. Hauer, Xavier CR Hofmann, Tobias D. Krafft, Katharina A Zweig. Quantitative analysis of automatic performance evaluation systems based on the h-index. In: Scientometrics. S. 735-751. Springer & Akadémiai Kiadó.

• Tobias D. Krafft, Marc P. Hauer, Katharina A. Zweig. Why Do We Need to Be Bots? What Prevents Society from Detecting Biases in Recommendation Systems. In: International Workshop on Algorithmic Bias in Search and Recommendation. S. 27-34. Springer, Cham. Author version.

• Martin Reber, Tobias D Krafft, Roman Krafft, Katharina A Zweig, Anna Couturier. Data Donations for Mapping Risk in Google Search of Health Queries: A case study of unproven stem cell treatments in SEM In: 2020 IEEE Symposium Series on Computational Intelligence (SSCI). S2985-2992. Preprint.

2020

• Tobias D Krafft, Michael Gamer, Katharina A Zweig. What did you see? a study to measure personalization in google’s search engine.. In: EPJ Data Science, 8(1):38, 2019.

2018

• Katharina A. Zweig. Friedkin (1983): Horizons of Observability and Limits of Informal Control in Organizations. In: Holzer B., Stegbauer C. (eds) Schlüsselwerke der Netzwerkforschung. S. 213-215. 2018.
• Katharina A. Zweig. Milo et al. (2002): Network Motifs: Simple Building Blocks of Complex Networks. In: Holzer B., Stegbauer C. (eds) Schlüsselwerke der Netzwerkforschung. S. 411-413. 2018.

• Tobias D. Krafft, Katharina A. Zweig. Wie Gesellschaft algorithmischen Entscheidungen auf den Zahn fühlen kann. In: Resa Mohabbat Kar, Basanta E. P. Thapa, and Peter Parycek, editors, (Un)berechenbar? Algorithmen und Automatisierung in Staat und Gesellschaft, pages 204–227. Fraunhofer-Institut für Offene Kommunikationssysteme FOKUS, Kompetenzzentrum Öffentliche IT (ÖFIT), Berlin, 2018.

• Katharina A. Zweig, Tobias D. Krafft. Fairness und Qualität algorithmischer Entscheidungen.. In: Resa Mohabbat Kar, Basanta E. P. Thapa, and Peter Parycek, editors, (Un)berechenbar? Algorithmen und Automatisierung in Staat und Gesellschaft, pages 204–227. Fraunhofer-Institut für Offene Kommunikationssysteme FOKUS, Kompetenzzentrum Öffentliche IT (ÖFIT), Berlin, 2018.

• Katharina A. Zweig, Georg Wenzelburger, Tobias D. Krafft. On chances and risks of security related algorithmic decision making systems. European Journal for Security Research, 10.1007/s41125-018-0031-2. 2018.

2017

• Tobias D. Krafft, Katharina Zweig. Ein Faktencheck - Ließ ein Algorithmus Trump triumphieren? In: Informatik-Spektrum 40(4):336–344, 2017.

• Katharina Zweig, Oliver Deussen, Tobias D. Krafft. Algorithmen und meinungsbildung. In: Informatik-Spektrum 40(4):318–326, 2017.

• Eduard C. Groen, Slywia Kopczyńska, Marc P. Hauer, Tobias D. Krafft, Jörg Dörr. Users — The Hidden Software Product Quality Experts?: A Study on How App Users Report Quality Aspects in Online Reviews. In: 2017 IEEE 25th International Requirements Engineering Conference (RE). S. 80-89. IEEE. Author version.

• Bernhard Sick, Sarah Oeste-Reiß, Albrecht Schmidt, Sven Tomforde, Katharina A. Zweig. Collaborative Interactive Learning.Informatik Spektrum 41(10). 2017.

• Mohammed Abufouda, Hadil Abukwaik. On Using Network Science in Mining Developers Collaboration in Software Engineering: A Systematic Literature Review. International Journal of Data Mining & Knowledge Management Process (IJDKP) Vol.7. No.5/6. 2017.
• Mohammed Abufouda. Community Aliveness: Discovering Interaction Decay Patterns in Online Social Communities. 4th European Network Intelligence Conference. 2017.

• Kevin Wilhelm Bähner, Katharina A. Zweig, Inara Leal, Rainer Wirth. Robustness of plant–insect herbivore interaction networks to climate change in a fragmented temperate forest landscape. Bulletin of Entomological Research. 107(5):1-10. 2017.
• Mohammed Abufouda, Katharina A. Zweig. Stochastic Modeling of the Decay Dynamics of Online Social Networks. Complex Networks VIII: Proceedings of the 8th Conference on Complex Networks CompleNet 2017. pp.119-131. 2017.
• Mareike Bockholt, Katharina A. Zweig. Paths in Complex Networks In: Alhajj R., Rokne J. (eds) Encyclopedia of Social Network Analysis and Mining. Springer. 2017.
• Mareike Bockholt and Katharina A. Zweig. Process-driven betweenness centrality measures. In 4th European Network Intelligence Conference. Lecture Notes on Social Networks, Springer, 2017.
• Sude Tavassoli and Katharina A. Zweig. Fuzzy Centrality Evaluation in Complex and Multiplex Networks. In Workshop on Complex Networks (CompleNet). Springer, 2017.
• Christian Brugger, Valentin Grigorovici, Matthias Jung, Christian De Schryver, Christian Weisand, Norbert Wehn, and Katharina A. Zweig. A Memory Centric Architecture of the Link Assessment Algorithm in Large Graphs. In IEEE Design & Test, vol. PP, no. 99, pp. 1-1. 2017.

• Oliver Deussen, Katharina Anna Zweig: Algorithmen und Meinungsbildung. Informatik Spektrum 40(4): 317 (2017)
• Katharina Anna Zweig, Oliver Deussen, Tobias D. Krafft: Algorithmen und Meinungsbildung - Eine grundlegende Einführung. Informatik Spektrum 40(4): 318-326 (2017)
• Mohammed Abufouda, Katharina Anna Zweig: Link Classification and Tie Strength Ranking in Online Social Networks with Exogenous Interaction Networks. CoRR abs/1708.04030 (2017).

• Tobias D. Krafft, Katharina Anna Zweig: Ein Faktencheck - Ließ ein Algorithmus Trump triumphieren? Informatik Spektrum 40(4): 336-344 (2017).

• Katharina Emmerich, Natalya Bogacheva, Mareike Bockholt, Viktor Wendel. Operationalization and Measurement of Evaluation Constructs. In: Dörner R., Göbel S., Kickmeier-Rust M., Masuch M., Zweig K. (eds) Entertainment Computing and Serious Games. Lecture Notes in Computer Science, vol 9970. Springer. 2016
• Katharina Emmerich, Mareike Bockholt Serious Games Evaluation: Processes, Models, and Concepts. In: Dörner R., Göbel S., Kickmeier-Rust M., Masuch M., Zweig K. (eds) Entertainment Computing and Serious Games. Lecture Notes in Computer Science, vol 9970. 2016.
• Adrian Calma, Jan Marco Leimeister, Paul Lukowicz, Sarah Oeste-Reiß, Tobias Reitmaier, Albrecht Schmidt, Bernhard Sick, Gerd Stumme, Katharina Anna Zweig. From Active Learning to Dedicated Collaborative Interactive Learning. 4th International Workshop on Self-Optimisation in Autonomic and Organic Computing Systems (SAOS). 2016.
• Spitz A, Gimmler A, Stoeck T, Zweig K A, Horvát E-A. Assessing Low-Intensity Relationships in Complex Networks. PLOS ONE 11(4): e0152536. 2016. https://doi.org/10.1371/journal.pone.0152536
• Katharina Anna Zweig: Network Analysis Literacy - A Practical Approach to the Analysis of Networks. Lecture Notes in Social Networks, Springer 2016, ISBN 978-3-7091-0740-9, pp. 3-485. 2016.
• Wolfgang Eugen Schlauch, Katharina Anna Zweig: Motif detection speed up by using equations based on the degree sequence. Social Netw. Analys. Mining 6(1): 47:1-47:20 (2016)
• Christian Brugger, André Lucas Chinazzo, Alexandre Flores John, Christian de Schryver, Norbert Wehn, Wolfgang Eugen Schlauch, Katharina Anna Zweig: Increasing sampling efficiency for the fixed degree sequence model with phase transitions. Social Netw. Analys. Mining 6(1): 100:1-100:14 (2016)
• Sude Tavassoli, Katharina Anna Zweig: Analyzing Multiple Rankings of Influential Nodes in Multiplex Networks. COMPLEX NETWORKS 2016: 135-146. 2016.
• Mareike Bockholt, Katharina Anna Zweig: Clustering of Paths in Complex Networks. COMPLEX NETWORKS 2016: 183-195. 2016.
• Sude Tavassoli, Katharina Anna Zweig: Most Central or Least Central? How Much Modeling Decisions Influence a Node's Centrality Ranking in Multiplex Networks. ENIC 2016: 25-32. 2016.
• Gernot Bahle, Adrian Calma, Jan Marco Leimeister, Paul Lukowicz, Sarah Oeste-Reiss, Tobias Reitmaier, Albrecht Schmidt, Bernhard Sick, Gerd Stumme, Katharina Anna Zweig: Lifelong Learning and Collaboration of Smart Technical Systems in Open-Ended Environments - Opportunistic Collaborative Interactive Learning. ICAC 2016: 315-324. 2016.
• Ralf Dörner, Stefan Göbel, Michael D. Kickmeier-Rust, Maic Masuch, Katharina Anna Zweig: Entertainment Computing and Serious Games - International GI-Dagstuhl Seminar 15283, Dagstuhl Castle, Germany, July 5-10, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9970, 2016, ISBN 978-3-319-46151-9
• Zweig, K. A. Chapter: " Are word-adjacency networks networks?"
  in the book: "Towards a Theoretical Framework for Analyzing Complex Linguistic Networks" edited by Alexander Mehler et al., Springer Verlag, Heidelberg, Germany, 2016, 153-163
• Mohammed Abufouda, Katharina Anna Zweig: A Theoretical Model for Understanding the Dynamics of Online Social Networks Decay. CoRR abs/1610.01538 (2016)

• Christan Brugger, Valention Grigorovici, Matthias Jung, Christian Weis, Christian De Schryver, Katharina A. Zweig, Norbert Wehn. An Optimal Microarchitecture for Finding Similarities in Complex Networks Based on Optimal Memory Hierarchies WIP, IEEE/ACM Design Automation Conference (DAC). 2015.
• Abufouda, M & Zweig, K. A.: Are We Really Friends?: Link Assessment in Social Networks Using Multiple Associated Interaction Networks. WWW '15 Companion Proceedings of the 24th International Conference on World Wide Web: 771-776. 2015.
• Sude Tavassoli and Katharina Anna Zweig, " Analyzing the activity of a person in a chat by combining network analysis and fuzzy logic", in Advances in Social Networks Analysis and Mining (ASONAM), 2015 IEEE/ACM International Conference,  pp.1565-1568, 25-28 Aug. 2015. doi: 10.1145/2808797. 2809335
• Bockholt, Mareike, and Katharina Anna Zweig. Why Is This So Hard? Insights from the State Space of a Simple Board Game. Serious Games. Springer International Publishing, 2015. 147-157. [PDF version]
• Bockholt, Mareike, and Katharina Anna Zweig. A graph theoretical approach for exploring a board game's complexity. GI-Edition, Lecture Notes in Informatics. Informatiktage 2014. [PDF version]
• Schlauch, W. E. & Zweig, K. A. : Influence of the Null-Model on Motif Detection.
  Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Network Analysis and Mining, 2015
• Schlauch, W. E. & Zweig, K. A. : Social Network Analysis and Gaming: Survey of the Current State of the Art. Proceedings of the 1st Joint International Conference on Serious Games, 2015, 158-168
• Brugger, C.; Chinazzo, A. L.; John, A. F.; Schryver, C. D.; Wehn, N.; Spitz, A. & Zweig, K. A.: Exploiting Phase Transitions for the Efficient Sampling of the Fixed Degree Sequence Model, Proceedings of the Advances of Social Network Analysis and Mining (ASONAM'15), 2015
  [PDF version]
• Brugger, C.; Grigorovici, V.; Jung, M.; Weis, C.; Schryver, C. D.; Zweig, K. A. & Wehn, N. : A Custom Computing System for Finding Similarities in Complex Networks. Proceedings of the IEEE Computer Society Annual Symposium on VLSI, 2015.
  [PDF version]
• Zweig, K. A. : Von der theoretischen Informatik zur Sozioinformatik --- und zurück. Informatik Spektrum, 2015, 1, 28-30
  [PDF version]
• Schlauch, W.; Zweig, K. & Horvát, E.-Á. : Different Flavors of Randomness. Social Network Analysis and Mining, 2015, 5, eid: 36

• Mohammed Abufouda. Quality-aware Approach for Engineering Self-adaptive Software Systems. Third International Conference on Information Technology Convergence and Services. S. 173-181.

• Neuser, W.; Zweig, K. A.; Scholtes, I.; Pipek, V. & Rohde, M. (Eds.): "Proceedings of the first workshop on ``Socioinformatics'' 2013",Springer Verlag, Heidelberg, 2014
• Katharina Anna Zweig: Network analysis literacy, data analysis literacy, and socioinformatics. it - Information Technology 56(5): 255-258 (2014)
• Mohammed Abufouda, Katharina Anna Zweig: Interactions around social networks matter: Predicting the social network from associated interaction networks. ASONAM 2014: 142-145
• Sude Tavassoli, Markus Moessner, Katharina Anna Zweig: Constructing social networks from semi-structured chat-log data. ASONAM 2014: 146-149
• Emoke-Ágnes Horvát, Katharina Anna Zweig: Multiplex Networks. Encyclopedia of Social Network Analysis and Mining 2014. 1019-1023
• Katharina Anna Zweig: Network Representations of Complex Data. Encyclopedia of Social Network Analysis and Mining 2014. 1102-1113

   

• Emoke-Ágnes Horvát, Katharina Anna Zweig: A fixed degree sequence model for the one-mode projection of multiplex bipartite graphs. Social Netw. Analys. Mining 3(4): 1209-1224 (2013)
• Andreas Spitz, Katharina Anna Zweig, Emoke-Ágnes Horvát: SICOP: identifying significant co-interaction patterns. Bioinformatics 29(19): 2503-2504 (2013)

• Emöke-Ágnes Horvát, Michael Hanselmann, Katharina Zweig, and Fred Hamprecht: "One plus one makes three (for social networks)", PLoS ONE 7(4): e34740. doi:10.1371/journal.pone.0034740, 2012.

  PDF version, Media coverage of this article, more...

• Stefan Uhlmann, Heiko Mannsperger, Jitao David Zhang, Emöke-Ágnes Horvát, Christian Schmidt, Moritz Küblbeck, Frauke Henjes, Aoife Ward, Ulrich Tschulena, Katharina Zweig, Ulrike Korf, Stefan Wiemann, and Özgür Sahin: "Global microRNA level regulation of EGFR-driven cell-cycle protein network in breast cancer", Molecular Systems Biology 8:569, doi: 10.1038/msb.2012.2, 2012

  PDF version, Media coverage of this article, more...

• S. R. Sudarshan Iyengar, C. E. Veni Madhavan, Katharina A. Zweig and Abhiram Natarajan: "Understanding Human Navigation Using Network Analysis", Topics in Cognitive Science 4(1), p. 121-134, 2012. DOI: 10.1111/j.1756-8765.2011.01178.x

  PDF version, Media coverage of this article, more...
   

• 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

• Jürgen Lerner, Dorothea Wagner, K.A. Zweig (Eds.): Algorithmics of Large and Complex Networks, LNCS 5515, Springer Verlag, Berlin, 2009.
• Laszlo A. Zahoránszky, Gyula Y. Katona, Peter Hari, Andras Malnasi-Csizmadia, Katharina A. Zweig, Gergely Zahoranszky-Koehalmi. Breaking the Hierarchy - A New Cluster Selection Mechanism for Hierarchical Clustering Methods. Algorithms For Molecular Biology 4, 12, 2009 (open access)
• Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, R. Rizzi, Thomas Ueckerdt and K.A. Zweig. Cycle bases in graphs: characterization, algorithms, complexity, and applications. Computer Science Review 3, 199-243, 2009
• Michael Kaufmann, K.A. Zweig: Modeling and Designing Real-World Networks . In: Algorithmics of Large and Complex Networks (J. Lerner, D. Wagner, K. Zweig (Eds.)), LNCS 5515, Springer Verlag Berlin, 2009

• K.A. Zweig and Karin Zimmermann: "Wanderer between the Worlds -- Self-Organized Network Stability in Attack and Random Failure Scenarios", Proceedings of the Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO'08), 2008

  PDF version

• K.A. Zweig: "To Cluster or not to Cluster - A Meta-Analytic Approach", Proceedings of the 5th European Conference on Complex Systems (ECCS'08), 2008

  PDF version

• 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

• K.A. Lehmann, Michael Kaufmann: "Evolutionary Algorithms for the Self-Organized Evolution of Networks", Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'05), 2005

  PDF version

• Sandor Fekete, Michael Kaufmann, Alexander Kröller, K.A. Lehmann: "A New Approach for Boundary Recognition in Geometric Sensor Networks", Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), 2005

  PDF version

• Olaf Landsiedel, Klaus Wehrle, K.A. Lehmann: "T-DHT: Topology Based Distributed Hash-Tables" (Poster), Proceedings of Fifth International IEEE Conference on Peer-to-Peer-Computing, 2005

  PDF version

• Michael Kaufmann, K.A. Lehmann, Andreas Gerasch: "Area-optimal HV-Like Tree Drawings with a fixed aspect ratio", Proceedings of the 31st Conference on Current Trends in Theory and Practice of Computer Science, 2005

• Dirk Koschützki, K.A. Lehmann, Leon Peeters,Stefan Richter, Dagmar Tenfelde-Podehl, Oliver Zlotowski: "Centrality Indices", In: Network Analysis - LNCS Volume 3418, editors: Ulrik Brandes and Thomas Erlebach, 2005

  PDFs of all three chapters + references (zip)

• Riko Jacob, Dirk Koschützki, K.A. Lehmann, Leon Peeters, Dagmar Tenfelde-Podehl: "Algorithms for Centrality Indices", In: Network Analysis - LNCS Volume 3418, editors: Ulrik Brandes and Thomas Erlebach, 2005

  PDFs of all three chapters + references (zip)

• Dirk Koschützki, K.A. Lehmann, Dagmar Tenfelde-Podehl, Oliver Zlotowski: "Advanced Centrality Concepts", In: Network Analysis - LNCS Volume 3418, editors: Ulrik Brandes and Thomas Erlebach, 2005

  PDFs of all three chapters + references (zip)

• K.A. Lehmann and Michael Kaufmann: "Random Graphs, Small Worlds, and Scale-Free Networks", In: "Peer-to-Peer Systems and Applications - LNCS Volume 3485", editors: Ralf Steinmetz and Klaus Wehrle, 2005.

• 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

• Madeo, F.; Engelhardt, S.; Herker, E.; Lehmann, N.; Maldener, C.; Proksch, A.; Wissing, S. & Fröhlich, K.-U. "Apoptosis in yeast: a new model system with applications in cell biology and medicine". Current Genetics, 2002, 41, 208-216

Thesis

• 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

---