@inproceedings{conf/wg/Sudborough80,
  added-at = {2017-05-19T00:00:00.000+0200},
  author = {Sudborough, Ivan Hal},
  biburl = {https://www.bibsonomy.org/bibtex/2a7062f526e350e09afe12abb04997648/dblp},
  booktitle = {WG},
  crossref = {conf/wg/1980},
  editor = {Noltemeier, Hartmut},
  ee = {https://doi.org/10.1007/3-540-10291-4_21},
  interhash = {4fdedf77c690653aad23b196396c23cc},
  intrahash = {a7062f526e350e09afe12abb04997648},
  isbn = {0-387-10291-4},
  keywords = {dblp},
  pages = {293-305},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2019-05-15T13:55:04.000+0200},
  title = {The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth.},
  url = {http://dblp.uni-trier.de/db/conf/wg/wg80.html#Sudborough80},
  volume = 100,
  year = 1980
}

{"_id":"LC2MvkQxL4jNoXv7i","bibbaseid":"sudborough-thecomplexityofpathproblemsingraphsandpathsystemsofboundedbandwidth-1980","author_short":["Sudborough, I. H."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2017-05-19T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Sudborough"],"firstnames":["Ivan","Hal"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2a7062f526e350e09afe12abb04997648/dblp","booktitle":"WG","crossref":"conf/wg/1980","editor":[{"propositions":[],"lastnames":["Noltemeier"],"firstnames":["Hartmut"],"suffixes":[]}],"ee":"https://doi.org/10.1007/3-540-10291-4_21","interhash":"4fdedf77c690653aad23b196396c23cc","intrahash":"a7062f526e350e09afe12abb04997648","isbn":"0-387-10291-4","keywords":"dblp","pages":"293-305","publisher":"Springer","series":"Lecture Notes in Computer Science","timestamp":"2019-05-15T13:55:04.000+0200","title":"The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth.","url":"http://dblp.uni-trier.de/db/conf/wg/wg80.html#Sudborough80","volume":"100","year":"1980","bibtex":"@inproceedings{conf/wg/Sudborough80,\n added-at = {2017-05-19T00:00:00.000+0200},\n author = {Sudborough, Ivan Hal},\n biburl = {https://www.bibsonomy.org/bibtex/2a7062f526e350e09afe12abb04997648/dblp},\n booktitle = {WG},\n crossref = {conf/wg/1980},\n editor = {Noltemeier, Hartmut},\n ee = {https://doi.org/10.1007/3-540-10291-4_21},\n interhash = {4fdedf77c690653aad23b196396c23cc},\n intrahash = {a7062f526e350e09afe12abb04997648},\n isbn = {0-387-10291-4},\n keywords = {dblp},\n pages = {293-305},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n timestamp = {2019-05-15T13:55:04.000+0200},\n title = {The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth.},\n url = {http://dblp.uni-trier.de/db/conf/wg/wg80.html#Sudborough80},\n volume = 100,\n year = 1980\n}\n\n","author_short":["Sudborough, I. H."],"editor_short":["Noltemeier, H."],"key":"conf/wg/Sudborough80","id":"conf/wg/Sudborough80","bibbaseid":"sudborough-thecomplexityofpathproblemsingraphsandpathsystemsofboundedbandwidth-1980","role":"author","urls":{"Link":"https://doi.org/10.1007/3-540-10291-4_21","Paper":"http://dblp.uni-trier.de/db/conf/wg/wg80.html#Sudborough80"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/Hal?items=1000","dataSources":["Jy4SyfFmJfDm4DM2r"],"keywords":["dblp"],"search_terms":["complexity","path","problems","graphs","path","systems","bounded","bandwidth","sudborough"],"title":"The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth.","year":1980}