Übersicht Kontakt Forschung Lehre Publikationen Lebenslauf

Publikationen

H. Täubig: 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: Matrix Inequalities for Iterative Systems © CRC Press / Taylor & Francis Group, 2017. H. Täubig: Inequalities for Matrix Powers and Absolute Values: A Generalization of London's Conjecture Technischer Bericht TUM-I1655, Institut für Informatik, TU München, September 2016. H. Täubig: Inequalities for the Number of Walks in Subdivision Graphs MATCH Communications in Mathematical and in Computer Chemistry 76(1):61-68, © 2016. H. Täubig: Inequalities for Matrix Powers and the Number of Walks in Graphs Habilitationsschrift, Institut für Informatik, TU München, 2015. H. Täubig: Inequalities for the Number of Walks in Subdivision Graphs Technischer Bericht TUM-I1525, Institut für Informatik, TU München, August 2015. H. Aziz, S. Gaspers, J. Gudmundsson, J. Mestre, H. Täubig: Welfare Maximization in Fractional Hedonic Games Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI'15) (25.-31. Juli, 2015, Buenos Aires, Argentinien) S. 461-467, © AAAI Press, 2015. R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Täubig: SKIP+: A Self-Stabilizing Skip Graph Journal of the ACM 61(6), Art. 36, © ACM, 2014. H. Täubig, J. Weihmann: Matrix Power Inequalities and the Number of Walks in Graphs Discrete Applied Mathematics 176:122-129, (Special issue Graph Spectra in Computer Science) © Elsevier, 2014. H. Täubig: Further Results on the Number of Walks in Graphs and Weighted Entry Sums of Matrix Powers Technischer Bericht TUM-I1412, Institut für Informatik, TU München, Juli 2014. D. Gall, R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Täubig: A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization (PDF) Theory of Computing Systems 55(1):110-135, © Springer, 2014. H. Räcke, Ch. Shah, H. Täubig: Computing Cut-Based Hierarchical Decompositions in Almost Linear Time Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA'14) (5.-7. Januar 2014, Portland, Oregon, USA), S. 227-238, © SIAM, 2014. H. Täubig, J. Weihmann, S. Kosub, R. Hemmecke, E. W. Mayr: Inequalities for the Number of Walks in Graphs (PDF) Algorithmica 66(4):804-828, © Springer, 2013. H. Täubig, J. Weihmann: Inequalities for the Number of Walks, the Spectral Radius, and the Energy of Graphs Technischer Bericht TUM-I1211, Institut für Informatik, TU München, Juli 2012. Diese Arbeit wurde präsentiert bei der CRM Conference on Applications of Graph Spectra in Computer Science (16.-20. Juli 2012, Barcelona, Katalonien, Spanien). H. Täubig: The number of walks and degree powers in directed graphs Technischer Bericht TUM-I123, Institut für Informatik, TU München, April 2012. R. Hemmecke, S. Kosub, E. W. Mayr, H. Täubig, J. Weihmann: Inequalities for the Number of Walks in Graphs Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics (ANALCO'12) (16. Januar 2012, Kyoto, Japan), S. 26-39, © SIAM, 2012. R. Hemmecke, S. Kosub, E. W. Mayr, H. Täubig, J. Weihmann: Inequalities for the Number of Walks in Trees and General Graphs and a Generalization of a Theorem of Erdös and Simonovits Technischer Bericht TUM-I1109, Institut für Informatik, TU München, April 2011. D. Gall, R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Täubig: Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization Proceedings of the 9th Latin American Theoretical Informatics Symposium (LATIN'10) (19.-23. April 2010, Oaxaca, Mexiko). Lecture Notes in Computer Science (LNCS), Vol. 6034, S. 294-305, © Springer, 2010. D. Gall, R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Täubig: Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'09) (November 3-6, 2009, Lyon, Frankreich). Lecture Notes in Computer Science (LNCS), Vol. 5873, S. 781-782, © Springer, 2009. R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Täubig: A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs Proceedings of the 28th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'09) (10.-12. August 2009, Calgary, Alberta, Kanada), S. 131-140, © ACM, 2009. St. Eckhardt, S. Kosub, M. Maaß, H. Täubig, S. Wernicke: Combinatorial Network Abstraction by Trees and Distances Theoretical Computer Science 407(1):1-20, © Elsevier, 2008. D. Gall, R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Täubig: Modeling Scalability in Distributed Self-Stabilization: The Case of Graph Linearization Technischer Bericht TUM-I0835, Institut für Informatik, TU München, November 2008. M. Baumgart, H. Täubig: The Complexity of Computing Graph-Approximating Spanning Trees Technischer Bericht TUM-I0822, Institut für Informatik, TU München, Juli 2008. H. Täubig: Fast Structure Searching for Computational Proteomics Dissertation, Institut für Informatik, TU München, 2007. S. Kosub, M. Maaß, H. Täubig: Acyclic Type-of-Relationship Problems on the Internet Proceedings of the 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN'06) (2. Juli 2006, Chester, UK). Lecture Notes in Computer Science (LNCS), Vol. 4235, S. 98-111 © Springer, 2006. H. Täubig, A. Buchner, J. Griebsch: PAST: fast structure-based searching in the PDB Nucleic Acids Research 34 (Web Server Issue):W20-W23, © Oxford University Press, 2006. K. Holzapfel, S. Kosub, M. Maaß, H. Täubig: The Complexity of Detecting Fixed-Density Clusters Discrete Applied Mathematics 154(11):1547-1562, © Elsevier, Juli 2006. S. Kosub, M. Maaß, H. Täubig: Acyclic Type-of-Relationship Problems on the Internet Technischer Bericht TUM-I0605, Institut für Informatik, TU München, März 2006. St. Eckhardt, S. Kosub, M. Maaß, H. Täubig, S. Wernicke: Combinatorial Network Abstraction by Trees and Distances Proceedings of the 16th International Symposium on Algorithms and Computation (ISAAC'05) (19.-21. Dezember 2005, Sanya, Hainan, China). Lecture Notes in Computer Science (LNCS), Vol. 3827, S. 1100-1109, © Springer, 2005. St. Eckhardt, S. Kosub, M. Maaß, H. Täubig, S. Wernicke: Combinatorial Network Abstraction by Trees and Distances Technischer Bericht TUM-I0502, Institut für Informatik, TU München, Februar 2005. F. Kammer, H. Täubig: Connectivity In U. Brandes, Th. Erlebach (Hrsg.): Network Analysis, Lecture Notes in Computer Science (LNCS), Vol. 3418, S. 143-177, © Springer, 2005. F. Kammer, H. Täubig: Graph Connectivity Technischer Bericht TUM-I0422, Institut für Informatik, TU München, Dezember 2004. H. Täubig, A. Buchner, J. Griebsch: A Method for Fast Approximate Searching of Polypeptide Structures in the PDB Proceedings of the German Conference on Bioinformatics (GCB'04) (4.-6. Oktober 2004, Bielefeld). Lecture Notes in Informatics (LNI) Vol. P-53, S. 65-74. A. Buchner, H. Täubig, J. Griebsch: A Fast Method for Motif Detection and Searching in a Protein Structure Database Proceedings of the German Conference on Bioinformatics (GCB'03) (12.-14. Oktober 2003, München). Vol. II (Poster abstracts), S. 186-188. A. Buchner, H. Täubig: A Fast Method for Motif Detection and Searching in a Protein Structure Database Technischer Bericht TUM-I0314, Institut für Informatik, TU München, September 2003. K. Holzapfel, S. Kosub, M. Maaß, H. Täubig: The Complexity of Detecting Fixed-Density Clusters Proceedings of the 5th Italian Conference on Algorithms and Complexity (CIAC'03) (28.-30. Mai 2003, Rom / Italien). Lecture Notes in Computer Science (LNCS), Vol. 2653, S. 201-212, © Springer, 2003. A. Hall, H. Täubig: Comparing Push- and Pull-Based Broadcasting, Or: Would 'Microsoft Watches' Profit from a Transmitter? Proceedings of the 2nd Int. Workshop on Experimental and Efficient Algorithms (WEA'03) (26.-28. Mai 2003, Ascona / Schweiz). Lecture Notes in Computer Science (LNCS), Vol. 2647, S. 148-164, © Springer, 2003. K. Holzapfel, S. Kosub, M. Maaß, H. Täubig: The Complexity of Detecting Fixed-Density Clusters Technischer Bericht TUM-I0212, Institut für Informatik, TU München, Dezember 2002.