Clik here to view.
Comparing Push- and Pull-Based Broadcasting.
Alexander Hall, Hanjo Täubig: Comparing Push- and Pull-Based Broadcasting. WEA 2003: 148-164
View ArticleClik here to view.
The Complexity of Detecting Fixed-Density Clusters.
Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig: The Complexity of Detecting Fixed-Density Clusters. CIAC 2003: 201-212
View ArticleClik here to view.
A Method for Fast Approximate Searching of Polypeptide Structures in the PDB.
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
View ArticleClik here to view.
Clik here to view.
Combinatorial Network Abstraction by Trees and Distances.
Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke: Combinatorial Network Abstraction by Trees and Distances. ISAAC 2005: 1100-1109
View ArticleClik here to view.
Acyclic Type-of-Relationship Problems on the Internet.
Sven Kosub, Moritz G. Maaß, Hanjo Täubig: Acyclic Type-of-Relationship Problems on the Internet. CAAN 2006: 98-111
View ArticleClik here to view.
PAST: fast structure-based searching in the PDB.
Hanjo Täubig, Arno Buchner, Jan Griebsch: PAST: fast structure-based searching in the PDB. Nucleic Acids Res. 34(Web-Server-Issue): 20-23 (2006)
View ArticleClik here to view.
The complexity of detecting fixed-density clusters.
Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig: The complexity of detecting fixed-density clusters. Discret. Appl. Math. 154(11): 1547-1562 (2006)
View ArticleClik here to view.
Fast Structure Searching for Computational Proteomics (Schnelle Struktursuche...
Hanjo Täubig: Fast Structure Searching for Computational Proteomics (Schnelle Struktursuche für computer-basierte Proteomforschung). Technical University of Munich, Germany, 2007
View ArticleClik here to view.
Combinatorial network abstraction by trees and distances.
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)
View ArticleClik here to view.
Brief Announcement: On the Time Complexity of Distributed Topological...
Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig: Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. SSS 2009: 781-782
View ArticleClik here to view.
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs.
Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. PODC 2009: 131-140
View ArticleClik here to view.
Time Complexity of Distributed Topological Self-stabilization: The Case of...
Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig: Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. LATIN 2010:...
View ArticleClik here to view.
Inequalities for the Number of Walks in Graphs.
Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann: Inequalities for the Number of Walks in Graphs. ANALCO 2012: 26-39
View ArticleClik here to view.
Inequalities for the Number of Walks in Graphs.
Hanjo Täubig, Jeremias Weihmann, Sven Kosub, Raymond Hemmecke, Ernst W. Mayr: Inequalities for the Number of Walks in Graphs. Algorithmica 66(4): 804-828 (2013)
View ArticleClik here to view.
Computing Cut-Based Hierarchical Decompositions in Almost Linear Time.
Harald Räcke, Chintan Shah, Hanjo Täubig: Computing Cut-Based Hierarchical Decompositions in Almost Linear Time. SODA 2014: 227-238
View ArticleClik here to view.
A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.
Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig: A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. Theory Comput. Syst. 55(1): 110-135...
View ArticleClik here to view.
SKIP+: A Self-Stabilizing Skip Graph.
Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig: SKIP+: A Self-Stabilizing Skip Graph. J. ACM 61(6): 36:1-36:26 (2014)
View ArticleClik here to view.
Matrix power inequalities and the number of walks in graphs.
Hanjo Täubig, Jeremias Weihmann: Matrix power inequalities and the number of walks in graphs. Discret. Appl. Math. 176: 122-129 (2014)
View ArticleClik here to view.
Welfare Maximization in Fractional Hedonic Games.
Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Hanjo Täubig: Welfare Maximization in Fractional Hedonic Games. IJCAI 2015: 461-467
View Article
