{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:38:30Z","timestamp":1743143910610,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_7","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:33:02Z","timestamp":1407839582000},"page":"69-80","source":"Crossref","is-referenced-by-count":1,"title":["Network-Based Dissolution"],"prefix":"10.1007","author":[{"given":"Ren\u00e9","family":"van Bevern","sequence":"first","affiliation":[]},{"given":"Robert","family":"Bredereck","sequence":"additional","affiliation":[]},{"given":"Jiehua","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Froese","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Altman, M.: Districting Principles and Democratic Representation. PhD thesis, California Institute of Technology (1998)","key":"7_CR1"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0196-6774(90)90001-U","volume":"11","author":"F. Berman","year":"1990","unstructured":"Berman, F., Johnson, D., Leighton, T., Shor, P.W., Snyder, L.: Generalized planar matching. Journal of Algorithms\u00a011(2), 153\u2013184 (1990)","journal-title":"Journal of Algorithms"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-662-43948-7_15","volume-title":"Automata, Languages, and Programming","author":"R. van Bevern","year":"2014","unstructured":"van Bevern, R., Bredereck, R., Bulteau, L., Chen, J., Froese, V., Niedermeier, R., Woeginger, G.J.: Star partitions of perfect graphs. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol.\u00a08572, pp. 174\u2013185. Springer, Heidelberg (2014)"},{"unstructured":"Duque, J.C.: Design of Homogeneous Territorial Units: A Methodological Proposal and Applications. PhD thesis, University of Barcelona (2004)","key":"7_CR4"},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1177\/0160017607301605","volume":"30","author":"J.C. Duque","year":"2007","unstructured":"Duque, J.C., Ramos, R., Surinach, J.: Supervised regionalization methods: A survey. International Regional Science Review\u00a030(3), 195\u2013220 (2007)","journal-title":"International Regional Science Review"},{"unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman (1979)","key":"7_CR6"},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1137\/0401046","volume":"1","author":"P. Hell","year":"1988","unstructured":"Hell, P., Kirkpatrick, D.G., Kratochv\u00edl, J., Kr\u00edz, I.: On restricted two-factors. SIAM Journal on Discrete Mathematics\u00a01(4), 472\u2013484 (1988)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s00355-008-0336-6","volume":"32","author":"Z. Landau","year":"2009","unstructured":"Landau, Z., Su, F.: Fair division and redistricting. Social Choice and Welfare\u00a032(3), 479\u2013492 (2009)","journal-title":"Social Choice and Welfare"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/03610929508831512","volume":"24","author":"M. Maravalle","year":"1995","unstructured":"Maravalle, M., Simeone, B.: A spanning tree heuristic for regional clustering. Communications in Statistics\u2014Theory and Methods\u00a024(3), 625\u2013639 (1995)","journal-title":"Communications in Statistics\u2014Theory and Methods"},{"issue":"8","key":"7_CR10","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1287\/mnsc.44.8.1100","volume":"44","author":"A. Mehrota","year":"1998","unstructured":"Mehrota, A., Johnson, E.L., Nemhauser, G.L.: An optimization based heuristic for political districting. Management Science\u00a044(8), 1100\u20131114 (1998)","journal-title":"Management Science"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1016\/j.mcm.2008.05.024","volume":"48","author":"C. Puppe","year":"2008","unstructured":"Puppe, C., Tasn\u00e1di, A.: A computational approach to unbiased districting. Mathematical and Computer Modelling\u00a048, 1455\u20131460 (2008)","journal-title":"Mathematical and Computer Modelling"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.econlet.2009.06.008","volume":"105","author":"C. Puppe","year":"2009","unstructured":"Puppe, C., Tasn\u00e1di, A.: Optimal redistricting under geographical constraints: Why \u201cpack and crack\u201d does not work. Economics Letters\u00a0105(1), 93\u201396 (2009)","journal-title":"Economics Letters"},{"doi-asserted-by":"crossref","unstructured":"Vassilevska Williams, V.: Multiplying matrices faster than Coppersmith-Winograd. In: Proc. 44th STOC, pp. 887\u2013898. ACM (2012)","key":"7_CR13","DOI":"10.1145\/2213977.2214056"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cosrev.2007.07.002","volume":"1","author":"R. Yuster","year":"2007","unstructured":"Yuster, R.: Combinatorial and computational aspects of graph packing and graph decomposition. Computer Science Review\u00a01(1), 12\u201326 (2007)","journal-title":"Computer Science Review"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T23:35:40Z","timestamp":1675121740000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}