Hanjo Täubig

20 papers A* 3B 2C 2Journal 7Unranked 5
YearRankTypeTitle / Venue / Authors
2015 A* conf
Welfare Maximization in Fractional Hedonic Games.
IJCAI
Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Hanjo Täubig
2014 J jnl
A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.
Theory Comput. Syst.
Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
2014 A* conf
Computing Cut-Based Hierarchical Decompositions in Almost Linear Time.
SODA
Harald Räcke, Chintan Shah, Hanjo Täubig
2014 J jnl
Matrix power inequalities and the number of walks in graphs.
Discret. Appl. Math.
Hanjo Täubig, Jeremias Weihmann
2014 J jnl
SKIP
J. ACM
Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
2013 J jnl
Inequalities for the Number of Walks in Graphs.
Algorithmica
Hanjo Täubig, Jeremias Weihmann, Sven Kosub, Raymond Hemmecke, Ernst W. Mayr
2012 — conf
Inequalities for the Number of Walks in Graphs.
ANALCO
Raymond Hemmecke, Sven Kosub, Ernst W. Mayr, Hanjo Täubig, Jeremias Weihmann
2010 B conf
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization.
LATIN
Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
2009 A* conf
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs.
PODC
Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
2009 C conf
Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization.
SSS
Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
2008 J jnl
Combinatorial network abstraction by trees and distances.
Theor. Comput. Sci.
Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke
2007 — —
Fast Structure Searching for Computational Proteomics (Schnelle Struktursuche für computer-basierte Proteomforschung)
Hanjo Täubig
2006 — conf
Acyclic Type-of-Relationship Problems on the Internet.
CAAN
Sven Kosub, Moritz G. Maaß, Hanjo Täubig
2006 J jnl
PAST: fast structure-based searching in the PDB.
Nucleic Acids Res.
Hanjo Täubig, Arno Buchner, Jan Griebsch
2006 J jnl
The complexity of detecting fixed-density clusters.
Discret. Appl. Math.
Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig
2005 B conf
Combinatorial Network Abstraction by Trees and Distances.
ISAAC
Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, Sebastian Wernicke
2004 — conf
A Method for Fast Approximate Searching of Polypeptide Structures in the PDB.
German Conference on Bioinformatics
Hanjo Täubig, Arno Buchner, Jan Griebsch
2004 — conf
Connectivity.
Network Analysis
Frank Kammer, Hanjo Täubig
2003 — conf
Comparing Push- and Pull-Based Broadcasting.
WEA
Alexander Hall, Hanjo Täubig
2003 C conf
The Complexity of Detecting Fixed-Density Clusters.
CIAC
Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig