{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T13:25:12Z","timestamp":1700227512321},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4429,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0304-3975(00)00143-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"253-266","source":"Crossref","is-referenced-by-count":5,"title":["Min\u2013max-boundary domain decomposition"],"prefix":"10.1016","volume":"261","author":[{"given":"Marcos","family":"Kiwi","sequence":"first","affiliation":[]},{"given":"Daniel A.","family":"Spielman","sequence":"additional","affiliation":[]},{"given":"Shang-Hua","family":"Teng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00143-2_BIB1","series-title":"A separator theorem for graphs with an excluded minor and its applications, Proc. 22th Annual ACM Symp. on Theory of Computing","first-page":"293","author":"Alon","year":"1990"},{"key":"10.1016\/S0304-3975(00)00143-2_BIB2","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1038\/324446a0","article-title":"A hierarchical O(nlogn) force calculation algorithm","volume":"324","author":"Barnes","year":"1986","journal-title":"Nature"},{"key":"10.1016\/S0304-3975(00)00143-2_BIB3","doi-asserted-by":"crossref","unstructured":"T.J. Barth, D.C. Jespersen, The design and application of upwind schemes on unstructured meshes, 27th Aerospace Sciences Meeting, AIAA, 1989.","DOI":"10.2514\/6.1989-366"},{"key":"10.1016\/S0304-3975(00)00143-2_BIB4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0045-7825(90)90159-J","article-title":"Parallel computation with adaptive methods for elliptic and hyperbolic systems","volume":"82","author":"Benantar","year":"1990","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"10.1016\/S0304-3975(00)00143-2_BIB5","series-title":"Provably good mesh generation, 31st Annual Symp. on Foundations of Computer Science","first-page":"231","author":"Bern","year":"1990"},{"key":"10.1016\/S0304-3975(00)00143-2_BIB6","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","article-title":"A framework for solving VLSI graph layout problems","volume":"28","author":"Bhatt","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00143-2_BIB7","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1090\/S0025-5718-1986-0829613-0","article-title":"An iterative method for elliptic problems on regions partitioned into substructures","volume":"46","author":"Bramble","year":"1986","journal-title":"Math. Comp."},{"key":"10.1016\/S0304-3975(00)00143-2_BIB8","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1137\/0909044","article-title":"A fast adaptive multipole algorithm for particle simulations","volume":"9","author":"Carrier","year":"1988","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/S0304-3975(00)00143-2_BIB9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1017\/S0962492900002427","article-title":"Domain decomposition algorithms","volume":"3","author":"Chan","year":"1994","journal-title":"Acta Numer."},{"key":"10.1016\/S0304-3975(00)00143-2_BIB10","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0196-6774(84)90019-1","article-title":"A separation theorem for graphs of bounded genus","volume":"5","author":"Gilbert","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(00)00143-2_BIB11","doi-asserted-by":"crossref","first-page":"2091","DOI":"10.1137\/S1064827594275339","article-title":"Geometric mesh partitioning","volume":"19","author":"Gilbert","year":"1998","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0304-3975(00)00143-2_BIB12","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1137\/0716027","article-title":"Generalized nested dissection","volume":"16","author":"Lipton","year":"1979","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/S0304-3975(00)00143-2_BIB13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","article-title":"A separator theorem for planar graphs","volume":"36","author":"Lipton","year":"1979","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"10.1016\/S0304-3975(00)00143-2_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/256292.256294","article-title":"Separators for sphere-packings and nearest neighborhood graphs","volume":"44","author":"Miller","year":"1997","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0304-3975(00)00143-2_BIB15","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/S1064827594262613","article-title":"Finite element meshes and geometric separators","volume":"19","author":"Miller","year":"1998","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"10.1016\/S0304-3975(00)00143-2_BIB16","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1137\/S1064827593255135","article-title":"How good is recursive bisection?","volume":"18","author":"Simon","year":"1997","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0304-3975(00)00143-2_BIB17","series-title":"Spectral partitioning works: planar graphs and finite element meshes, Proc. 37th Ann. Symp. on Foundation of Computer Science","first-page":"96","author":"Spielman","year":"1996"},{"key":"10.1016\/S0304-3975(00)00143-2_BIB18","series-title":"An Analysis of the Finite Element Method","author":"Strang","year":"1973"},{"issue":"2","key":"10.1016\/S0304-3975(00)00143-2_BIB19","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1137\/S1064827595288942","article-title":"Provably good partitioning and load balancing algorithms for parallel adaptive n-body simulation","volume":"19","author":"Teng","year":"1998","journal-title":"SIAM J. Sci. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001432?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001432?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T10:21:22Z","timestamp":1556792482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0304397500001432"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00143-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}