{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:33:10Z","timestamp":1725456790832},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615491"},{"type":"electronic","value":"9783540688082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0030100","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:38:48Z","timestamp":1133415528000},"page":"89-103","source":"Crossref","is-referenced-by-count":3,"title":["Fast distributed genetic algorithms for partitioning uniform grids"],"prefix":"10.1007","author":[{"given":"Ioannis T.","family":"Christou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert R.","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"I. T. Christou and R. R. Meyer. Optimal and asymptotically optimal equipartition of rectangular domains via stripe decomposition. In H. Fischer, B. Riedmuller, and S. Schaffler, editors, Applied Mathematics and Parallel Computing \u2014 Festschrift for Klaus Ritter, pages 77\u201396. Physica-Verlag, 1996.","DOI":"10.1007\/978-3-642-99789-1_6"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00229299","volume":"8","author":"I. T. Christou","year":"1996","unstructured":"I. T. Christou and R. R. Meyer. Optimal equi-partition of rectangular domains for parallel computation. Journal of Global Optimization, 8:15\u201334, January 1996.","journal-title":"Journal of Global Optimization"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"P. Crandall and M. Quinn. Non-uniform 2-d grid partitioning for heterogeneous parallel architectures. In Proceedings of the 9th International Symposium on Parallel Processing, pages 428\u2013435, 1995.","DOI":"10.1109\/IPPS.1995.395966"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM 3 User's Guide and Reference Manual. Oak Ridge National Laboratory, 1994.","DOI":"10.7551\/mitpress\/5712.001.0001"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"J. R. Gilbert, G. L. Miller, and S. H. Teng. Geometric mesh partitioning: Implementation and experiments. In Proceedings of the 9th International Symposium on Parallel Processing, pages 418\u2013427, 1995.","DOI":"10.1109\/IPPS.1995.395965"},{"key":"7_CR6","unstructured":"B. Hendrickson and R. Leland. The Chaco User's Guide Version 2.0. Sandia National Laboratories, July 1995."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0916028","volume":"16","author":"B. Hendrickson","year":"1995","unstructured":"B. Hendrickson and R. Leland. An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J. on Sci. Comput., 16:452\u2013469, 1995.","journal-title":"SIAM J. on Sci. Comput."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"John Holland. Adaptation in Natural and Artificial Systems. MIT Press, 1992.","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"B. W. Kernighan and S. Lin. An effective heuristic procedure for partitioning graphs. Bell Systems Tech. Journal, pages 291\u2013308, February 1970.","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"M. Laguna, T. A. Feo, and H. C. Elrod. A greedy randomized adaptive search procedure for the two \u2014 partition problem. Operations Research, July\u2013August 1994.","DOI":"10.1287\/opre.42.4.677"},{"key":"7_CR11","volume-title":"Technical Report MP-TR-96-2","author":"W. Martin","year":"1996","unstructured":"W. Martin. Fast equi-partitioning of rectangular domains using stripe decomposition. Technical Report MP-TR-96-2, University of Wisconsin-Madison, February 1996."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(92)00103-S","volume":"48","author":"M. B. Melou","year":"1994","unstructured":"M. Bousquet Melou. Codage des polyominos convexes et equation pour l'enumeration suivant l'aire. Discrete Applied Mathematics, 48:21\u201343, 1994.","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Zbigniew Michalewicz. Genetic Algorithms + Data Structures=Evolution Programs. Springer-Verlag, 1994.","DOI":"10.1007\/978-3-662-07418-3"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"G. L. Miller, S. H. Teng, W. Thurston, and S. A. Vavasis. Automatic mesh partitioning. In A. George, J. R. Gilbert, and J. W. H. Liu, editors, Graph Theory and Sparse Matrix Computation. Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4613-8369-7_3"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"P. M. Pardalos, F. Rendl, and H. Wolkowicz. The quadratic assignment problem: A survey and recent developments. In P. M. Pardalos and H. Wolkowicz, editors, Quadratic Assignment and Related Problems. American Mathematical Society, 1993.","DOI":"10.1090\/dimacs\/016\/01"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"A. Pothen, H. D. Simon, and K. P. Liu. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Matrix Analysis and Applications, 11:430\u2013452, 1990.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"7_CR17","first-page":"45","volume-title":"Intelligent structural operators for the k-way graph partitioning problem","author":"G. Laszewski von","year":"1991","unstructured":"G. von Laszewski. Intelligent structural operators for the k-way graph partitioning problem. In R. Belew and L. Booker, editors, Proceedings of the Fourth Intl. Conference on Genetic Algorithms, pages 45\u201352. Morgan Kaufmann Publishers, Los Altos, CA, 1991."},{"key":"7_CR18","volume-title":"PhD thesis","author":"J. Yackel","year":"1993","unstructured":"J. Yackel. Minimum Perimeter Tiling in Parallel Computation. PhD thesis, University of Wisconsin-Madison, August 1993."},{"key":"7_CR19","unstructured":"J. Yackel and R. R. Meyer. Optimal tilings for parallel database design. In P. M. Pardalos, editor, Advances in Optimization and Parallel Computing, pages 293\u2013309. North-Holland, 1992."}],"container-title":["Lecture Notes in Computer Science","Parallel Algorithms for Irregularly Structured Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:16:04Z","timestamp":1586592964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615491","9783540688082"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0030100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}