{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:46:53Z","timestamp":1725472013828},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_1","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"1-2","source":"Crossref","is-referenced-by-count":2,"title":["Additive Approximation for Edge-Deletion Problems (Abstract)"],"prefix":"10.1007","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaf","family":"Shapira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1137\/050623905","volume":"20","author":"N. Alon","year":"2006","unstructured":"Alon, N.: Ranking Tournaments. SIAM J. Discrete Math.\u00a020, 137\u2013142 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Duke, R.A., Lefmann, H., R\u00f6dl, V., Yuster, R.: The algorithmic aspects of the Regularity Lemma. In: Proc. 33rd IEEE FOCS, pp. 473\u2013481. IEEE, Los Alamitos (1992); also J. of Algorithms 16, 80-109 (1994)","DOI":"10.1006\/jagm.1994.1005"},{"key":"1_CR3","unstructured":"Alon, N., Fernandez de la Vega, W., Kannan, R., Karpinski, M.: Random Sampling and Approximation of MAX-CSP Problems. In: Proc. of 34th ACM STOC, pp. 232\u2013239. ACM Press, New York (2002); also JCSS 67, 212-243 (2003)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient testing of large graphs. In: Proc. of 40th FOCS, pp. 656\u2013666. IEEE, Los Alamitos (1999); also Combinatorica 20, 451-476 (2000)","DOI":"10.1007\/s004930070001"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Alon, N., Shapira, A.: Every monotone graph property is testable. In: Proc. of 37th STOC, pp. 128\u2013137 (2005)","DOI":"10.1145\/1060590.1060611"},{"key":"1_CR6","unstructured":"Arora, S., Karger, D., Karpinski, M.: Polynomial time approximation schemes for dense instances of graph problems. In: Proc. of 28th STOC (1995); also: JCSS 58, 193-210 (1999)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Borgs, C., Chayes, J., Lov\u00e1sz, L., S\u00f3s, V.T., Szegedy, B., Vesztergombi, K.: Graph limits and parameter testing. In: STOC 2006 (to appear, 2006)","DOI":"10.1145\/1132516.1132556"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Frieze, A., Kannan, R.: The regularity lemma and approximation schemes for dense problems. In: Proc. of 37th FOCS, pp. 12\u201320 (1996)","DOI":"10.1109\/SFCS.1996.548459"},{"issue":"5","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1137\/S0097539702408223","volume":"32","author":"Y. Kohayakawa","year":"2003","unstructured":"Kohayakawa, Y., R\u00f6dl, V., Thoma, L.: An optimal algorithm for checking regularity. SIAM J. on Computing\u00a032(5), 1210\u20131235 (2003)","journal-title":"SIAM J. on Computing"},{"key":"1_CR10","unstructured":"Koml\u00f3s, J., Simonovits, M.: Szemer\u00e9di\u2019s Regularity Lemma and its applications in graph theory. In: Mikl\u00f3s, D., S\u00f3s, V.T., Sz\u00f6nyi, T. (eds.) Combinatorics, Paul Erd\u00f6s is Eighty. J\u00e1nos Bolyai Math.\u00a0Soc., Budapest, vol.\u00a0II, pp. 295\u2013352 (1996)"},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T. K\u00f6vari","year":"1954","unstructured":"K\u00f6vari, T., S\u00f3s, V.T., Tur\u00e1n, P.: On a problem of K. Zarankiewicz. Colloquium Math.\u00a03, 50\u201357 (1954)","journal-title":"Colloquium Math."},{"key":"1_CR12","unstructured":"Szemer\u00e9di, E.: Regular partitions of graphs. In: Bermond, J.C., Fournier, J.C., Las Vergnas, M., Sotteau, D. (eds.) Proc. Colloque Inter. CNRS, pp. 399\u2013401 (1978)"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1137\/0210021","volume":"10","author":"M. Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Edge-deletion problems. SIAM J. Comput.\u00a010, 297\u2013309 (1981)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:40Z","timestamp":1619507980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11786986_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}