{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T00:40:06Z","timestamp":1734309606889,"version":"3.30.2"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2003,6,9]]},"DOI":"10.1145\/780542.780557","type":"proceedings-article","created":{"date-parts":[[2004,4,19]],"date-time":"2004-04-19T17:18:43Z","timestamp":1082395123000},"page":"90-99","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Constant factor approximation of vertex-cuts in planar graphs"],"prefix":"10.1145","author":[{"given":"Eyal","family":"Amir","sequence":"first","affiliation":[{"name":"University of California, Berkeley, CA"}]},{"given":"Robert","family":"Krauthgamer","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, CA"}]},{"given":"Satish","family":"Rao","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, CA"}]}],"member":"320","published-online":{"date-parts":[[2003,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/774572.774599"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480191198768"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/647235.720077"},{"key":"e_1_3_2_1_4_1","first-page":"389","volume-title":"Proc. 7th Int'l Conference on Principles of Knowledge Representation and Reasoning","author":"Amir E.","year":"2000"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90140-Q"},{"key":"e_1_3_2_1_6_1","unstructured":"R. Diestel. Graph theory. Springer-Verlag New York second edition 2000. R. Diestel. Graph theory. Springer-Verlag New York second edition 2000."},{"volume-title":"Computer Science Press Inc.","year":"1979","author":"Even S.","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701387660"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794271692"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90011-0"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167261"},{"issue":"2","key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","article-title":"Local computations with probabilities on graphical structures and their application to expert systems","volume":"50","author":"Lauritzen S. L.","year":"1988","journal-title":"J. Royal Statistical Society B"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21958"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0136016"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/256292.256294"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(89)90029-4"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167284"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.26"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129735"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215352"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"volume-title":"Approximation Algorithms for NP-Hard Problems. PWS Publishing Company","year":"1997","author":"Shmoys D.B.","key":"e_1_3_2_1_24_1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875505"}],"event":{"name":"STOC03: The 35th Annual ACM Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Diego CA USA","acronym":"STOC03"},"container-title":["Proceedings of the thirty-fifth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/780542.780557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T00:09:31Z","timestamp":1734307771000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/780542.780557"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6,9]]},"references-count":25,"alternative-id":["10.1145\/780542.780557","10.1145\/780542"],"URL":"https:\/\/doi.org\/10.1145\/780542.780557","relation":{},"subject":[],"published":{"date-parts":[[2003,6,9]]},"assertion":[{"value":"2003-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}