@ARTICLE{MihalakSW2016J,
  author = {Mat{\'{u}}s Mihal{\'{a}}k and Rastislav Sr{\'{a}}mek and Peter Widmayer},
  title = {{A}pproximately {C}ounting {A}pproximately-{S}hortest {P}aths in
	{D}irected {A}cyclic {G}raphs},
  journal = {Theory Comput. Syst.},
  year = {2016},
  volume = {58},
  pages = {45--59},
  number = {1},
  bibsource = {dblp computer science bibliography, http://dblp.org},
  biburl = {http://dblp.uni-trier.de/rec/bib/journals/mst/MihalakSW16},
  doi = {10.1007/s00224-014-9571-7},
  timestamp = {Thu, 07 Jan 2016 14:55:35 +0100},
  url = {http://dx.doi.org/10.1007/s00224-014-9571-7}
}

{"_id":"sBonCkJk5mi5cFass","bibbaseid":"mihalk-srmek-widmayer-approximatelycountingapproximatelyshortestpathsindirectedacyclicgraphs-2016","author_short":["Mihalák, M.","Srámek, R.","Widmayer, P."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Matús"],"propositions":[],"lastnames":["Mihalák"],"suffixes":[]},{"firstnames":["Rastislav"],"propositions":[],"lastnames":["Srámek"],"suffixes":[]},{"firstnames":["Peter"],"propositions":[],"lastnames":["Widmayer"],"suffixes":[]}],"title":"Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs","journal":"Theory Comput. Syst.","year":"2016","volume":"58","pages":"45–59","number":"1","bibsource":"dblp computer science bibliography, http://dblp.org","biburl":"http://dblp.uni-trier.de/rec/bib/journals/mst/MihalakSW16","doi":"10.1007/s00224-014-9571-7","timestamp":"Thu, 07 Jan 2016 14:55:35 +0100","url":"http://dx.doi.org/10.1007/s00224-014-9571-7","bibtex":"@ARTICLE{MihalakSW2016J,\n author = {Mat{\\'{u}}s Mihal{\\'{a}}k and Rastislav Sr{\\'{a}}mek and Peter Widmayer},\n title = {{A}pproximately {C}ounting {A}pproximately-{S}hortest {P}aths in\n\t{D}irected {A}cyclic {G}raphs},\n journal = {Theory Comput. Syst.},\n year = {2016},\n volume = {58},\n pages = {45--59},\n number = {1},\n bibsource = {dblp computer science bibliography, http://dblp.org},\n biburl = {http://dblp.uni-trier.de/rec/bib/journals/mst/MihalakSW16},\n doi = {10.1007/s00224-014-9571-7},\n timestamp = {Thu, 07 Jan 2016 14:55:35 +0100},\n url = {http://dx.doi.org/10.1007/s00224-014-9571-7}\n}\n\n","author_short":["Mihalák, M.","Srámek, R.","Widmayer, P."],"key":"MihalakSW2016J","id":"MihalakSW2016J","bibbaseid":"mihalk-srmek-widmayer-approximatelycountingapproximatelyshortestpathsindirectedacyclicgraphs-2016","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/s00224-014-9571-7"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://polybox.ethz.ch/index.php/s/wa4X7mAfU4Cgo3p/download","dataSources":["R7QLFCx79AQPLx6QS"],"keywords":[],"search_terms":["approximately","counting","approximately","shortest","paths","directed","acyclic","graphs","mihalák","srámek","widmayer"],"title":"Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs","year":2016}