{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:48:33Z","timestamp":1725490113804},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540435914"},{"type":"electronic","value":"9783540460435"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46043-8_35","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T12:57:11Z","timestamp":1188219431000},"page":"353-360","source":"Crossref","is-referenced-by-count":0,"title":["Domain Decomposition Coupled with Delaunay Mesh Generation"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Jurczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"Glut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,10]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. B.G. Teub-ner, 1990.","DOI":"10.1007\/978-3-322-92106-2_3"},{"key":"35_CR2","unstructured":"R.A. Davey. Decomposition of Unstructured Meshes for Efficient Parallel Computation. PhD thesis, University of Edinburgh, 1997."},{"key":"35_CR3","unstructured":"K. Schlogel, G. Karypis, and V. Kumar. Graph partitioning for high-performance scientific simulations. In J. Dongarra and et. al., editors, CRPC Parallel Computing Handbook. Morgan Kaufmann, 2000."},{"key":"35_CR4","first-page":"87185","volume-title":"Technical Report SAND93-0074","author":"B. Hendrickson","year":"1993","unstructured":"B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. Technical Report SAND93-0074, Sandia National Laboratories, Albuquerque, New Mexico 87185, 1993."},{"issue":"1","key":"35_CR5","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G. Karypis","year":"1998","unstructured":"G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, 48(1):96\u2013129, 1998.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"5","key":"35_CR6","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/0045-7949(88)90004-1","volume":"28","author":"C. Farhat","year":"1988","unstructured":"C. Farhat. A simple and efficient automatic FEM domain decomposer. Computers and Structures, 28(5):579\u2013602, 1988.","journal-title":"Computers and Structures"},{"issue":"2\/3","key":"35_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0956-0521(91)90014-V","volume":"2","author":"H.D. Simon","year":"1991","unstructured":"H.D. Simon. Partitioning of unstructured problems for parallel processing. Computing Systems in Engineering, 2(2\/3):135\u2013148, 1991.","journal-title":"Computing Systems in Engineering"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1002\/cpe.4330030502","volume":"3","author":"R.D. Williams","year":"1991","unstructured":"R.D. Williams. Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency, 3:457\u2013481, 1991.","journal-title":"Concurrency"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"B.W. Kernighan and S. Lin. An effective heuristic procedure for partitioning graphs. The Bell Systems Technical Journal, pages 291\u2013308, Feb. 1970.","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"C.M. Fiduccia and R.M. Mattheyses. A linear-time heuristic for improving network partitions. In Proc. of the 19th IEEE Design Automation Conference, pages 175\u2013181, 1982.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"T. Jurczyk, B. G\u0142ut, and J. Kitowski. An empirical comparison of decomposition algorithms for complex finite element meshes. Presented at Fourth International Conference on Parallel Processing and Applied Mathematics, Na\u0142ecz\u00f3w, 2001.","DOI":"10.1007\/3-540-48086-2_54"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2014 ICCS 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46043-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T12:42:34Z","timestamp":1556800954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46043-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540435914","9783540460435"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-46043-8_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}