Overview Contact Research Teaching Publications Theses Curriculum Vitae

Publications

H. Täubig: The number of walks and degree powers in directed graphs Technical Report TUM-I123, Computer Science Dept., 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) (January 16, 2012, Kyoto, Japan), pp. 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 Technical Report TUM-I1109, Computer Science Dept., 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) (April 19-23, 2010, Oaxaca, Mexico). Lecture Notes in Computer Science (LNCS), Vol. 6034, pp. 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, France). Lecture Notes in Computer Science (LNCS), Vol. 5873, pp. 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) (August 10-12, 2009, Calgary, Alberta, Canada), pp. 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 Technical Report TUM-I0835, Computer Science Dept., TU München, November 2008. M. Baumgart, H. Täubig: The Complexity of Computing Graph-Approximating Spanning Trees Technical Report TUM-I0822, Computer Science Dept., TU München, July 2008. H. Täubig: Fast Structure Searching for Computational Proteomics Dissertation, Computer Science Dept., 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) (July 2, 2006, Chester, UK). Lecture Notes in Computer Science (LNCS), Vol. 4235, pp. 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, July 2006. S. Kosub, M. Maaß, H. Täubig: Acyclic Type-of-Relationship Problems on the Internet Technical Report TUM-I0605, Computer Science Dept., TU München, March 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) (December 19-21, 2005, Sanya, Hainan, China). Lecture Notes in Computer Science (LNCS), Vol. 3827, pp. 1100-1109, © Springer, 2005. St. Eckhardt, S. Kosub, M. Maaß, H. Täubig, S. Wernicke: Combinatorial Network Abstraction by Trees and Distances Technical Report TUM-I0502, Computer Science Dept., TU München, March 2005. F. Kammer, H. Täubig: Connectivity In U. Brandes, Th. Erlebach (eds.): Network Analysis, Lecture Notes in Computer Science (LNCS), Vol. 3418, pp. 143-177, © Springer, 2005. F. Kammer, H. Täubig: Graph Connectivity Technical Report TUM-I0422, Computer Science Dept., TU München, December 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) (October 4-6 2004, Bielefeld / Germany). Lecture Notes in Informatics (LNI) Vol. P-53, pp. 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) (October 12-14 2003, Munich / Germany). Vol. II (Poster abstracts), pp. 186-188. A. Buchner, H. Täubig: A Fast Method for Motif Detection and Searching in a Protein Structure Database Technical Report TUM-I0314, Computer Science Dept., 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) (May 28-30 2003, Rome / Italy). Lecture Notes in Computer Science (LNCS), Vol. 2653, pp. 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) (May 26-28 2003, Ascona / Switzerland). Lecture Notes in Computer Science (LNCS), Vol. 2647, pp. 148-164, © Springer, 2003. K. Holzapfel, S. Kosub, M. Maaß, H. Täubig: The Complexity of Detecting Fixed-Density Clusters Technical Report TUM-I0212, Computer Science Dept., TU München, December 2002.