| 2008 |
|---|
| 9 | EE | Stefan Eckhardt,
Sven Kosub,
Moritz G. Maaß,
Hanjo Täubig,
Sebastian Wernicke:
Combinatorial network abstraction by trees and distances.
Theor. Comput. Sci. 407(1-3): 1-20 (2008) |
| 2006 |
|---|
| 8 | EE | Sven Kosub,
Moritz G. Maaß,
Hanjo Täubig:
Acyclic Type-of-Relationship Problems on the Internet.
CAAN 2006: 98-111 |
| 7 | EE | Klaus Holzapfel,
Sven Kosub,
Moritz G. Maaß,
Hanjo Täubig:
The complexity of detecting fixed-density clusters.
Discrete Applied Mathematics 154(11): 1547-1562 (2006) |
| 6 | EE | Hanjo Täubig,
Arno Buchner,
Jan Griebsch:
PAST: fast structure-based searching in the PDB.
Nucleic Acids Research 34(Web-Server-Issue): 20-23 (2006) |
| 2005 |
|---|
| 5 | EE | Stefan Eckhardt,
Sven Kosub,
Moritz G. Maaß,
Hanjo Täubig,
Sebastian Wernicke:
Combinatorial Network Abstraction by Trees and Distances.
ISAAC 2005: 1100-1109 |
| 2004 |
|---|
| 4 | | Hanjo Täubig,
Arno Buchner,
Jan Griebsch:
A Method for Fast Approximate Searching of Polypeptide Structures in the PDB.
German Conference on Bioinformatics 2004: 65-74 |
| 3 | EE | Frank Kammer,
Hanjo Täubig:
Connectivity.
Network Analysis 2004: 143-177 |
| 2003 |
|---|
| 2 | EE | Klaus Holzapfel,
Sven Kosub,
Moritz G. Maaß,
Hanjo Täubig:
The Complexity of Detecting Fixed-Density Clusters.
CIAC 2003: 201-212 |
| 1 | EE | Alexander Hall,
Hanjo Täubig:
Comparing Push- and Pull-Based Broadcasting.
WEA 2003: 148-164 |
