Hanjo Täubig

According to our database, Hanjo Täubig authored at least 17 papers between 2003 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

Welfare Maximization in Fractional Hedonic Games.

Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Hanjo Täubig

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014

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

Theory Comput. Syst., 2014

SKIP⁺: A Self-Stabilizing Skip Graph.

Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig

J. ACM, 2014

Matrix power inequalities and the number of walks in graphs.

Hanjo Täubig, Jeremias Weihmann

Discret. Appl. Math., 2014

Computing Cut-Based Hierarchical Decompositions in Almost Linear Time.

Harald Räcke, Chintan Shah, Hanjo Täubig

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Inequalities for the Number of Walks in Graphs.

Hanjo Täubig, Jeremias Weihmann, Sven Kosub, Raymond Hemmecke, Ernst W. Mayr

Algorithmica, 2013

2010

Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization.

Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization.

Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig

Proceedings of the Stabilization, 2009

A distributed polylogarithmic time algorithm for self-stabilizing skip graphs.

Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008

Combinatorial network abstraction by trees and distances.

Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke

Theor. Comput. Sci., 2008

2007

Fast Structure Searching for Computational Proteomics (Schnelle Struktursuche für computer-basierte Proteomforschung)

Hanjo Täubig

PhD thesis, 2007

2006

PAST: fast structure-based searching in the PDB.

Hanjo Täubig, Arno Buchner, Jan Griebsch

Nucleic Acids Res., 2006

The complexity of detecting fixed-density clusters.

Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig

Discret. Appl. Math., 2006

Acyclic Type-of-Relationship Problems on the Internet.

Sven Kosub, Moritz G. Maaß, Hanjo Täubig

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2004

A Method for Fast Approximate Searching of Polypeptide Structures in the PDB.

Hanjo Täubig, Arno Buchner, Jan Griebsch

Proceedings of the German Conference on Bioinformatics (GCB 2004), Bielefeld, 2004

Connectivity.

Frank Kammer, Hanjo Täubig

Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004

2003

Comparing Push- and Pull-Based Broadcasting.

Alexander Hall, Hanjo Täubig

Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003