{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:06:43Z","timestamp":1760242003829,"version":"build-2065373602"},"reference-count":4,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2018,11,19]],"date-time":"2018-11-19T00:00:00Z","timestamp":1542585600000},"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 study of reconfiguration problems has grown into a field of its own. The basic idea is to consider the scenario of moving from one given (feasible) solution to another, maintaining feasibility for all intermediate solutions. The solution space is often represented by a \u201creconfiguration graph\u201d, where vertices represent solutions to the problem in hand and an edge between two vertices means that one can be obtained from the other in one step. A typical application background would be for a reorganization or repair work that has to be done without interruption to the service that is provided.<\/jats:p>","DOI":"10.3390\/a11110187","type":"journal-article","created":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T11:23:27Z","timestamp":1542799407000},"page":"187","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Special Issue on Reconfiguration Problems"],"prefix":"10.3390","volume":"11","author":[{"given":"Faisal","family":"Abu-Khzam","sequence":"first","affiliation":[{"name":"Department of Computer Science and Mathematics, Lebanese American University, Beirut 11022801, Lebanon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4444-3220","authenticated-orcid":false,"given":"Henning","family":"Fernau","sequence":"additional","affiliation":[{"name":"Informatikwissenschaften, CIRT, FB IV, Universit\u00e4t Trier, Universit\u00e4tsring 15, 54296 Trier, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0895-3765","authenticated-orcid":false,"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[{"name":"School of Information Science, Japan Advanced Institute of Science and Technology, Asahidai 1-1, Nomi, Ishikawa 923-1292, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,11,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Nishimura, N. (2018). Introduction to Reconfiguration. Algorithms, 11.","DOI":"10.3390\/a11040052"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., and Siebertz, S. (2018). Vertex Cover Reconfiguration and Beyond. Algorithms, 11.","DOI":"10.3390\/a11020020"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Haas, R., and MacGillivray, G. (2018). Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs. Algorithms, 11.","DOI":"10.3390\/a11040040"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Takaoka, A. (2018). Complexity of Hamiltonian Cycle Reconfiguration. Algorithms, 11.","DOI":"10.3390\/a11090140"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/11\/187\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:30:33Z","timestamp":1760196633000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/11\/187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,19]]},"references-count":4,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2018,11]]}},"alternative-id":["a11110187"],"URL":"https:\/\/doi.org\/10.3390\/a11110187","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2018,11,19]]}}}