Hanjo Täubig

Publication Activity (10 Years)

Years Active: 2003-2015
Publications (10 Years): 1

Top Topics

Additively Separable

Graph Representation

Top Venues

Theory Comput. Syst.

Discret. Appl. Math.

Publications

Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Hanjo Täubig
Welfare Maximization in Fractional Hedonic Games. IJCAI (2015)
Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
: A Self-Stabilizing Skip Graph. J. ACM 61 (6) (2014)
Hanjo Täubig, Jeremias Weihmann
Matrix power inequalities and the number of walks in graphs. Discret. Appl. Math. 176 (2014)
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) (2014)
Harald Räcke, Chintan Shah, Hanjo Täubig
Computing Cut-Based Hierarchical Decompositions in Almost Linear Time. SODA (2014)
Hanjo Täubig, Jeremias Weihmann, Sven Kosub, Raymond Hemmecke, Ernst W. Mayr
Inequalities for the Number of Walks in Graphs. Algorithmica 66 (4) (2013)
Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann
Inequalities for the Number of Walks in Graphs. ANALCO (2012)
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)
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)
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)
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) (2008)
Hanjo Täubig, Arno Buchner, Jan Griebsch
PAST: fast structure-based searching in the PDB. Nucleic Acids Res. 34 (Web-Server-Issue) (2006)
Sven Kosub, Moritz G. Maaß, Hanjo Täubig
Acyclic Type-of-Relationship Problems on the Internet. CAAN (2006)
Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig
The complexity of detecting fixed-density clusters. Discret. Appl. Math. 154 (11) (2006)
Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke
Combinatorial Network Abstraction by Trees and Distances. ISAAC (2005)
Frank Kammer, Hanjo Täubig
Connectivity. Network Analysis (2004)
Hanjo Täubig, Arno Buchner, Jan Griebsch
A Method for Fast Approximate Searching of Polypeptide Structures in the PDB. German Conference on Bioinformatics (2004)
Alexander Hall, Hanjo Täubig
Comparing Push- and Pull-Based Broadcasting. WEA (2003)
Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig
The Complexity of Detecting Fixed-Density Clusters. CIAC (2003)