@article{XFJ03,
	title={Computing shortest, fastest, and foremost journeys in dynamic networks},
	author={Xuan, B Bui and Ferreira, Afonso and Jarry, Aubin},
	sjournal={Internat. J. Found. Comput. Sci.},
	journal={International Journal of Foundations of Computer Science},
	volume={14},
	number={02},
	pages={267--285},
	year={2003},
	publisher={World Scientific}
}

{"_id":"vYDqQoFS8Nop3D5di","bibbaseid":"xuan-ferreira-jarry-computingshortestfastestandforemostjourneysindynamicnetworks-2003","author_short":["Xuan, B B.","Ferreira, A.","Jarry, A."],"bibdata":{"bibtype":"article","type":"article","title":"Computing shortest, fastest, and foremost journeys in dynamic networks","author":[{"propositions":[],"lastnames":["Xuan"],"firstnames":["B","Bui"],"suffixes":[]},{"propositions":[],"lastnames":["Ferreira"],"firstnames":["Afonso"],"suffixes":[]},{"propositions":[],"lastnames":["Jarry"],"firstnames":["Aubin"],"suffixes":[]}],"sjournal":"Internat. J. Found. Comput. Sci.","journal":"International Journal of Foundations of Computer Science","volume":"14","number":"02","pages":"267–285","year":"2003","publisher":"World Scientific","bibtex":"@article{XFJ03,\n\ttitle={Computing shortest, fastest, and foremost journeys in dynamic networks},\n\tauthor={Xuan, B Bui and Ferreira, Afonso and Jarry, Aubin},\n\tsjournal={Internat. J. Found. Comput. Sci.},\n\tjournal={International Journal of Foundations of Computer Science},\n\tvolume={14},\n\tnumber={02},\n\tpages={267--285},\n\tyear={2003},\n\tpublisher={World Scientific}\n}\n\n","author_short":["Xuan, B B.","Ferreira, A.","Jarry, A."],"key":"XFJ03","id":"XFJ03","bibbaseid":"xuan-ferreira-jarry-computingshortestfastestandforemostjourneysindynamicnetworks-2003","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/network/files/BZWfBuZY3E6mypcu8","dataSources":["5GsqcumS3vErfsixj"],"keywords":[],"search_terms":["computing","shortest","fastest","foremost","journeys","dynamic","networks","xuan","ferreira","jarry"],"title":"Computing shortest, fastest, and foremost journeys in dynamic networks","year":2003}