{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T09:13:47Z","timestamp":1673428427501},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,2,12]],"date-time":"2013-02-12T00:00:00Z","timestamp":1360627200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Informatik Spektrum"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s00287-013-0684-1","type":"journal-article","created":{"date-parts":[[2013,2,11]],"date-time":"2013-02-11T03:50:20Z","timestamp":1360554620000},"page":"187-190","source":"Crossref","is-referenced-by-count":2,"title":["Algorithm Engineering"],"prefix":"10.1007","volume":"36","author":[{"given":"Peter","family":"Sanders","sequence":"first","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,12]]},"reference":[{"key":"684_CR1","unstructured":"Bader DA, Meyerhenke H, Sanders P, Schulz C, Schumm A, Wagner D (2012) A benchmarking set for graph clustering and partitioning. In: Rokne J, Alhajj R (eds) Encyclopedia of Social Network Analysis and Mining. To appear"},{"key":"684_CR2","doi-asserted-by":"crossref","unstructured":"Delling D, Goldberg AV and Werneck RF (2011) Shortest paths in road networks: from practice to theory and back. In: Sanders P, Wagner D (eds), it \u2013 Information Technology, Algorithm Enineering, vol 53, Oldenburg-Verlag, pp 294\u2013301","DOI":"10.1524\/itit.2011.0656"},{"key":"684_CR3","doi-asserted-by":"crossref","unstructured":"Delling D, Sanders P, Schultes D, Wagner D (2009) Engineering route planning algorithms. In: Algorithmics of Large and Complex Networks, LNCS State-of-the-Art Survey, vol 5515, Springer, pp 117\u2013139","DOI":"10.1007\/978-3-642-02094-0_7"},{"key":"684_CR4","doi-asserted-by":"crossref","unstructured":"Dementiev R, Sanders P, Schultes D, Sibeyn J (2004) Engineering an external memory minimum spanning tree algorithm. In: IFIP TCS, Toulouse, pp 195\u2013208","DOI":"10.1007\/1-4020-8141-3_17"},{"key":"684_CR5","doi-asserted-by":"crossref","unstructured":"Downey RG, Fellows MR (1999) Parameterized Complexity. Springer","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"684_CR6","doi-asserted-by":"crossref","unstructured":"Meyer U, Sanders P, Sibeyn J (eds) (2003) Algorithms for Memory Hierarchies. LNCS Tutorial, vol 2625, Springer","DOI":"10.1007\/3-540-36574-5"},{"key":"684_CR7","unstructured":"Spielman DA, Teng S (2001) Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing (STOC), Heraklion, Crete, Greece, 6\u20138 July 2001, pp 296\u2013305"}],"container-title":["Informatik-Spektrum"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-013-0684-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00287-013-0684-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-013-0684-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T11:04:31Z","timestamp":1562670271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00287-013-0684-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,12]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["684"],"URL":"https:\/\/doi.org\/10.1007\/s00287-013-0684-1","relation":{},"ISSN":["0170-6012","1432-122X"],"issn-type":[{"value":"0170-6012","type":"print"},{"value":"1432-122X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,12]]}}}