Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger. On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. In Manindra Agrawal, Anil Seth, editors, FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings. Volume 2556 of Lecture Notes in Computer Science, pages 59-70, Springer, 2002. [doi]
@inproceedings{BockenhauerBHKPSU02,
title = {On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality},
author = {Hans-Joachim Böckenhauer and Dirk Bongartz and Juraj Hromkovic and Ralf Klasing and Guido Proietti and Sebastian Seibert and Walter Unger},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2556/25560059.htm},
tags = {completeness, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BockenhauerBHKPSU02},
cites = {0},
citedby = {0},
pages = {59-70},
booktitle = {FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings},
editor = {Manindra Agrawal and Anil Seth},
volume = {2556},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-00225-1},
}