@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":"https://bibbase.org/network/files/NMvet57iG3cfoNh6G","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"},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["graph","searching","elimination","trees","generalization","bandwidth","fomin","heggernes","telle"],"keywords":[],"authorIDs":[],"dataSources":["Cypug6AWS8rvGPR5j","RtxX8siCrYJoMBHxn"]}