Sergio Cabello. Finding shortest contractible and shortest separating cycles in embedded graphs. In Claire Mathieu, editor, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009. pages 616-624, SIAM, 2009. [doi]
@inproceedings{Cabello09, title = {Finding shortest contractible and shortest separating cycles in embedded graphs}, author = {Sergio Cabello}, year = {2009}, doi = {10.1145/1496770.1496838}, url = {http://doi.acm.org/10.1145/1496770.1496838}, tags = {contracts, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/Cabello09}, cites = {0}, citedby = {0}, pages = {616-624}, booktitle = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009}, editor = {Claire Mathieu}, publisher = {SIAM}, }