This page shows all publications that appeared in the IASI annual research reports.
Authors currently affiliated with the Institute are always listed with the full name.
You can browse through them using either the links of the following line or those associated with
author names.
Show all publications of the year
ALL, with author Hromkovič J., in the category ALL
(or show them all): (Items found: 6)
2007 | 2006 | 2005 | 2003 | 2002
2007 [top]
2006 [top]
- Bockenhauer H.J., Kneis J., Kupke J., Hromkovič J., Forlizzi L., Proietti G., Widmayer P.: Reusing Optimal TSP Solutions for Locally Modified Input Instances, in the Proceedings of 4th IFIP International Conference on Theoretical Computer Science (TCS '06), 209, Springer Santiago, Chile, 251-270, 2006
- Forlizzi L., Hromkovič J., Proietti G., Seibert S.: On the Stability of Approximation for Hamiltonian Path Problems, Algorithmic Operations Research 1 (1), 31-45, 2006
2005 [top]
- Hromkovič J., Forlizzi L., Proietti G., Seibert S.: On the stability of approximation for Hamiltonian path problems, in the Proceedings of 31st Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2005), 22-28 Gennaio, Lecture Notes in Computer Science, 3381, 147-156, 2005
2003 [top]
- Böckenhauer H.J., Bongartz D., Hromkovič J., Klasing R., Proietti G., Seibert S., Unger W.: On $k$-Edge-Connectivity Problems with Sharpened Triangle Inequality, in: 5th Italian Conference on Algorithms and Complexity (CIAC'03), Lecture Notes in Computer Science, 2653, Springer-Verlag, 189-200, 2003
2002 [top]
- Böckenhauer H.J., Bongartz D., Hromkovič J., Klasing R., Proietti G., Seibert S., Unger W.: On the Hardness of Constructing Minimal Biconnected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality, in: 22nd Int. Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'02), Lecture Notes in Computer Science, 2556, Springer-Verlag, 59-70, 2002
|
