{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:41:27Z","timestamp":1743050487642,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648246"},{"type":"electronic","value":"9783540685357"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-68535-9_17","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:31:22Z","timestamp":1193473882000},"page":"137-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Min-Max-Boundary Domain Decomposition"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2002,6,4]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"N. Alon, P. Seymour, and R. Thomas. A separator theorem for graphs with an excluded minor and its applications. In STOC90, pages 293\u2013299. ACM, 1990.","DOI":"10.1145\/100216.100254"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1038\/324446a0","volume":"324","author":"J. Barnes","year":"1986","unstructured":"J. Barnes and P. Hut. A hierarchical O(n log n) force calculation algorithm. Nature, (324):446\u2013449, 1986.","journal-title":"Nature"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"M. Benantar, R. Biswas, J. E. Flaherty, and M. S. Shephard. Parallel computation with adaptive methods for elliptic and hyperbolic systems. Comp. Methods Applied Mech. and Eng., pages 73\u201393, 1990.","DOI":"10.1016\/0045-7825(90)90159-J"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"M. Bern, D. Eppstein, and J. R. Gilbert. Provably good mesh generation. In FOCS90, pages 231\u2013241. IEEE, 1990.","DOI":"10.1109\/FSCS.1990.89542"},{"key":"17_CR5","first-page":"300","volume":"28","author":"S. N. Bhatt","year":"1984","unstructured":"S. N. Bhatt and F. T. Leighton. A framework for solving VLSI graph layout Problems. JCSS, 28, pp 300\u2013343, 1984.","journal-title":"JCSS"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1090\/S0025-5718-1986-0829613-0","volume":"46","author":"J. H. Bramble","year":"1986","unstructured":"J. H. Bramble, J. E. Pasciak, and A. H. Schatz. An iterative method for elliptic problems on regions partitioned into substructures. Math. Comp., 46:361\u20139, 1986.","journal-title":"Math. Comp."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1137\/0909044","volume":"9","author":"J. Carrier","year":"1988","unstructured":"J. Carrier, L. Greengard, and V. Rokhlin. A fast adaptive multipole algorithm for particle simulations. SIAM J. Sci. Statist. Comput. 9:669\u2013686, 1988.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"T. F. Chan and T. P. Mathew. Domain decomposition algorithms. Acta Numerica, pages 61\u2013144, 1994.","DOI":"10.1017\/S0962492900002427"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"J. R. Gilbert, G. L. Miller, and S.-H. Teng. Geometric mesh partitioning: Implementation and experiments. In SIAM J. Sci. Comput., to appear, 1999.","DOI":"10.1137\/S1064827594275339"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0196-6774(84)90019-1","volume":"5","author":"J.R. Gilbert","year":"1984","unstructured":"J.R. Gilbert, J.P. Hutchinson, and R.E. Tarjan. A separation theorem for graphs of bounded genus. Journal of Algorithms, 5:391\u2013407, 1984.","journal-title":"Journal of Algorithms"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM J. of Appl. Math., 36:177\u2013189, April 1979.","journal-title":"SIAM J. of Appl. Math."},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM J. on Numerical Analysis, 16:346\u2013358, 1979.","journal-title":"SIAM J. on Numerical Analysis"},{"key":"17_CR13","unstructured":"G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vavasis. Finite element meshes and geometric separators. SIAM J. Sci. Comput., to appear, 1999."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vavasis. Separators for sphere-packings and nearest neighborhood graphs. J. ACM, Jan. 1997.","DOI":"10.1145\/256292.256294"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"H. D. Simon and S.-H. Teng. How good is recursive bisection? SIAM J. Sci. Comput., to appear, 1996.","DOI":"10.1137\/S1064827593255135"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"D. A. Spielman and S.-H. Teng. Spectral partitioning works: planar graphs and finite element meshes. In FOCS96, pages 96\u2013107, IEEE, 1996.","DOI":"10.1109\/SFCS.1996.548468"},{"key":"17_CR17","volume-title":"An Analysis of the Finite Element Method","author":"G. Strang","year":"1973","unstructured":"G. Strang and G. J. Fix. An Analysis of the Finite Element Method. Prentice-Hall, Englewood Cliffs, New Jersey, 1973."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"S.-H. Teng. Provably good partitioning and load balancing algorithms for parallel adaptive n-body simulation. SIAM J. Scientific Computing, to appear, 1999.","DOI":"10.1137\/S1064827595288942"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68535-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:26:36Z","timestamp":1737501996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68535-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648246","9783540685357"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-68535-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"4 June 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}