Publications of J. Hromkovic

1. J. Hromkovic, R. Klasing, A. Pelc, P. Ruzicka, and W. Unger. Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance, Springer Monograph. Springer-Verlag, 2005. [bibtex-entry]

1. H.-J. Böckenhauer, D. Bongartz, J. Hromkovic, R. Klasing, G. Proietti, S. Seibert, and W. Unger. On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theoretical Computer Science, 326(1--3):137--153, 2004. [bibtex-entry]


2. H.-J. Böckenhauer, J. Hromkovic, R. Klasing, S. Seibert, and W. Unger. Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. Theoretical Computer Science, 285(1):3--24, 2002. [bibtex-entry]

1. H.-J. Böckenhauer, D. Bongartz, J. Hromkovic, R. Klasing, G. Proietti, S. Seibert, and W. Unger. On $k$-Edge-Connectivity Problems with Sharpened Triangle Inequality (Extended Abstract). In Proc. 5th Italian Conference on Algorithms and Complexity ( CIAC 2003), volume 2653 of Lecture Notes in Computer Science, pages 189--200, 2003. Springer-Verlag. [bibtex-entry]


2. H.-J. Böckenhauer, D. Bongartz, J. Hromkovic, R. Klasing, G. Proietti, S. Seibert, and W. Unger. On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. In Proc. of the 22nd Conference on Foundations of Software Technology and Theoretial Computer Science (FSTTCS 2002), volume 2556 of Lecture Notes in Computer Science, pages 59--70, 2002. Springer-Verlag. [bibtex-entry]

This document was translated from BibT_EX by bibtex2html