{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:57:21Z","timestamp":1760079441394,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112683"},{"type":"electronic","value":"9783642112690"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-11269-0_10","type":"book-chapter","created":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T08:36:15Z","timestamp":1259656575000},"page":"122-133","source":"Crossref","is-referenced-by-count":16,"title":["What Makes Equitable Connected Partition Easy"],"prefix":"10.1007","author":[{"given":"Rosa","family":"Enciso","sequence":"first","affiliation":[]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Iyad","family":"Kanj","sequence":"additional","affiliation":[]},{"given":"Frances","family":"Rosamond","sequence":"additional","affiliation":[]},{"given":"Ond\u0159ej","family":"Such\u00fd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","first-page":"81","volume":"23","author":"M. Altman","year":"2007","unstructured":"Altman, M.: Is automation the answer? the computational complexity of automated redistricting. Rutgers Computer and Technology Law Journal\u00a023, 81\u2013142 (2007)","journal-title":"Rutgers Computer and Technology Law Journal"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11821069_21","volume-title":"Mathematical Foundations of Computer Science 2006","author":"J. Chen","year":"2006","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved parameterized upper bounds for vertex cover. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 238\u2013249. Springer, Heidelberg (2006)"},{"key":"10_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0020-0190(84)90024-3","volume":"18","author":"M.E. Dyer","year":"1984","unstructured":"Dyer, M.E., Frieze, A.M.: A partitioning algorithm for minimum weighted euclidean matching. Inf. Process. Lett.\u00a018(2), 59\u201362 (1984)","journal-title":"Inf. Process. Lett."},{"key":"10_CR5","series-title":"Texts in Algorithmics","first-page":"1","volume-title":"ACiD","author":"V. Estivill-Castro","year":"2005","unstructured":"Estivill-Castro, V., Fellows, M.R., Langston, M.A., Rosamond, F.A.: FPT is P-Time Extremal Structure I. In: Hajo Broersma, M.J., Szeider, S. (eds.) ACiD. Texts in Algorithmics, vol.\u00a04, pp. 1\u201341. King\u2019s College, London (2005)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-540-73556-4_38","volume-title":"Combinatorial Optimization and Applications","author":"M.R. Fellows","year":"2007","unstructured":"Fellows, M.R., Fomin, F.V., Lokshtanov, D., Rosamond, F.A., Saurabh, S., Szeider, S., Thomassen, C.: On the complexity of some colorful problems parameterized by treewidth. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol.\u00a04616, pp. 366\u2013377. Springer, Heidelberg (2007)"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci.\u00a0410(1), 53\u201361 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/978-3-642-02017-9_25","volume-title":"TAMC 2009","author":"J. Fiala","year":"2009","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Parameterized complexity of coloring problems: Treewidth versus vertex cover. In: Chen, J., Cooper, S.B. (eds.) TAMC 2009. LNCS, vol.\u00a05532, pp. 221\u2013230. Springer, Heidelberg (2009)"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A. Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica\u00a07(1), 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"10_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1093\/ietisy\/e90-d.2.449","volume":"90-D","author":"T. Ito","year":"2007","unstructured":"Ito, T., Goto, K., Zhou, X., Nishizeki, T.: Partitioning a multi-weighted graph to connected subgraphs of almost uniform size. IEICE Transactions\u00a090-D(2), 449\u2013456 (2007)","journal-title":"IEICE Transactions"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/978-3-540-30559-0_31","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T. Ito","year":"2004","unstructured":"Ito, T., Zhou, X., Nishizeki, T.: Partitioning a weighted graph to connected subgraphs of almost uniform size. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 365\u2013376. Springer, Heidelberg (2004)"},{"key":"10_CR13","volume-title":"Introduction to graph theory","author":"D. West","year":"1996","unstructured":"West, D.: Introduction to graph theory. Prentice Hall Inc., Upper Saddle River, NJ (1996)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11269-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T14:25:05Z","timestamp":1676643905000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11269-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642112683","9783642112690"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11269-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}