Roland Glantz, Henning Meyerhenke. On finding convex cuts in general, bipartite and plane graphs. Theoretical Computer Science, 695:54-73, 2017. [doi]
@article{GlantzM17,
title = {On finding convex cuts in general, bipartite and plane graphs},
author = {Roland Glantz and Henning Meyerhenke},
year = {2017},
doi = {10.1016/j.tcs.2017.07.026},
url = {https://doi.org/10.1016/j.tcs.2017.07.026},
researchr = {https://researchr.org/publication/GlantzM17},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {695},
pages = {54-73},
}