Sergio Cabello, Bojan Mohar. Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs. In Gerth Stølting Brodal, Stefano Leonardi, editors, Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings. Volume 3669 of Lecture Notes in Computer Science, pages 131-142, Springer, 2005. [doi]
@inproceedings{CabelloM05,
title = {Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs},
author = {Sergio Cabello and Bojan Mohar},
year = {2005},
doi = {10.1007/11561071_14},
url = {http://dx.doi.org/10.1007/11561071_14},
tags = {contracts, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/CabelloM05},
cites = {0},
citedby = {0},
pages = {131-142},
booktitle = {Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings},
editor = {Gerth Stølting Brodal and Stefano Leonardi},
volume = {3669},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-29118-0},
}