2006 |
12 | EE | 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 |
11 | EE | Katharina Anna Lehmann,
Stephan Kottler:
Visualizing Large and Clustered Networks.
Graph Drawing 2006: 240-251 |
10 | EE | 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 |
9 | EE | 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 |
8 | EE | Katharina Anna Lehmann,
Michael Kaufmann:
Evolutionary algorithms for the self-organized evolution of networks.
GECCO 2005: 563-570 |
7 | EE | Katharina Anna Lehmann:
Why simulating evolutionary processes is just as interesting as applying them.
GECCO Workshops 2005: 370-373 |
6 | EE | Olaf Landsiedel,
Katharina Anna Lehmann,
Klaus Wehrle:
T-DHT: Topology-based Distributed Hash Tables.
Peer-to-Peer Computing 2005: 143-144 |
5 | EE | Katharina Anna Lehmann,
Michael Kaufmann:
Random Graphs, Small-Worlds and Scale-Free Networks.
Peer-to-Peer Systems and Applications 2005: 57-76 |
4 | EE | 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 |
3 | EE | Dirk Koschützki,
Katharina Anna Lehmann,
Leon Peeters,
Stefan Richter,
Dagmar Tenfelde-Podehl,
Oliver Zlotowski:
Centrality Indices.
Network Analysis 2004: 16-61 |
2 | EE | Riko Jacob,
Dirk Koschützki,
Katharina Anna Lehmann,
Leon Peeters,
Dagmar Tenfelde-Podehl:
Algorithms for Centrality Indices.
Network Analysis 2004: 62-82 |
1 | EE | Dirk Koschützki,
Katharina Anna Lehmann,
Dagmar Tenfelde-Podehl,
Oliver Zlotowski:
Advanced Centrality Concepts.
Network Analysis 2004: 83-111 |