{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:08:27Z","timestamp":1767337707849,"version":"build-2065373602"},"reference-count":8,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2019,11,3]],"date-time":"2019-11-03T00:00:00Z","timestamp":1572739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The purpose of this special issue of Algorithms was to attract papers presenting original research in the area of algorithm engineering. In particular, submissions concerning the design, analysis, implementation, tuning, and experimental evaluation of discrete algorithms and data structures, and\/or addressing methodological issues and standards in algorithmic experimentation were encouraged. Papers dealing with advanced models of computing, including memory hierarchies, cloud architectures, and parallel processing were also welcome. In this regard, we solicited contributions from all most prominent areas of applied algorithmic research, which include but are not limited to graphs, databases, computational geometry, big data, networking, combinatorial aspects of scientific computing, and computational problems in the natural sciences or engineering.<\/jats:p>","DOI":"10.3390\/a12110229","type":"journal-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T04:13:08Z","timestamp":1572840788000},"page":"229","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Special Issue on \u201cAlgorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems\u201d"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7833-9520","authenticated-orcid":false,"given":"Mattia","family":"D\u2019Emidio","sequence":"first","affiliation":[{"name":"Department of Information Engineering, Computer Science and Mathematics, University of L\u2019Aquila, Via Vetoio, I\u201367100 L\u2019Aquila, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2180-8813","authenticated-orcid":false,"given":"Daniele","family":"Frigioni","sequence":"additional","affiliation":[{"name":"Department of Information Engineering, Computer Science and Mathematics, University of L\u2019Aquila, Via Vetoio, I\u201367100 L\u2019Aquila, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,11,3]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Hannemann, M., and Schirra, S. (2010). Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-642-14866-8"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Gamby, A.N., and Katajainen, J. (2018). Convex-Hull Algorithms: Implementation, Testing, and Experimentation. Algorithms, 11.","DOI":"10.3390\/a11120195"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"D\u2019Emidio, M., Di Stefano, G., and Navarra, A. (2019). Bamboo Garden Trimming Problem: Priority Schedulings. Algorithms, 12.","DOI":"10.3390\/a12040074"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Angriman, E., van der Grinten, A., von Looz, M., Meyerhenke, H., Nollenburg, M., Predari, M., and Tzovas, C. (2019). Guidelines for Experimental Algorithmics: A Case Study in Network Analysis. Algorithms, 12.","DOI":"10.3390\/a12070127"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Coro, F., D\u2019Angelo, G., and Velaj, Y. (2019). Recommending Links to Control Elections via Social Influence. Algorithms, 12.","DOI":"10.3390\/a12100207"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Crescenzi, P., Magnien, C., and Marino, A. (2019). Approximating the Temporal Neighbourhood Function of Large Temporal Graphs. Algorithms, 12.","DOI":"10.3390\/a12100211"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Giannakopoulou, K., Paraskevopoulos, A., and Zaroliagis, C. (2019). Multimodal Dynamic Journey-Planning. Algorithms, 12.","DOI":"10.3390\/a12100213"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.jda.2017.09.001","article-title":"Engineering graph-based models for dynamic timetable information systems","volume":"46\u201347","author":"Cionini","year":"2017","journal-title":"J. Discret. Algorithms"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/11\/229\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:31:33Z","timestamp":1760189493000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/11\/229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,3]]},"references-count":8,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2019,11]]}},"alternative-id":["a12110229"],"URL":"https:\/\/doi.org\/10.3390\/a12110229","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2019,11,3]]}}}