Minimum fill-in of sparse graphs: kernelization and approximation. Fomin, F. V., Philip, G., & Villanger, Y. Algorithmica, 71(1):1--20, 2015. Paper Paper doi bibtex @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}}
Downloads: 0
{"_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":"http://www.ii.uib.no/~fomin/articles/fvf_journals.bib","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"],"downloads":0,"html":""},"search_terms":["minimum","fill","sparse","graphs","kernelization","approximation","fomin","philip","villanger"],"keywords":["graph classes","kernelization"],"authorIDs":[],"dataSources":["Cypug6AWS8rvGPR5j"]}