{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T22:19:32Z","timestamp":1673389172919},"reference-count":17,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T00:00:00Z","timestamp":1285891200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1016\/j.comgeo.2010.04.007","type":"journal-article","created":{"date-parts":[[2010,5,5]],"date-time":"2010-05-05T12:58:47Z","timestamp":1273064327000},"page":"655-662","source":"Crossref","is-referenced-by-count":2,"title":["Randomly removing g handles at once"],"prefix":"10.1016","volume":"43","author":[{"given":"Glencora","family":"Borradaile","sequence":"first","affiliation":[]},{"given":"James R.","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Anastasios","family":"Sidiropoulos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.comgeo.2010.04.007_bib001","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","article-title":"Approximation algorithms for NP-complete problems on planar graphs","volume":"41","author":"Baker","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/j.comgeo.2010.04.007_bib002","doi-asserted-by":"crossref","unstructured":"G. Borradaile, Exploiting planarity for network flow and connectivity problems, Ph.D. thesis, Brown University, 2008","DOI":"10.1007\/978-0-387-30162-4_295"},{"key":"10.1016\/j.comgeo.2010.04.007_bib003","unstructured":"G. Borradaile, E. Demaine, S. Tazari, Polynomial-time approximation schemes for subset-connectivity problems in bounded genus graphs, in: Proceedings of STACS, 2009, pp. 171\u2013182"},{"key":"10.1016\/j.comgeo.2010.04.007_bib004","series-title":"37th Annual Symposium on Foundations of Computer Science","first-page":"184","article-title":"Probabilistic approximation of metric spaces and its algorithmic applications","author":"Bartal","year":"1996"},{"key":"10.1016\/j.comgeo.2010.04.007_bib005","series-title":"Proceedings of the 23rd Annual Symposium on Computational Geometry","first-page":"204","article-title":"Probabilistic embeddings of bounded genus graphs into planar graphs","author":"Indyk","year":"2007"},{"issue":"1","key":"10.1016\/j.comgeo.2010.04.007_bib006","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s00454-003-2948-z","article-title":"Optimally cutting a surface into a disk","volume":"31","author":"Erickson","year":"2004","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.comgeo.2010.04.007_bib007","doi-asserted-by":"crossref","unstructured":"J. Lee, A. Sidiropoulos, On the geometry of graphs with a forbidden minor, in: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009, pp. 245\u2013254","DOI":"10.1145\/1536414.1536450"},{"key":"10.1016\/j.comgeo.2010.04.007_bib008","doi-asserted-by":"crossref","unstructured":"P.N. Klein, S.A. Plotkin, S. Rao, Excluded minors, network decomposition, and multicommodity flow, in: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993, pp. 682\u2013690","DOI":"10.1145\/167088.167261"},{"issue":"2","key":"10.1016\/j.comgeo.2010.04.007_bib009","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s00493-004-0015-x","article-title":"Cuts, trees and \u21131-embeddings of graphs","volume":"24","author":"Gupta","year":"2004","journal-title":"Combinatorica"},{"issue":"3","key":"10.1016\/j.comgeo.2010.04.007_bib010","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.jcss.2004.04.011","article-title":"A tight bound on approximating arbitrary metrics by tree metrics","volume":"69","author":"Fakcharoenphol","year":"2004","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.comgeo.2010.04.007_bib011","series-title":"Graphs on Surfaces","author":"Mohar","year":"2001"},{"key":"10.1016\/j.comgeo.2010.04.007_bib012","unstructured":"P. Indyk, Tutorial: Algorithmic applications of low-distortion geometric embeddings, in: Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/j.comgeo.2010.04.007_bib013","series-title":"Lectures on Discrete Geometry","author":"Matousek","year":"2002"},{"key":"10.1016\/j.comgeo.2010.04.007_bib014","series-title":"Proceedings of the 15th Annual Symposium on Computational Geometry","first-page":"300","article-title":"Small distortion and volume preserving embeddings for planar and Euclidean metrics","author":"Rao","year":"1999"},{"key":"10.1016\/j.comgeo.2010.04.007_bib015","series-title":"Proceedings of 6th Workshop on Approximation, Randomization, and Combinatorial Optimization","first-page":"36","article-title":"An improved decomposition theorem for graphs excluding a fixed minor","volume":"vol. 2764","author":"Fakcharoenphol","year":"2003"},{"issue":"1","key":"10.1016\/j.comgeo.2010.04.007_bib016","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s00222-004-0400-5","article-title":"Extending Lipschitz functions via random metric partitions","volume":"160","author":"Lee","year":"2005","journal-title":"Invent. Math."},{"key":"10.1016\/j.comgeo.2010.04.007_bib017","series-title":"Proceedings of the European Symposium on Algorithms","first-page":"146","article-title":"Lower bounds for embedding into distributions over excluded minor graph families","volume":"vol. 3221","author":"Carroll","year":"2004"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772110000350?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772110000350?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:47:27Z","timestamp":1559087247000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772110000350"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":17,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["S0925772110000350"],"URL":"https:\/\/doi.org\/10.1016\/j.comgeo.2010.04.007","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2010,10]]}}}