{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:48:59Z","timestamp":1749221339154},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573142"},{"type":"electronic","value":"9783540480556"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57314-3_8","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:47:15Z","timestamp":1330260435000},"page":"87-104","source":"Crossref","is-referenced-by-count":3,"title":["Shortest non-synchronized motions parallel versions for shared memory crew models"],"prefix":"10.1007","author":[{"given":"Sabine","family":"Stifter","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"issue":"no.1","key":"8_CR1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02187714","volume":"4","author":"P. J. Rezende de","year":"1989","unstructured":"de Rezende, P.J., Lee, D.T., Wu, Y.F., 1989: Rectilinear shortest paths with rectangular barriers; Discrete and Computational Geometry, vol. 4, no. 1, pp. 41\u201353.","journal-title":"Discrete and Computational Geometry"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Gewali, L., Meng, A., Mitchell, J.S.B., Ntafos, S., 1988: Path planning in 0\/1\/\u221e Weighted Regions with Applications; Proceedings of the International Symposium on Computational Geometry, June 4\u20138, 1988, Urbana-Champaign, Illinois, pp. 266\u2013278.","DOI":"10.1145\/73393.73421"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Ke, Y., 1989: On efficient algorithm for link distance problems; 5th ACM Symposium on Computational Geometry, pp. 69\u201378, ACM, June 1989.","DOI":"10.1145\/73833.73841"},{"key":"8_CR4","unstructured":"Lakhani, G. Dorairaj, R.A., 1987: A VLSI implementation of all-pair shortest path problem; Proc. 1987 Int. Conf. on Parallel Processing, IEEE Computer Society, pp. 207\u2013209."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., 1984: Data structures and algorithms 2: graph algorithms and NP-completeness; EATCS Monographs on Theoretical Computer Science, Springer.","DOI":"10.1007\/978-3-642-69897-2"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B., Rote, G., Woeginger, G., 1990: Minimum link paths among obstacles in the plane; 6th ACM Symposium on Computational Geometry, pp. 63\u201372, ACM, June 1990.","DOI":"10.1145\/98524.98537"},{"key":"8_CR7","unstructured":"Paige, R.C., Kruskal, C.P., 1985: Parallel algorithms for shortest path problems; IEEE, 1985, pp. 14\u201320."},{"key":"8_CR8","unstructured":"Quinn, M.J., Yoo, Y.B., 1984: Data structures for the efficient solution of graph theoretic problems on tightly-coupled MIMD computers; IEEE, 1984, pp. 431\u2013438."},{"key":"8_CR9","volume-title":"Technical Report 92-41, RISC-Linz","author":"S. Stifter","year":"1992","unstructured":"Stifter, S., 1992: Path planning for non-synchronized motions; Technical Report 92-41, RISC-Linz, Johannes Kepler University, A-4040 Linz, Austria."},{"key":"8_CR10","volume-title":"Technical Report, RISC-Linz","author":"S. Stifter","year":"1992","unstructured":"Stifter, S., 1992a: Optimal collision free path planning for non-synchronized motions; Technical Report, RISC-Linz, Johannes Kepler University, A-4040 Linz, Austria."},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0743-7315(92)90038-O","volume":"16","author":"T. Takaoka","year":"1992","unstructured":"Takaoka, T., Umehara, K., 1992: An efficient VLSI algorithm for the all pairs shortest path problem; Journal of Parallel and Distributed Computing, vol. 16, pp. 265\u2013270.","journal-title":"Journal of Parallel and Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Parallel Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57314-3_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:03:38Z","timestamp":1619571818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57314-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573142","9783540480556"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-57314-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}