{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T14:57:58Z","timestamp":1790261878609,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540426127","type":"print"},{"value":"9783540454229","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45422-5_17","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T11:01:34Z","timestamp":1183546894000},"page":"229-243","source":"Crossref","is-referenced-by-count":7,"title":["Finding Optimal Solutions to Atomix"],"prefix":"10.1007","author":[{"given":"Falk","family":"H\u00fcffner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Edelkamp","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Henning","family":"Fernau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,9,3]]},"reference":[{"key":"17_CR1","unstructured":"J. C. Culberson. Sokoban is PSPACE-complete. In E. Lodi, L. Pagli, and N. Santoro, editors, Proc. FUN-98, pp. 65\u201376. Carleton Scientific, Waterloo, 1998."},{"issue":"3","key":"17_CR2","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1111\/0824-7935.00065","volume":"14","author":"J. C. Culberson","year":"1998","unstructured":"J. C. Culberson and J. Schaeffer. Pattern databases. Computational Intelligence, 14(3):318\u2013334, 1998.","journal-title":"Computational Intelligence"},{"key":"17_CR3","unstructured":"E. D. Demaine, M. L. Demaine, and J. O\u2019Rourke. PushPush and Push-1 are NPhard in 2D. In Proc. 12th Canadian Conf. Computational Geometry, pp. 211\u2013219, Fredericton, 2000."},{"key":"17_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/3-540-60343-3_29","volume-title":"Proc. KI-95","author":"J. Eckerle","year":"1995","unstructured":"J. Eckerle and S. Schuierer. Efficient memory-limited graph search. In Proc. KI-95, vol. 981 of LNCS\/LNAI, pp. 101\u2013112. Springer, Berlin, 1995."},{"key":"17_CR5","first-page":"299","volume-title":"Proc. AAAI-98\/IAAI-98","author":"S. Edelkamp","year":"1998","unstructured":"S. Edelkamp and R. E. Korf. The branching factor of regular search spaces. In Proc. AAAI-98\/IAAI-98, pp. 299\u2013304. AAAI Press, Menlo Park, 1998."},{"key":"17_CR6","unstructured":"S. Edelkamp, A. L. Lafuente, and S. Leue. Protocol verification with heuristic search. In AAAI-Spring Symposium on Model-based Validation of Intelligence, pp. 75\u201383, 2001."},{"key":"17_CR7","unstructured":"S. Edelkamp and U. Meyer. Theory and Practice of Time-Space Trade-Offs in Memory Limited Search. This volume."},{"key":"17_CR8","first-page":"885","volume-title":"Proc. AAAI-00\/IAAI-00","author":"S. Edelkamp","year":"2000","unstructured":"S. Edelkamp and S. Schr\u00f6dl. Localizing A. In Proc. AAAI-00\/IAAI-00, pp. 885\u2013890. AAAI Press, Menlo Park, 2000."},{"issue":"3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0255(92)90070-O","volume":"63","author":"O. Hansson","year":"1992","unstructured":"O. Hansson, A. Mayer, and M. Yung. Criticizing solutions to relaxed models yields powerful admissible heuristics. Information Sciences, 63(3):207\u2013227, 1992.","journal-title":"Information Sciences"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P. E. Hart","year":"1968","unstructured":"P. E. Hart, N. J. Nilsson and B. Raphael. A formal basis for heuristic determination of minimum path cost. IEEE Transactions on on Systems Science and Cybernetics, 4:100\u2013107, 1968.","journal-title":"IEEE Transactions on on Systems Science and Cybernetics"},{"key":"17_CR11","unstructured":"G. J. Holzmann. On limits and possibilities of automated protocol analysis. In Proc. International Conf. Protocol Specification, Testing, and Verification, pp. 339\u2013346, Z\u00fcrich, 1987. North-Holland, Amsterdam."},{"key":"17_CR12","unstructured":"M. Holzer and S. Schwoon. Assembling Molecules in Atomix is Hard. Technical Report 0101, Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, May 2001."},{"issue":"1-2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0004-3702(01)00109-6","volume":"129","author":"A. Junghanns","year":"2001","unstructured":"A. Junghanns and J. Schaeffer. Sokoban: Enhancing general single-agent search methods using domain knowledge. Artificial Intelligence, 129(1-2):219\u2013251, 2001.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R. E. Korf","year":"1985","unstructured":"R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97\u2013109, 1985.","journal-title":"Artificial Intelligence"},{"key":"17_CR15","first-page":"1202","volume-title":"Proc. AAAI-96\/IAAI-96","author":"R. E. Korf","year":"1996","unstructured":"R. E. Korf and L. A. Taylor. Finding optimal solutions to the Twenty-Four Puzzle. In Proc. AAAI-96\/IAAI-96, pp. 1202\u20131207. AAAI Press, Menlo Park, 1996."},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"H. W. Kuhn. The Hungarian Method for the Assignment Problem. In Naval Res. Logist. Quart, pp. 83\u201398, 1955.","DOI":"10.1002\/nav.3800020109"},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0747-7171(08)80001-6","volume":"10","author":"D. Ratner","year":"1990","unstructured":"D. Ratner and M. K. Warmuth. The (n2-1)-puzzle and related relocation problems. Journal of Symbolic Computation, 10(2):111\u2013137, 1990.","journal-title":"Journal of Symbolic Computation"},{"issue":"7","key":"17_CR18","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/34.297950","volume":"16","author":"A. Reinefeld","year":"1994","unstructured":"A. Reinefeld and T. A. Marsland. Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(7):701\u2013710, 1994.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"17_CR19","first-page":"81","volume":"4","author":"U. Stern","year":"1996","unstructured":"U. Stern and D. L. Dill. Combining state space caching and hash compaction. In Methoden des Entwurfs und der Verifikation digitaler Systeme, 4. GI\/ITG\/GME Workshop, Berichte aus der Informatik, pp. 81\u201390, 1996. Shaker, Aachen.","journal-title":"Methoden des Entwurfs und der Verifikation digitaler Systeme"},{"key":"17_CR20","first-page":"59","volume-title":"Proc. CAV-93","author":"P. Wolper","year":"1993","unstructured":"P. Wolper and D. Leroy. Reliable hashing without collision detection. In Proc. CAV-93, pp. 59\u201370. Springer, Berlin, 1993."}],"container-title":["Lecture Notes in Computer Science","KI 2001: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45422-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T12:40:53Z","timestamp":1550407253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45422-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540426127","9783540454229"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45422-5_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}