Search the dblp DataBase

Publications of Author

1. Sven Kosub, Moritz G. Maaß, Hanjo Täubig
   Acyclic Type-of-Relationship Problems on the Internet. [Citation Graph (0, 0)][DBLP]
   CAAN, 2006, pp:98-111 [Conf]
   
2. Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig
   The Complexity of Detecting Fixed-Density Clusters. [Citation Graph (0, 0)][DBLP]
   CIAC, 2003, pp:201-212 [Conf]
   
3. Frank Kammer, Hanjo Täubig
   Connectivity. [Citation Graph (0, 0)][DBLP]
   Network Analysis, 2004, pp:143-177 [Conf]
   
4. Hanjo Täubig, Arno Buchner, Jan Griebsch
   A Method for Fast Approximate Searching of Polypeptide Structures in the PDB. [Citation Graph (0, 0)][DBLP]
   German Conference on Bioinformatics, 2004, pp:65-74 [Conf]
   
5. Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke
   Combinatorial Network Abstraction by Trees and Distances. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2005, pp:1100-1109 [Conf]
   
6. Alexander Hall, Hanjo Täubig
   Comparing Push- and Pull-Based Broadcasting. [Citation Graph (0, 0)][DBLP]
   WEA, 2003, pp:148-164 [Conf]
   
7. Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig
   The complexity of detecting fixed-density clusters. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:11, pp:1547-1562 [Journal]
   
8. Hanjo Täubig, Arno Buchner, Jan Griebsch
   PAST: fast structure-based searching in the PDB. [Citation Graph (0, 0)][DBLP]
   Nucleic Acids Research, 2006, v:34, n:Web-Server-Issue, pp:20-23 [Journal]
   
9. 
   Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. [Citation Graph (, )][DBLP]
   
   
10. 
    A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. [Citation Graph (, )][DBLP]
    
    
11. 
    Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. [Citation Graph (, )][DBLP]