{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:48:02Z","timestamp":1720640882666},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s1571-0653(04)00379-8","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T13:34:04Z","timestamp":1113053644000},"page":"137-142","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs"],"prefix":"10.1016","volume":"10","author":[{"given":"Mohammadtaghi","family":"Hajiaghayi","sequence":"first","affiliation":[]},{"given":"Naomi","family":"Nishimura","sequence":"additional","affiliation":[]},{"given":"Prabhakar","family":"Ragde","sequence":"additional","affiliation":[]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00379-8_BIB1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","article-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"key":"10.1016\/S1571-0653(04)00379-8_BIB2","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"},{"issue":"6","key":"10.1016\/S1571-0653(04)00379-8_BIB3","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","article-title":"A linear-time algorithm for finding tree-decompositions of small treewidth","volume":"25","author":"Bodlaender","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S1571-0653(04)00379-8_BIB4","series-title":"Mathematical foundations of computer science 1997 (Bratislava)","first-page":"19","article-title":"Treewidth: algorithmic techniques and results","author":"Bodlaender","year":"1997"},{"issue":"1-2","key":"10.1016\/S1571-0653(04)00379-8_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","article-title":"A partial k-arboretum of graphs with bounded treewidth","volume":"209","author":"Bodlaender","year":"1998","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S1571-0653(04)00379-8_BIB6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1137\/0221016","article-title":"Partitioning planar graphs","volume":"21","author":"Bui","year":"1992","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S1571-0653(04)00379-8_BIB7","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1006\/jagm.1997.0894","article-title":"Efficient approximation schemes for maximization problems on K3, 3-free or K5-free graphs","volume":"26","author":"Chen","year":"1998","journal-title":"J. Algorithms"},{"issue":"4","key":"10.1016\/S1571-0653(04)00379-8_BIB8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s002360050049","article-title":"Parallel approximation schemes for problems on planar graphs","volume":"33","author":"Diaz","year":"1996","journal-title":"Acta Inform."},{"issue":"3-4","key":"10.1016\/S1571-0653(04)00379-8_BIB9","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s004530010020","article-title":"Diameter and treewidth in minor-closed graph families","volume":"27","author":"Eppstein","year":"2000","journal-title":"Algorithmica"},{"key":"10.1016\/S1571-0653(04)00379-8_BIB10","first-page":"669","article-title":"Excluding a graph with one crossing","author":"Robertson","year":"1993","journal-title":"Graph structure theory (Seattle, WA, 1991), Amer. Math. Soc., Providence, HI"},{"key":"10.1016\/S1571-0653(04)00379-8_BIB11","first-page":"280","article-title":"\u00f6ber eine Eigenschaft der eben Komplexe","volume":"2","author":"Wagner","year":"1937","journal-title":"Deutsche Math."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304003798?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304003798?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T13:55:19Z","timestamp":1548597319000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304003798"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":11,"alternative-id":["S1571065304003798"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00379-8","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}