Hanjo Täubig

From 2001 to 2015, I have been working at the Chair of Efficient Algorithms (Prof. Ernst W. Mayr) at TUM.
From 2015 to 2022, I was a guest at the Chair of Algorithms and Complexity (Prof. Susanne Albers).
Since 2015, I am working as a Data Scientist and Chief Algorithms Officer at Xplain Data.

WWW		http://www14.in.tum.de/personen/taeubig/
eMail		taeubig@in.tum.de
Address		Lehrstuhl für Algorithmen und Komplexität (I14) Institut für Informatik / TU München Boltzmannstr. 3 D-85748 Garching

Research
	Efficient algorithms and data structures Graph and network algorithms, e.g., Cut-based hierarchical decompositions Self-stabilization in overlay networks Graph connectivity (GI-Dagstuhl-Seminar Network Analysis) Visualization of large networks (DFG priority program Algorithmics of large and complex networks) Computational biology / bioinformatics Efficient algorithms for computational proteomics (Searching in protein structure databases) Indexing structures for approximate pattern matching (DFG priority program Algorithm engineering) Walks in graphs, spectral graph theory Inequalities for entries of matrix powers (quadratic, bilinear, and sesquilinear forms)

Research

Efficient algorithms and data structures
Graph and network algorithms, e.g.,
- Cut-based hierarchical decompositions
- Self-stabilization in overlay networks
- Graph connectivity (GI-Dagstuhl-Seminar Network Analysis)
- Visualization of large networks (DFG priority program Algorithmics of large and complex networks)
Computational biology / bioinformatics
- Efficient algorithms for computational proteomics (Searching in protein structure databases)
- Indexing structures for approximate pattern matching (DFG priority program Algorithm engineering)
Walks in graphs, spectral graph theory
Inequalities for entries of matrix powers (quadratic, bilinear, and sesquilinear forms)

Theses
H. Täubig: Fast Structure Searching for Computational Proteomics PhD Thesis, Computer Science Dept., TU München, 2007.	H. Täubig: Inequalities for Matrix Powers and the Number of Walks in Graphs Habilitation Thesis, Computer Science Dept., TU München, 2015.

Selected Publications
H. Täubig: Journal: Chebyshev's Sum Inequality and the Zagreb Indices Inequality, MATCH Communications in Mathematical and in Computer Chemistry 90(1):187-195, 2023. H. Täubig: Book: Matrix Inequalities for Iterative Systems, CRC Press / Taylor & Francis Group, 2017. H. Täubig: Journal: Inequalities for the Number of Walks in Subdivision Graphs, MATCH Communications in Mathematical and in Computer Chemistry 76(1):61-68, 2016. H. Aziz, S. Gaspers, J. Gudmundsson, J. Mestre, H. Täubig: Conference: Welfare Maximization in Fractional Hedonic Games, Proc. 24^th IJCAI, pp. 461-467, 2015. H. Räcke, Ch. Shah, H. Täubig: Conference: Computing Cut-Based Hierarchical Decompositions in Almost Linear Time, Proc. 25^th SODA pp. 227-238, 2014. R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Täubig: Journal: SKIP⁺: A Self-Stabilizing Skip Graph, Journal of the ACM 61(6), Article 36, 2014. Conference: A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs, Proc. 28^th PODC, pp. 131-140, 2009. H. Täubig, J. Weihmann: Journal: Matrix Power Inequalities and the Number of Walks in Graphs, Discrete Applied Mathematics 176:122-129, 2014. R. Hemmecke, S. Kosub, E. W. Mayr, H. Täubig, J. Weihmann: Journal: Inequalities for the Number of Walks in Graphs, Algorithmica 66(4):804-828, 2013. (PDF) Conference: Inequalities for the Number of Walks in Graphs, Proc. 9^th ANALCO, pp. 26-39, 2012. D. Gall, R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Täubig: Journal: A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization, Theory of Computing Systems 55(1):110-135, 2014. (PDF) Conference: Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization, Proc. 9^th LATIN, LNCS 6034, pp. 294-305, 2010. St. Eckhardt, S. Kosub, M. Maaß, H. Täubig, S. Wernicke: Journal: Combinatorial Network Abstraction by Trees and Distances, Theoretical Computer Science 407(1):1-20, 2008. Konferenz: Combinatorial Network Abstraction by Trees and Distances Proc. 16^th ISAAC, LNCS Vol. 3827, pp. 1100-1109, 2005. S. Kosub, M. Maaß, H. Täubig: Conference: Acyclic Type-of-Relationship Problems on the Internet, Proc. 3^rd CAAN, LNCS 4235, pp. 98-111, 2006. H. Täubig, A. Buchner, J. Griebsch: Journal: PAST: fast structure-based searching in the PDB, Nucleic Acids Research 34:W20-W23, 2006. Conference: A Method for Fast Approximate Searching of Polypeptide Structures in the PDB, Proc. GCB, LNI P-53, pp. 65-74, 2004. K. Holzapfel, S. Kosub, M. Maaß, H. Täubig: Journal: The Complexity of Detecting Fixed-Density Clusters, Discrete Applied Mathematics 154(11):1547-1562, 2006. Conference: The Complexity of Detecting Fixed-Density Clusters, Proc. 5^th CIAC, LNCS, 2653, pp. 201-212, 2003. A. Hall, H. Täubig: Conference: Comparing Push- and Pull-Based Broadcasting, Proc. 2^nd WEA, LNCS 2647, pp. 148-164, 2003. A complete list of publications can be found here. See also DBLP, Google Scholar, Microsoft Academic, or ResearchGate.

Selected Publications

H. Täubig:
Journal: Chebyshev's Sum Inequality and the Zagreb Indices Inequality, MATCH Communications in Mathematical and in Computer Chemistry 90(1):187-195, 2023.
H. Täubig:
Book: Matrix Inequalities for Iterative Systems, CRC Press / Taylor & Francis Group, 2017.
H. Täubig:
Journal: Inequalities for the Number of Walks in Subdivision Graphs, MATCH Communications in Mathematical and in Computer Chemistry 76(1):61-68, 2016.
H. Aziz, S. Gaspers, J. Gudmundsson, J. Mestre, H. Täubig:
Conference: Welfare Maximization in Fractional Hedonic Games, Proc. 24^th IJCAI, pp. 461-467, 2015.
H. Räcke, Ch. Shah, H. Täubig:
Conference: Computing Cut-Based Hierarchical Decompositions in Almost Linear Time, Proc. 25^th SODA pp. 227-238, 2014.
R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Täubig:
Journal: SKIP⁺: A Self-Stabilizing Skip Graph, Journal of the ACM 61(6), Article 36, 2014.
Conference: A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs, Proc. 28^th PODC, pp. 131-140, 2009.
H. Täubig, J. Weihmann:
Journal: Matrix Power Inequalities and the Number of Walks in Graphs, Discrete Applied Mathematics 176:122-129, 2014.
R. Hemmecke, S. Kosub, E. W. Mayr, H. Täubig, J. Weihmann:
Journal: Inequalities for the Number of Walks in Graphs, Algorithmica 66(4):804-828, 2013. (PDF)
Conference: Inequalities for the Number of Walks in Graphs, Proc. 9^th ANALCO, pp. 26-39, 2012.
D. Gall, R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Täubig:
Journal: A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization, Theory of Computing Systems 55(1):110-135, 2014. (PDF)
Conference: Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization, Proc. 9^th LATIN, LNCS 6034, pp. 294-305, 2010.
St. Eckhardt, S. Kosub, M. Maaß, H. Täubig, S. Wernicke:
Journal: Combinatorial Network Abstraction by Trees and Distances, Theoretical Computer Science 407(1):1-20, 2008.
Konferenz: Combinatorial Network Abstraction by Trees and Distances Proc. 16^th ISAAC, LNCS Vol. 3827, pp. 1100-1109, 2005.
S. Kosub, M. Maaß, H. Täubig:
Conference: Acyclic Type-of-Relationship Problems on the Internet, Proc. 3^rd CAAN, LNCS 4235, pp. 98-111, 2006.
H. Täubig, A. Buchner, J. Griebsch:
Journal: PAST: fast structure-based searching in the PDB, Nucleic Acids Research 34:W20-W23, 2006.
Conference: A Method for Fast Approximate Searching of Polypeptide Structures in the PDB, Proc. GCB, LNI P-53, pp. 65-74, 2004.
K. Holzapfel, S. Kosub, M. Maaß, H. Täubig:
Journal: The Complexity of Detecting Fixed-Density Clusters, Discrete Applied Mathematics 154(11):1547-1562, 2006.
Conference: The Complexity of Detecting Fixed-Density Clusters, Proc. 5^th CIAC, LNCS, 2653, pp. 201-212, 2003.
A. Hall, H. Täubig:
Conference: Comparing Push- and Pull-Based Broadcasting, Proc. 2^nd WEA, LNCS 2647, pp. 148-164, 2003.

A complete list of publications can be found here.
See also DBLP, Google Scholar, Microsoft Academic, or ResearchGate.