@webpage{2005a,
	Author = {Fomin, Fedor V. and Heggernes, Pinar and Telle, Jan Arne},
	Coden = {ALGOEJ},
	Date-Added = {2016-02-23 00:45:46 +0000},
	Date-Modified = {2016-02-23 00:45:46 +0000},
	Doi = {10.1007/s00453-004-1117-y},
	Fjournal = {Algorithmica. An International Journal in Computer Science},
	Issn = {0178-4617},
	Journal = {Algorithmica},
	Mrclass = {05C78 (68R10 91A43)},
	Mrnumber = {2103258 (2006c:05120)},
	Mrreviewer = {Garth T. Isaak},
	Number = {2},
	Pages = {73--87},
	Title = {Graph searching, elimination trees, and a generalization of bandwidth},
	Url = {http://dx.doi.org/10.1007/s00453-004-1117-y},
	Url_Paper = {http://www.ii.uib.no/~fomin/articles/2005/2005a.pdf},
	Volume = {41},
	Year = {2005},
	Bdsk-Url-1 = {http://dx.doi.org/10.1007/s00453-004-1117-y}}

{"_id":"4XPFZ4zRzLS5x5KWw","bibbaseid":"fomin-heggernes-telle-graphsearchingeliminationtreesandageneralizationofbandwidth-2005","downloads":0,"creationDate":"2016-02-23T00:49:16.726Z","title":"Graph searching, elimination trees, and a generalization of bandwidth","author_short":["Fomin, F. V.","Heggernes, P.","Telle, J. A."],"year":2005,"bibtype":"webpage","biburl":"http://www.ii.uib.no/~fomin/articles/fvf_journals.bib","bibdata":{"bibtype":"webpage","type":"webpage","author":[{"propositions":[],"lastnames":["Fomin"],"firstnames":["Fedor","V."],"suffixes":[]},{"propositions":[],"lastnames":["Heggernes"],"firstnames":["Pinar"],"suffixes":[]},{"propositions":[],"lastnames":["Telle"],"firstnames":["Jan","Arne"],"suffixes":[]}],"coden":"ALGOEJ","date-added":"2016-02-23 00:45:46 +0000","date-modified":"2016-02-23 00:45:46 +0000","doi":"10.1007/s00453-004-1117-y","fjournal":"Algorithmica. An International Journal in Computer Science","issn":"0178-4617","journal":"Algorithmica","mrclass":"05C78 (68R10 91A43)","mrnumber":"2103258 (2006c:05120)","mrreviewer":"Garth T. Isaak","number":"2","pages":"73--87","title":"Graph searching, elimination trees, and a generalization of bandwidth","url":"http://dx.doi.org/10.1007/s00453-004-1117-y","url_paper":"http://www.ii.uib.no/~fomin/articles/2005/2005a.pdf","volume":"41","year":"2005","bdsk-url-1":"http://dx.doi.org/10.1007/s00453-004-1117-y","bibtex":"@webpage{2005a,\n\tAuthor = {Fomin, Fedor V. and Heggernes, Pinar and Telle, Jan Arne},\n\tCoden = {ALGOEJ},\n\tDate-Added = {2016-02-23 00:45:46 +0000},\n\tDate-Modified = {2016-02-23 00:45:46 +0000},\n\tDoi = {10.1007/s00453-004-1117-y},\n\tFjournal = {Algorithmica. An International Journal in Computer Science},\n\tIssn = {0178-4617},\n\tJournal = {Algorithmica},\n\tMrclass = {05C78 (68R10 91A43)},\n\tMrnumber = {2103258 (2006c:05120)},\n\tMrreviewer = {Garth T. Isaak},\n\tNumber = {2},\n\tPages = {73--87},\n\tTitle = {Graph searching, elimination trees, and a generalization of bandwidth},\n\tUrl = {http://dx.doi.org/10.1007/s00453-004-1117-y},\n\tUrl_Paper = {http://www.ii.uib.no/~fomin/articles/2005/2005a.pdf},\n\tVolume = {41},\n\tYear = {2005},\n\tBdsk-Url-1 = {http://dx.doi.org/10.1007/s00453-004-1117-y}}\n\n","author_short":["Fomin, F. V.","Heggernes, P.","Telle, J. A."],"key":"2005a","id":"2005a","bibbaseid":"fomin-heggernes-telle-graphsearchingeliminationtreesandageneralizationofbandwidth-2005","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/s00453-004-1117-y"," paper":"http://www.ii.uib.no/~fomin/articles/2005/2005a.pdf"},"downloads":0,"html":""},"search_terms":["graph","searching","elimination","trees","generalization","bandwidth","fomin","heggernes","telle"],"keywords":[],"authorIDs":[],"dataSources":["Cypug6AWS8rvGPR5j"]}