Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX record conf/fsttcs/BockenhauerBHKPSU02
@inproceedings{DBLP:conf/fsttcs/BockenhauerBHKPSU02, author = {Hans{-}Joachim B{\"{o}}ckenhauer and Dirk Bongartz and Juraj Hromkovic and Ralf Klasing and Guido Proietti and Sebastian Seibert and Walter Unger}, editor = {Manindra Agrawal and Anil Seth}, title = {On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality}, booktitle = {{FST} {TCS} 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2556}, pages = {59--70}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-36206-1\_7}, doi = {10.1007/3-540-36206-1\_7}, timestamp = {Thu, 23 Jun 2022 19:57:48 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/BockenhauerBHKPSU02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.