sample.bib

@book{garey1979computers,
  added-at = {2011-09-01T15:03:14.000+0200},
  asin = {0716710455},
  author = {Garey, M. R. and Johnson, D. S.},
  biburl = {https://www.bibsonomy.org/bibtex/2fac25cd952418baa739dd35243b3dbdc/folke},
  description = {Amazon.com: Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) (9780716710455): M. R. Garey, D. S. Johnson: Books},
  dewey = {519.4},
  ean = {9780716710455},
  edition = {First Edition},
  interhash = {ff69422a0dd852de42ed1c7d63fb2bf6},
  intrahash = {fac25cd952418baa739dd35243b3dbdc},
  isbn = {0716710455},
  keywords = {complexity computer np science tcs theoretical},
  publisher = {W. H. Freeman},
  timestamp = {2011-09-01T15:03:14.000+0200},
  title = {Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)},
  url = {http://www.amazon.com/Computers-Intractability-NP-Completeness-Mathematical-Sciences/dp/0716710455},
  year = "1979"
}
@incollection{DECHTER2003191,
title = {chapter 7 - Stochastic Greedy Local Search},
editor = {Rina Dechter},
booktitle = {Constraint Processing},
publisher = {Morgan Kaufmann},
address = {San Francisco},
pages = {191-208},
year = {2003},
series = {The Morgan Kaufmann Series in Artificial Intelligence},
isbn = {978-1-55860-890-0},
doi = {https://doi.org/10.1016/B978-155860890-0/50008-6},
url = {https://www.sciencedirect.com/science/article/pii/B9781558608900500086},
author = {Rina Dechter}
}
@book{10.5555/1051910,
author = {Kleinberg, Jon and Tardos, Eva},
title = {Algorithm Design},
year = {2005},
isbn = {0321295358},
publisher = {Addison-Wesley Longman Publishing Co., Inc.},
address = {USA}
}