{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:31:11Z","timestamp":1725543071011},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_9","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"63-72","source":"Crossref","is-referenced-by-count":0,"title":["Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size"],"prefix":"10.1007","author":[{"given":"Takehiro","family":"Ito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuya","family":"Goto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J.\u00a0Algorithms\u00a012, 308\u2013340 (1991)","journal-title":"J.\u00a0Algorithms"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/0196-6774(90)90013-5","volume":"11","author":"H.L. Bodlaender","year":"1990","unstructured":"Bodlaender, H.L.: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. J.\u00a0Algorithms\u00a011, 631\u2013643 (1990)","journal-title":"J.\u00a0Algorithms"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/S0377-2217(01)00380-0","volume":"144","author":"B. Bozkaya","year":"2003","unstructured":"Bozkaya, B., Erkut, E., Laporte, G.: A tabu search heuristic and adaptive memory procedure for political districting. European J.\u00a0Operational Research\u00a0144, 12\u201326 (2003)","journal-title":"European J.\u00a0Operational Research"},{"key":"9_CR4","volume-title":"Digital Image Processing","author":"R.C. Gonzalez","year":"1977","unstructured":"Gonzalez, R.C., Wintz, P.: Digital Image Processing. Addison-Wesley, Reading (1977)"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.jda.2005.01.005","volume":"4","author":"T. Ito","year":"2006","unstructured":"Ito, T., Zhou, X., Nishizeki, T.: Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. J.\u00a0Discrete Algorithms\u00a04, 142\u2013154 (2006)","journal-title":"J.\u00a0Discrete Algorithms"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0166-218X(93)90048-S","volume":"42","author":"M. Lucertini","year":"1993","unstructured":"Lucertini, M., Perl, Y., Simeone, B.: Most uniform path partitioning and its use in image processing. Discrete Applied Mathematics\u00a042, 227\u2013256 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR7","first-page":"623","volume":"29","author":"K. Takamizawa","year":"1982","unstructured":"Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J.\u00a0ACM\u00a029, 623\u2013641 (1982)","journal-title":"J.\u00a0ACM"},{"key":"9_CR8","volume-title":"Operating Systems","author":"D.C. Tsichritzis","year":"1974","unstructured":"Tsichritzis, D.C., Bernstein, P.A.: Operating Systems. Academic Press, New York (1974)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1111\/j.1435-5597.1995.tb00626.x","volume":"74","author":"J.C. Williams Jr.","year":"1995","unstructured":"Williams Jr., J.C.: Political redistricting: a review. Papers in Regional Science\u00a074, 13\u201340 (1995)","journal-title":"Papers in Regional Science"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:26:45Z","timestamp":1619508405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11809678_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}