{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:21:48Z","timestamp":1725492108225},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439776"},{"type":"electronic","value":"9783540456438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45643-0_8","type":"book-chapter","created":{"date-parts":[[2007,9,24]],"date-time":"2007-09-24T20:58:33Z","timestamp":1190667513000},"page":"98-110","source":"Crossref","is-referenced-by-count":4,"title":["Partitioning Planar Graphs with Costs and Weights"],"prefix":"10.1007","author":[{"given":"Lyudmil","family":"Aleksandrov","sequence":"first","affiliation":[]},{"given":"Hristo","family":"Djidjev","sequence":"additional","affiliation":[]},{"given":"Hua","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,12]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S0895480194272183","volume":"9","author":"L. Aleksandrov","year":"1996","unstructured":"L. Aleksandrov and H. Djidjev, Linear Algorithms for partitioning embedded graphs of bounded genus, SIAM J. Disc. Math., Vol. 9, No. 1, pp. 129\u2013150, Feb. 1996.","journal-title":"SIAM J. Disc. Math."},{"issue":"4","key":"8_CR2","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/175276.175279","volume":"37","author":"W. J. Camp","year":"1994","unstructured":"W. J. Camp, S. J. Plimpton, B. A. Hendrickson, and R. W. Leland. Massively parallel methods for engineering and science problems. Communications of the ACM, 37(4):30\u201341, April 1994.","journal-title":"Communications of the ACM"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1006\/jagm.1993.1013","volume":"34","author":"K. Diks","year":"1993","unstructured":"K. Diks, H. N. Djidjev, O. Sykora, and I. Vrto. Edge separators of planar graphs and outerplanar graphs with applications. J. Algorithms, 34:258\u2013279, 1993.","journal-title":"J. Algorithms"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s004530010031","volume":"28","author":"H. N. Djidjev","year":"2000","unstructured":"H. N. Djidjev. Partitioning planar graphs with vertex costs: Algorithms and applications. Algorithmica, 28(1):51\u201375, 2000.","journal-title":"Algorithmica"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/0603022","volume":"3","author":"H. N. Djidjev","year":"1982","unstructured":"Hristo N. Djidjev. On the problem of partitioning planar graphs. SIAM Journal on Algebraic and Discrete Methods, 3:229\u2013240, 1982.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"6","key":"8_CR6","doi-asserted-by":"publisher","first-page":"2091","DOI":"10.1137\/S1064827594275339","volume":"19","author":"John. R. Gilbert","year":"1998","unstructured":"John. R. Gilbert, Gary L. Miller, and Shang-Hua Teng. Geometric mesh partitioning: Implementation and experiments. SIAM Journal on Scientific Computing, 19(6):2091\u20132110, 1998.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"B. Hendrickson and R. Leland. The Chaco user\u2019s guide \u2014 version 2.0, Sandia National Laboratories, Technical Report SAND94-2692, 1994.","DOI":"10.2172\/10106339"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Monika R. Henzinger, Philip Klein, Satish Rao, and Sairam Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55(1):3\u201323, August 1997.","DOI":"10.1006\/jcss.1997.1493"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, pages 291\u2013307, February 1970.","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. J. Lipton","year":"1979","unstructured":"Richard J. Lipton and Robert E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math, 36:177\u2013189, 1979.","journal-title":"SIAM J. Appl. Math"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/204865.204889","volume":"38","author":"K. Mehlhorn","year":"1995","unstructured":"K. Mehlhorn and S. N\u00e4her. Leda, a platform for combinatorial and geometric computing. Communications of ACM, 38:96\u2013102, 1995.","journal-title":"Communications of ACM"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"H.S. Maini, K.G. Mehrotra, C.K. Mohan, S. Ranka, Genetic algorithms for graph partitioning and incremental graph partitioning, CRPC-TR-94504, Rice University, 1994.","DOI":"10.1145\/602847.602848"},{"issue":"3","key":"8_CR13","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11(3):430\u2013452, July 1990.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"8_CR14","unstructured":"K. Schloegel, G. Karypis, and V. Kumar. Graph Partitioning for High Performance Scientific Simulations. In J. Dongarra et al., editor, CRPC Parallel Computing Handbook. Morgan Kaufmann (in press)."}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering and Experiments"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45643-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T03:53:45Z","timestamp":1556855625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45643-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439776","9783540456438"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45643-0_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}