{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T19:26:56Z","timestamp":1771529216511,"version":"3.50.1"},"reference-count":8,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T00:00:00Z","timestamp":1611187200000},"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>This Special Issue of Algorithms is of a different nature than other Special Issue in the journal, which are usually dedicated to a particular subjects in the area of algorithms [...]<\/jats:p>","DOI":"10.3390\/a14020032","type":"journal-article","created":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T11:49:40Z","timestamp":1611229780000},"page":"32","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["2020 Selected Papers from Algorithms\u2019 Editorial Board Members"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0709-3591","authenticated-orcid":false,"given":"Frank","family":"Werner","sequence":"first","affiliation":[{"name":"Faculty of Mathematics, Otto-von-Guericke, University Magdeburg, P.O. Box 4120, D-39016 Magdeburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,1,21]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Zhu, J., Wang, C., Shurbevski, A., Nagamochi, H., and Akutsu, T. (2020). A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming. Algorithms, 13.","DOI":"10.3390\/a13050124"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Carpentieri, B. (2020). Compression of Next-Generation Sequencing Data and of DNA Digital Files. Algorithms, 13.","DOI":"10.3390\/a13060151"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Abu-Khzam, F.N., and Al Kontar, K. (2020). A Brief Survey of Fixed-Parameter Parallelism. Algorithms, 13.","DOI":"10.3390\/a13080197"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Antonelli, L., De Simone, V., and di Serafino, D. (2020). Spatially Adaptive Regularization in Image Segmentation. Algorithms, 13.","DOI":"10.3390\/a13090226"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Zanzotto, F.M., Satta, G., and Christini, G. (2020). CYK Parsing over Distributed Representations. Algorithms, 13.","DOI":"10.3390\/a13100262"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Burr, T., Favalli, A., Lombardi, M., and Stinnett, J. (2020). Application of the Approximate Bayesian Computation Algorithm to Gamma-Ray Spectroscopy. Algorithms, 13.","DOI":"10.3390\/a13100265"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Lancia, G., and Delpasso, M. (2020). Finding the Best 3-OPT Move in Subcubic Time. Algorithms, 13.","DOI":"10.3390\/a13110306"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Chereji, E., Radac, M.-B., and Szedlak-Stimean, A.-I. (2021). Sliding Mode Control Algorithms for Anti-Lock Braking Systems with Performance Comparisons. Algorithms, 14.","DOI":"10.3390\/a14010002"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/2\/32\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:13:38Z","timestamp":1760159618000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/2\/32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,21]]},"references-count":8,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2021,2]]}},"alternative-id":["a14020032"],"URL":"https:\/\/doi.org\/10.3390\/a14020032","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,21]]}}}