@inproceedings{conf/emo/Bokler17,
  added-at = {2017-03-03T00:00:00.000+0100},
  author = {Bökler, Fritz},
  biburl = {https://www.bibsonomy.org/bibtex/272d5280d44380a82ac99401221bd8f22/dblp},
  booktitle = {EMO},
  crossref = {conf/emo/2017},
  editor = {Trautmann, Heike and Rudolph, Günter and Klamroth, Kathrin and Schütze, Oliver and Wiecek, Margaret M. and Jin, Yaochu and Grimme, Christian},
  ee = {http://dx.doi.org/10.1007/978-3-319-54157-0_6},
  interhash = {902989ee1f595143c36251a528e5c4cd},
  intrahash = {72d5280d44380a82ac99401221bd8f22},
  isbn = {978-3-319-54156-3},
  keywords = {dblp},
  pages = {77-87},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2017-03-07T11:35:05.000+0100},
  title = {The Multiobjective Shortest Path Problem Is NP-Hard, or Is It?},
  url = {http://dblp.uni-trier.de/db/conf/emo/emo2017.html#Bokler17},
  volume = 10173,
  year = 2017
}

{"_id":"ADD84YRGLwRF8r5qF","bibbaseid":"bkler-themultiobjectiveshortestpathproblemisnphardorisit-2017","authorIDs":[],"author_short":["Bökler, F."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2017-03-03T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Bökler"],"firstnames":["Fritz"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/272d5280d44380a82ac99401221bd8f22/dblp","booktitle":"EMO","crossref":"conf/emo/2017","editor":[{"propositions":[],"lastnames":["Trautmann"],"firstnames":["Heike"],"suffixes":[]},{"propositions":[],"lastnames":["Rudolph"],"firstnames":["Günter"],"suffixes":[]},{"propositions":[],"lastnames":["Klamroth"],"firstnames":["Kathrin"],"suffixes":[]},{"propositions":[],"lastnames":["Schütze"],"firstnames":["Oliver"],"suffixes":[]},{"propositions":[],"lastnames":["Wiecek"],"firstnames":["Margaret","M."],"suffixes":[]},{"propositions":[],"lastnames":["Jin"],"firstnames":["Yaochu"],"suffixes":[]},{"propositions":[],"lastnames":["Grimme"],"firstnames":["Christian"],"suffixes":[]}],"ee":"http://dx.doi.org/10.1007/978-3-319-54157-0_6","interhash":"902989ee1f595143c36251a528e5c4cd","intrahash":"72d5280d44380a82ac99401221bd8f22","isbn":"978-3-319-54156-3","keywords":"dblp","pages":"77-87","publisher":"Springer","series":"Lecture Notes in Computer Science","timestamp":"2017-03-07T11:35:05.000+0100","title":"The Multiobjective Shortest Path Problem Is NP-Hard, or Is It?","url":"http://dblp.uni-trier.de/db/conf/emo/emo2017.html#Bokler17","volume":"10173","year":"2017","bibtex":"@inproceedings{conf/emo/Bokler17,\n added-at = {2017-03-03T00:00:00.000+0100},\n author = {Bökler, Fritz},\n biburl = {https://www.bibsonomy.org/bibtex/272d5280d44380a82ac99401221bd8f22/dblp},\n booktitle = {EMO},\n crossref = {conf/emo/2017},\n editor = {Trautmann, Heike and Rudolph, Günter and Klamroth, Kathrin and Schütze, Oliver and Wiecek, Margaret M. and Jin, Yaochu and Grimme, Christian},\n ee = {http://dx.doi.org/10.1007/978-3-319-54157-0_6},\n interhash = {902989ee1f595143c36251a528e5c4cd},\n intrahash = {72d5280d44380a82ac99401221bd8f22},\n isbn = {978-3-319-54156-3},\n keywords = {dblp},\n pages = {77-87},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n timestamp = {2017-03-07T11:35:05.000+0100},\n title = {The Multiobjective Shortest Path Problem Is NP-Hard, or Is It?},\n url = {http://dblp.uni-trier.de/db/conf/emo/emo2017.html#Bokler17},\n volume = 10173,\n year = 2017\n}\n\n","author_short":["Bökler, F."],"editor_short":["Trautmann, H.","Rudolph, G.","Klamroth, K.","Schütze, O.","Wiecek, M. M.","Jin, Y.","Grimme, C."],"key":"conf/emo/Bokler17","id":"conf/emo/Bokler17","bibbaseid":"bkler-themultiobjectiveshortestpathproblemisnphardorisit-2017","role":"author","urls":{"Link":"http://dx.doi.org/10.1007/978-3-319-54157-0_6","Paper":"http://dblp.uni-trier.de/db/conf/emo/emo2017.html#Bokler17"},"keyword":["dblp"],"downloads":0},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/fritz?items=1000","creationDate":"2019-07-04T22:53:30.382Z","downloads":0,"keywords":["dblp"],"search_terms":["multiobjective","shortest","path","problem","hard","bökler"],"title":"The Multiobjective Shortest Path Problem Is NP-Hard, or Is It?","year":2017,"dataSources":["P8qTtTCTHaCFodAoX"]}