Eyal Amir, Robert Krauthgamer, Satish Rao. Constant factor approximation of vertex-cuts in planar graphs. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA. pages 90-99, ACM, 2003. [doi]
@inproceedings{AmirKR03, title = {Constant factor approximation of vertex-cuts in planar graphs}, author = {Eyal Amir and Robert Krauthgamer and Satish Rao}, year = {2003}, doi = {10.1145/780542.780557}, url = {http://doi.acm.org/10.1145/780542.780557}, tags = {planar graph, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/AmirKR03}, cites = {0}, citedby = {0}, pages = {90-99}, booktitle = {Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA}, publisher = {ACM}, isbn = {1-58113-674-9}, }