@article{2018j,
	author = {Fomin, Fedor V. and Lokshtanov, Daniel and Saurabh, Saket},
	date-added = {2020-03-10 13:04:25 +0000},
	date-modified = {2020-03-10 13:04:25 +0000},
	doi = {10.1145/3154833},
	fjournal = {Journal of the ACM},
	issn = {0004-5411},
	journal = {J. ACM},
	keywords = {approximation algorithm, minor-free graph},
	mrclass = {68R10 (05C69 05C85 68Q25 68W25 90C60)},
	mrnumber = {3761674},
	mrreviewer = {Ali Shakiba},
	number = {2},
	pages = {Art. 10, 44},
	title = {Excluded grid minors and efficient polynomial-time approximation schemes},
	url = {https://doi.org/10.1145/3154833},
	url_paper = {http://www.ii.uib.no/~fomin/articles/2018/2018j.pdf},
	volume = {65},
	year = {2018},
	bdsk-url-1 = {https://doi.org/10.1145/3154833},
	bdsk-url-2 = {http://dx.doi.org/10.1145/3154833}}

{"_id":"7S9MzxEzZx8Cz5Gtv","bibbaseid":"fomin-lokshtanov-saurabh-excludedgridminorsandefficientpolynomialtimeapproximationschemes-2018","author_short":["Fomin, F. V.","Lokshtanov, D.","Saurabh, S."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Fomin"],"firstnames":["Fedor","V."],"suffixes":[]},{"propositions":[],"lastnames":["Lokshtanov"],"firstnames":["Daniel"],"suffixes":[]},{"propositions":[],"lastnames":["Saurabh"],"firstnames":["Saket"],"suffixes":[]}],"date-added":"2020-03-10 13:04:25 +0000","date-modified":"2020-03-10 13:04:25 +0000","doi":"10.1145/3154833","fjournal":"Journal of the ACM","issn":"0004-5411","journal":"J. ACM","keywords":"approximation algorithm, minor-free graph","mrclass":"68R10 (05C69 05C85 68Q25 68W25 90C60)","mrnumber":"3761674","mrreviewer":"Ali Shakiba","number":"2","pages":"Art. 10, 44","title":"Excluded grid minors and efficient polynomial-time approximation schemes","url":"https://doi.org/10.1145/3154833","url_paper":"http://www.ii.uib.no/~fomin/articles/2018/2018j.pdf","volume":"65","year":"2018","bdsk-url-1":"https://doi.org/10.1145/3154833","bdsk-url-2":"http://dx.doi.org/10.1145/3154833","bibtex":"@article{2018j,\n\tauthor = {Fomin, Fedor V. and Lokshtanov, Daniel and Saurabh, Saket},\n\tdate-added = {2020-03-10 13:04:25 +0000},\n\tdate-modified = {2020-03-10 13:04:25 +0000},\n\tdoi = {10.1145/3154833},\n\tfjournal = {Journal of the ACM},\n\tissn = {0004-5411},\n\tjournal = {J. ACM},\n\tkeywords = {approximation algorithm, minor-free graph},\n\tmrclass = {68R10 (05C69 05C85 68Q25 68W25 90C60)},\n\tmrnumber = {3761674},\n\tmrreviewer = {Ali Shakiba},\n\tnumber = {2},\n\tpages = {Art. 10, 44},\n\ttitle = {Excluded grid minors and efficient polynomial-time approximation schemes},\n\turl = {https://doi.org/10.1145/3154833},\n\turl_paper = {http://www.ii.uib.no/~fomin/articles/2018/2018j.pdf},\n\tvolume = {65},\n\tyear = {2018},\n\tbdsk-url-1 = {https://doi.org/10.1145/3154833},\n\tbdsk-url-2 = {http://dx.doi.org/10.1145/3154833}}\n\n","author_short":["Fomin, F. V.","Lokshtanov, D.","Saurabh, S."],"key":"2018j","id":"2018j","bibbaseid":"fomin-lokshtanov-saurabh-excludedgridminorsandefficientpolynomialtimeapproximationschemes-2018","role":"author","urls":{"Paper":"https://doi.org/10.1145/3154833"," paper":"http://www.ii.uib.no/~fomin/articles/2018/2018j.pdf"},"keyword":["approximation algorithm","minor-free graph"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"article","biburl":"https://bibbase.org/network/files/NMvet57iG3cfoNh6G","dataSources":["RtxX8siCrYJoMBHxn"],"keywords":["approximation algorithm","minor-free graph"],"search_terms":["excluded","grid","minors","efficient","polynomial","time","approximation","schemes","fomin","lokshtanov","saurabh"],"title":"Excluded grid minors and efficient polynomial-time approximation schemes","year":2018,"downloads":1}