@inproceedings{ dblp3911914,
  title = {Nondeterministic Graph Searching: From Pathwidth to Treewidth},
  author = {Fedor V. Fomin and Pierre Fraigniaud and Nicolas Nisse},
  author_short = {Fomin, F. V. and Fraigniaud, P. and Nisse, N.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2005},
  key = {dblp3911914},
  id = {dblp3911914},
  biburl = {http://www.dblp.org/rec/bibtex/conf/mfcs/FominFN05},
  url = {http://dx.doi.org/10.1007/11549345_32},
  conference = {MFCS},
  pages = {364-375},
  text = {MFCS 2005:364-375},
  booktitle = {Proceedings of Mathematical Foundations of Computer Science (MFCS)}
}

{"_id":"qDCzQio62sKWyLDoj","bibbaseid":"fomin-fraigniaud-nisse-nondeterministicgraphsearchingfrompathwidthtotreewidth-2005","downloads":0,"creationDate":"2015-06-23T17:42:40.089Z","title":"Nondeterministic Graph Searching: From Pathwidth to Treewidth","author_short":["Fomin, F. V.","Fraigniaud, P.","Nisse, N."],"year":2005,"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/mfcs/FominFN05","bibdata":{"title":"Nondeterministic Graph Searching: From Pathwidth to Treewidth","author":["Fedor V. Fomin","Pierre Fraigniaud","Nicolas Nisse"],"author_short":["Fomin, F. V.","Fraigniaud, P.","Nisse, N."],"bibtype":"inproceedings","type":"inproceedings","year":"2005","key":"dblp3911914","id":"dblp3911914","biburl":"http://www.dblp.org/rec/bibtex/conf/mfcs/FominFN05","url":"http://dx.doi.org/10.1007/11549345_32","conference":"MFCS","pages":"364-375","text":"MFCS 2005:364-375","booktitle":"Proceedings of Mathematical Foundations of Computer Science (MFCS)","bibtex":"@inproceedings{ dblp3911914,\n title = {Nondeterministic Graph Searching: From Pathwidth to Treewidth},\n author = {Fedor V. Fomin and Pierre Fraigniaud and Nicolas Nisse},\n author_short = {Fomin, F. V. and Fraigniaud, P. and Nisse, N.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {2005},\n key = {dblp3911914},\n id = {dblp3911914},\n biburl = {http://www.dblp.org/rec/bibtex/conf/mfcs/FominFN05},\n url = {http://dx.doi.org/10.1007/11549345_32},\n conference = {MFCS},\n pages = {364-375},\n text = {MFCS 2005:364-375},\n booktitle = {Proceedings of Mathematical Foundations of Computer Science (MFCS)}\n}","bibbaseid":"fomin-fraigniaud-nisse-nondeterministicgraphsearchingfrompathwidthtotreewidth-2005","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/11549345_32"},"downloads":0},"search_terms":["nondeterministic","graph","searching","pathwidth","treewidth","fomin","fraigniaud","nisse"],"keywords":[],"authorIDs":["55899a8faca630573e0006e6"],"dataSources":["QzKoh2HKwNTPSksjo"]}