Hanjo Täubig

Available identifiers

Publication	Date of Publication	Type
Chebyshev's Sum Inequality and the Zagreb Indices Inequality	2023-07-10	Paper
Inequalities for the Number of Walks in Graphs	2019-09-17	Paper
Computing Cut-Based Hierarchical Decompositions in Almost Linear Time	2019-06-20	Paper
https://portal.mardi4nfdi.de/entity/Q5280038	2017-07-19	Paper
Matrix inequalities for iterative systems	2016-11-07	Paper
SKIP ⁺	2015-08-14	Paper
A note on the parallel runtime of self-stabilizing graph linearization	2015-02-05	Paper
Matrix power inequalities and the number of walks in graphs	2014-08-29	Paper
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs	2014-07-23	Paper
Inequalities for the number of walks in graphs	2013-11-11	Paper
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization	2010-04-27	Paper
Combinatorial network abstraction by trees and distances	2008-11-18	Paper
Acyclic Type-of-Relationship Problems on the Internet	2008-04-17	Paper
Algorithms and Computation	2006-11-14	Paper
The complexity of detecting fixed-density clusters	2006-08-14	Paper
Network Analysis	2005-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q4437509	2003-12-02	Paper
https://portal.mardi4nfdi.de/entity/Q4426352	2003-09-16	Paper

This page was built for person: Hanjo Täubig