{"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":1771529216930,"version":"3.50.1"},"reference-count":12,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2021,12,9]],"date-time":"2021-12-09T00:00:00Z","timestamp":1639008000000},"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 is the second edition of a special issue of Algorithms that is of a rather different nature compared to other Special Issues in the journal, which are usually dedicated to a particular subject in the area of algorithms [...]<\/jats:p>","DOI":"10.3390\/a14120357","type":"journal-article","created":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T23:30:00Z","timestamp":1639006200000},"page":"357","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Special Issue \u201c2021 Selected Papers from Algorithms\u2019 Editorial Board Members\u201d"],"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, P.O. Box 4120, D-39016 Magdeburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,12,9]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Fotakis, D., Kovouras, L., and Zakynthinou, L. (2021). Online Facility Location in Evolving Metrics. Algorithms, 14.","DOI":"10.3390\/a14030073"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Bouamama, S., and Blum, C. (2021). An Improved Greedy Heuristic for the Minimum Influence Dominating Set Problem in Social Networks. Algorithms, 14.","DOI":"10.3390\/a14030079"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Cordero, A., Moscoso-Martinez, M., and Torregrosa, J.R. (2021). Chaos and Stability in a New Iterative Family for Solving Nonlinear Equations. Algorithms, 14.","DOI":"10.3390\/a14040101"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Baibal, S., Bouamama, S., and Blum, C. (2021). A Greedy Heuristic for Maximizing the Lifetime of Wireless Sensor Networks Based on Disjoint Weighted Dominating Sets. Algorithms, 14.","DOI":"10.3390\/a14060170"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Jatschka, T., Raidl, G.R., and Rodemann, T. (2021). A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. Algorithms, 14.","DOI":"10.3390\/a14080232"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Lancia, G., and Serafini, P. (2021). Computational Complexity and ILP Models for Pattern Problems in the Logical Analysis of Data. Algorithms, 14.","DOI":"10.3390\/a14080235"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Sotskov, Y.N., and Mihova, E.I. (2021). Scheduling Multiprocessor Tasks with Equal Processing Times as a Mixed Graph Coloring Problem. Algorithms, 14.","DOI":"10.3390\/a14080246"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Mele, U.J., Gambardella, L.M., and Montemanni, R. (2021). A New Constructive Heuristic Driven by Machiune Learning for the Traveling Salesman Problem. Algorithms, 14.","DOI":"10.3390\/a14090267"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Mezei, M. (2021). Use of the Codon Table to Quantify the Evolutionary Role of Random Mutations. Algorithms, 14.","DOI":"10.3390\/a14090270"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Sadegh Es-haghi, M., Abbaspour, M., Abbasianjahromi, H., and Mariani, S. (2021). Machine Learning-Based Prediction of the Seismic Bearing Capacity of a Shallow Strip Footing over a Void in Heterogenous Soils. Algorithms, 14.","DOI":"10.3390\/a14100288"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Dupin, N., Parize, R., and Talbi, E.G. (2021). Matheuristics and Column Generation for a Basic Technician Routing Problem. Algorithms, 14.","DOI":"10.3390\/a14110313"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Burr, T., Schwerdt, I., Sentz, K., McDonald, L., and Wilkerson, M. (2021). Overview of Algorithms for Using Particle Morphology in Pre-Detonation Nuclear Forensics. Algorithms, 14.","DOI":"10.3390\/a14120340"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/12\/357\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:43:46Z","timestamp":1760168626000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/12\/357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,9]]},"references-count":12,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2021,12]]}},"alternative-id":["a14120357"],"URL":"https:\/\/doi.org\/10.3390\/a14120357","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,9]]}}}