{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T23:02:30Z","timestamp":1754262150046,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"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":[[2013,6]]},"DOI":"10.1145\/2488608.2488663","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"437-446","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Testing subdivision-freeness"],"prefix":"10.1145","author":[{"given":"Ken-ichi","family":"Kawarabayashi","sequence":"first","affiliation":[{"name":"National Institute of Informatics and JST ERATO Kawarabayashi Project, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuichi","family":"Yoshida","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, and Preferred Infrastructure, Inc., Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1137\/060667177"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/100216.100254"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1109\/SFCS.2005.5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1016\/j.aim.2009.10.018"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1016\/0012-365X(78)90049-3"},{"key":"e_1_3_2_1_6_1","first-page":"801","article-title":"Graph theory. Graduate texts","volume":"173","author":"Diestel R.","year":"2000","unstructured":"R. Diestel . Graph theory. Graduate texts in Mathematics , 173 : 801 -- 811 , 2000 . R. Diestel. Graph theory. Graduate texts in Mathematics, 173:801--811, 2000.","journal-title":"Mathematics"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1016\/j.jctb.2012.07.001"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1007\/BF02579269"},{"key":"e_1_3_2_1_9_1","series-title":"LNCS","volume-title":"editor","author":"Goldreich O.","year":"2010","unstructured":"O. Goldreich , editor . Property Testing : Current Research and Surveys, volume 6390 of LNCS . Springer , 2010 . O. Goldreich, editor. Property Testing: Current Research and Surveys, volume 6390 of LNCS. Springer, 2010."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/285055.285060"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1007\/s00453-001-0078-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/1993636.1993700"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1109\/FOCS.2009.77"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1007\/978-3-642-31594-7_42"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1016\/j.jctb.2012.09.001"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1109\/FOCS.2010.22"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1016\/j.tcs.2005.10.007"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/1993636.1993726"},{"key":"e_1_3_2_1_19_1","volume-title":"Property testing in directed graphs. Master's thesis","author":"Orenstein Y.","year":"2010","unstructured":"Y. Orenstein . Property testing in directed graphs. Master's thesis , Tel-Aviv University , 2010 . Y. Orenstein. Property testing in directed graphs. Master's thesis, Tel-Aviv University, 2010."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1006\/jctb.1995.1006"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1016\/S0095-8956(03)00042-X"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1016\/j.jctb.2004.08.001"},{"key":"e_1_3_2_1_23_1","volume-title":"Sublinear time algorithms. Electronic Colloquium on Computational Complexity (ECCC), 18","author":"Rubinfeld R.","year":"2011","unstructured":"R. Rubinfeld and A. Shapira . Sublinear time algorithms. Electronic Colloquium on Computational Complexity (ECCC), 18 , 2011 . TR 11-013. R. Rubinfeld and A. Shapira. Sublinear time algorithms. Electronic Colloquium on Computational Complexity (ECCC), 18, 2011. TR11-013."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1137\/S0097539793255151"},{"key":"e_1_3_2_1_25_1","volume-title":"Regular partitions of graphs. Probl\u00e8mes combinatoires et th\u00e9orie des graphes, 260:399--401","author":"Szemer\u00e9di E.","year":"1976","unstructured":"E. Szemer\u00e9di . Regular partitions of graphs. Probl\u00e8mes combinatoires et th\u00e9orie des graphes, 260:399--401 , 1976 . E. Szemer\u00e9di. Regular partitions of graphs. Probl\u00e8mes combinatoires et th\u00e9orie des graphes, 260:399--401, 1976."},{"key":"e_1_3_2_1_26_1","volume-title":"Testing supermodular-cut condition","author":"Tanigawa S.","year":"2012","unstructured":"S. Tanigawa and Y. Yoshida . Testing supermodular-cut condition , 2012 . S. Tanigawa and Y. Yoshida. Testing supermodular-cut condition, 2012."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1007\/BF01594196"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1007\/s00453-010-9477-y"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC'13","name":"STOC'13: Symposium on Theory of Computing","location":"Palo Alto California USA"},"container-title":["Proceedings of the forty-fifth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488663","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488663","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:20Z","timestamp":1750235960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488663"}},"subtitle":["property testing meets structural graph theory"],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":28,"alternative-id":["10.1145\/2488608.2488663","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488663","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}