@article{2015e,
	author = {Fomin, Fedor V. and Philip, Geevarghese and Villanger, Yngve},
	date-added = {2016-02-23 01:21:16 +0000},
	date-modified = {2016-04-08 23:14:05 +0000},
	doi = {10.1007/s00453-013-9776-1},
	fjournal = {Algorithmica. An International Journal in Computer Science},
	issn = {0178-4617},
	journal = {Algorithmica},
	keywords = {graph classes, kernelization},
	mrclass = {05C85 (05C10 68Q25)},
	mrnumber = {3302141},
	mrreviewer = {Jesper Jansson},
	number = {1},
	pages = {1--20},
	title = {Minimum fill-in of sparse graphs: kernelization and approximation},
	url = {http://dx.doi.org/10.1007/s00453-013-9776-1},
	url_paper = {http://www.ii.uib.no/~fomin/articles/2015/2015e.pdf},
	volume = {71},
	year = {2015},
	bdsk-url-1 = {http://dx.doi.org/10.1007/s00453-013-9776-1}}

{"_id":"58svKNKP83ATWdYTp","bibbaseid":"fomin-philip-villanger-minimumfillinofsparsegraphskernelizationandapproximation-2015","downloads":0,"creationDate":"2015-06-23T17:42:39.265Z","title":"Minimum fill-in of sparse graphs: kernelization and approximation","author_short":["Fomin, F. V.","Philip, G.","Villanger, Y."],"year":2015,"bibtype":"article","biburl":"https://bibbase.org/network/files/NMvet57iG3cfoNh6G","bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Fomin"],"firstnames":["Fedor","V."],"suffixes":[]},{"propositions":[],"lastnames":["Philip"],"firstnames":["Geevarghese"],"suffixes":[]},{"propositions":[],"lastnames":["Villanger"],"firstnames":["Yngve"],"suffixes":[]}],"date-added":"2016-02-23 01:21:16 +0000","date-modified":"2016-04-08 23:14:05 +0000","doi":"10.1007/s00453-013-9776-1","fjournal":"Algorithmica. An International Journal in Computer Science","issn":"0178-4617","journal":"Algorithmica","keywords":"graph classes, kernelization","mrclass":"05C85 (05C10 68Q25)","mrnumber":"3302141","mrreviewer":"Jesper Jansson","number":"1","pages":"1–20","title":"Minimum fill-in of sparse graphs: kernelization and approximation","url":"http://dx.doi.org/10.1007/s00453-013-9776-1","url_paper":"http://www.ii.uib.no/~fomin/articles/2015/2015e.pdf","volume":"71","year":"2015","bdsk-url-1":"http://dx.doi.org/10.1007/s00453-013-9776-1","bibtex":"@article{2015e,\n\tauthor = {Fomin, Fedor V. and Philip, Geevarghese and Villanger, Yngve},\n\tdate-added = {2016-02-23 01:21:16 +0000},\n\tdate-modified = {2016-04-08 23:14:05 +0000},\n\tdoi = {10.1007/s00453-013-9776-1},\n\tfjournal = {Algorithmica. An International Journal in Computer Science},\n\tissn = {0178-4617},\n\tjournal = {Algorithmica},\n\tkeywords = {graph classes, kernelization},\n\tmrclass = {05C85 (05C10 68Q25)},\n\tmrnumber = {3302141},\n\tmrreviewer = {Jesper Jansson},\n\tnumber = {1},\n\tpages = {1--20},\n\ttitle = {Minimum fill-in of sparse graphs: kernelization and approximation},\n\turl = {http://dx.doi.org/10.1007/s00453-013-9776-1},\n\turl_paper = {http://www.ii.uib.no/~fomin/articles/2015/2015e.pdf},\n\tvolume = {71},\n\tyear = {2015},\n\tbdsk-url-1 = {http://dx.doi.org/10.1007/s00453-013-9776-1}}\n\n","author_short":["Fomin, F. V.","Philip, G.","Villanger, Y."],"key":"2015e","id":"2015e","bibbaseid":"fomin-philip-villanger-minimumfillinofsparsegraphskernelizationandapproximation-2015","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/s00453-013-9776-1"," paper":"http://www.ii.uib.no/~fomin/articles/2015/2015e.pdf"},"keyword":["graph classes","kernelization"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["minimum","fill","sparse","graphs","kernelization","approximation","fomin","philip","villanger"],"keywords":["graph classes","kernelization"],"authorIDs":[],"dataSources":["Cypug6AWS8rvGPR5j","RtxX8siCrYJoMBHxn"]}