{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:15Z","timestamp":1750307415018,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806767","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"563-572","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Augmenting undirected node-connectivity by one"],"prefix":"10.1145","author":[{"given":"L\u00e1szl\u00f3 A.","family":"V\u00e9gh","sequence":"first","affiliation":[{"name":"Eotvos Lorand University, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1040"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205044"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215916"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405003"},{"key":"e_1_3_2_1_7_1","volume-title":"Workshop on Network Design","author":"Frank A.","year":"1994","unstructured":"A. Frank and T. Jordan . Presented at the Workshop on Network Design , Budapest , October 1994 . A. Frank and T. Jordan. Presented at the Workshop on Network Design, Budapest, October 1994."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1044"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2008.03.002"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1077"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646343.689557"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.01.004"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1002"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1997.1786"},{"key":"e_1_3_2_1_15_1","volume-title":"Handbook on Approximation Algorithms and Metaheuristics","author":"Kortsarz G.","year":"2007","unstructured":"G. Kortsarz and Z. Nutov . Approximating minimum cost connectivity problems . In T. F. Gonzalez, editor, Handbook on Approximation Algorithms and Metaheuristics , chapter 58. Chapman & Hall\/CRC , 2007 . G. Kortsarz and Z. Nutov. Approximating minimum cost connectivity problems. In T. F. Gonzalez, editor, Handbook on Approximation Algorithms and Metaheuristics, chapter 58. Chapman & Hall\/CRC, 2007."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2006.03.005"},{"key":"e_1_3_2_1_17_1","volume-title":"Jump systems and matroid parity (in hungarian). Master's thesis","author":"Szabo J.","year":"2002","unstructured":"J. Szabo . Jump systems and matroid parity (in hungarian). Master's thesis , Etvs University , Budapest , 2002 . Available online at http:\/\/www.cs.elte.hu. J. Szabo. Jump systems and matroid parity (in hungarian). Master's thesis, Etvs University, Budapest, 2002. Available online at http:\/\/www.cs.elte.hu."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(87)90038-9"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90050-7"}],"event":{"name":"STOC'10: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge Massachusetts USA","acronym":"STOC'10"},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806767","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806767","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":17,"alternative-id":["10.1145\/1806689.1806767","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806767","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}