Katharina Anna Zweig

Katharina Anna Lehmann

	2012
j5		Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig: Drawing trees in a streaming model. Inf. Process. Lett. 112(11): 418-422 (2012)
	2011
j4		Katharina Anna Zweig: Good versus optimal: Why network analytic methods need more systematic evaluation. Central Europ. J. Computer Science 1(1): 137-153 (2011)
j3		Katharina Anna Zweig, Michael Kaufmann: A systematic approach to the one-mode projection of bipartite graphs. Social Netw. Analys. Mining 1(3): 187-218 (2011)
	2010
c15		Katharina Anna Zweig: How to Forget the Second Side of the Story: A New Method for the One-Mode Projection of Bipartite Graphs. ASONAM 2010: 200-207
i2		Katharina Anna Zweig, Gergely Palla, Tamás Vicsek: What makes a phase transition? Analysis of the random satisfiability problem. CoRR abs/1002.0217 (2010)
	2009
j2		Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn, Dimitrios Michail, Romeo Rizzi, Torsten Ueckerdt, Katharina Anna Zweig: Cycle bases in graphs characterization, algorithms, complexity, and applications. Computer Science Review 3(4): 199-243 (2009)
c14		Michael Kaufmann, Katharina Anna Zweig: Modeling and Designing Real-World Networks. Algorithmics of Large and Complex Networks 2009: 359-379
c13		Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig: Drawing Trees in a Streaming Model. Graph Drawing 2009: 292-303
e1		Jürgen Lerner, Dorothea Wagner, Katharina Anna Zweig (Eds.): Algorithmics of Large and Complex Networks - Design, Analysis, and Simulation [DFG priority program 1126]. Lecture Notes in Computer Science 5515, Springer 2009, isbn 978-3-642-02093-3
	2008
c12		Katharina Anna Zweig, Karin Zimmermann: Wanderer between the Worlds - Self-Organized Network Stability in Attack and Random Failure Scenarios. SASO 2008: 309-318
	2006
j1		Katharina Anna Lehmann, Michael Kaufmann, Stephan Steigele, Kay Nieselt: On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences. Algorithms for Molecular Biology 1 (2006)
c11		Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta: On the Topologies of Local Minimum Spanning Trees. CAAN 2006: 31-44
c10		Katharina Anna Lehmann, Stephan Kottler: Visualizing Large and Clustered Networks. Graph Drawing 2006: 240-251
c9		Michael Kaufmann, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran R. Subramanian: Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. SODA 2006: 832-841
	2005
c8		Sándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann: A New Approach for Boundary Recognition in Geometric Sensor Networks. CCCG 2005: 84-87
c7		Katharina Anna Lehmann: Why simulating evolutionary processes is just as interesting as applying them. GECCO Workshops 2005: 370-373
c6		Katharina Anna Lehmann, Michael Kaufmann: Evolutionary algorithms for the self-organized evolution of networks. GECCO 2005: 563-570
c5		Katharina Anna Lehmann, Michael Kaufmann: Random Graphs, Small-Worlds and Scale-Free Networks. Peer-to-Peer Systems and Applications 2005: 57-76
c4		Olaf Landsiedel, Katharina Anna Lehmann, Klaus Wehrle: T-DHT: Topology-based Distributed Hash Tables. Peer-to-Peer Computing 2005: 143-144
i1		Sándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann: A New Approach for Boundary Recognition in Geometric Sensor Networks. CoRR abs/cs/0508006 (2005)
	2004
c3		Dirk Koschützki, Katharina Anna Lehmann, Leon Peeters, Stefan Richter, Dagmar Tenfelde-Podehl, Oliver Zlotowski: Centrality Indices. Network Analysis 2004: 16-61
c2		Riko Jacob, Dirk Koschützki, Katharina Anna Lehmann, Leon Peeters, Dagmar Tenfelde-Podehl: Algorithms for Centrality Indices. Network Analysis 2004: 62-82
c1		Dirk Koschützki, Katharina Anna Lehmann, Dagmar Tenfelde-Podehl, Oliver Zlotowski: Advanced Centrality Concepts. Network Analysis 2004: 83-111

Coauthor Index

Colors in the list of coauthors

Last update Sat May 25 02:37:52 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page