The SCEAS System
| |||||||

## Search the dblp DataBase
Katharina Anna Lehmann:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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.**[Citation Graph (0, 0)][DBLP] CAAN, 2006, pp:31-44 [Conf] - Sándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann
**A New Approach for Boundary Recognition in Geometric Sensor Networks.**[Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:84-87 [Conf] - Riko Jacob, Dirk Koschützki, Katharina Anna Lehmann, Leon Peeters, Dagmar Tenfelde-Podehl
**Algorithms for Centrality Indices.**[Citation Graph (0, 0)][DBLP] Network Analysis, 2004, pp:62-82 [Conf] - Dirk Koschützki, Katharina Anna Lehmann, Leon Peeters, Stefan Richter, Dagmar Tenfelde-Podehl, Oliver Zlotowski
**Centrality Indices.**[Citation Graph (0, 0)][DBLP] Network Analysis, 2004, pp:16-61 [Conf] - Dirk Koschützki, Katharina Anna Lehmann, Dagmar Tenfelde-Podehl, Oliver Zlotowski
**Advanced Centrality Concepts.**[Citation Graph (0, 0)][DBLP] Network Analysis, 2004, pp:83-111 [Conf] - Katharina A. Lehmann, Stephan Kottler
**Visualizing Large and Clustered Networks.**[Citation Graph (0, 0)][DBLP] Graph Drawing, 2006, pp:240-251 [Conf] - Katharina A. Lehmann
**Why simulating evolutionary processes is just as interesting as applying them.**[Citation Graph (0, 0)][DBLP] GECCO Workshops, 2005, pp:370-373 [Conf] - Katharina Anna Lehmann, Michael Kaufmann
**Evolutionary algorithms for the self-organized evolution of networks.**[Citation Graph (0, 0)][DBLP] GECCO, 2005, pp:563-570 [Conf] - Olaf Landsiedel, Katharina Anna Lehmann, Klaus Wehrle
**T-DHT: Topology-based Distributed Hash Tables.**[Citation Graph (0, 0)][DBLP] Peer-to-Peer Computing, 2005, pp:143-144 [Conf] - Katharina Anna Lehmann, Michael Kaufmann
**Random Graphs, Small-Worlds and Scale-Free Networks.**[Citation Graph (0, 0)][DBLP] Peer-to-Peer Systems and Applications, 2005, pp:57-76 [Conf] - Michael Kaufmann, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran R. Subramanian
**Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:832-841 [Conf] **A New Approach for Boundary Recognition in Geometric Sensor Networks**[Citation Graph (, )][DBLP]
Search in 0.109secs, Finished in 0.110secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |