{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:07:45Z","timestamp":1743138465979,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319621265"},{"type":"electronic","value":"9783319621272"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-62127-2_4","type":"book-chapter","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T02:47:31Z","timestamp":1499136451000},"page":"37-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Complexity of Tree Partitioning"],"prefix":"10.1007","author":[{"given":"Zhao","family":"An","sequence":"first","affiliation":[]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Iyad","family":"Kanj","sequence":"additional","affiliation":[]},{"given":"Ge","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"key":"4_CR1","unstructured":"An, Z., Feng, Q., Kanj, I., Xia, G.: The Complexity of Tree Partitioning. http:\/\/arxiv.org\/abs\/1704.05896"},{"issue":"6","key":"4_CR2","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s00224-006-1350-7","volume":"39","author":"K Andreev","year":"2006","unstructured":"Andreev, K., R\u00e4cke, H.: Balanced graph partitioning. Theory of Computing Systems 39(6), 929\u2013939 (2006)","journal-title":"Theory of Computing Systems"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Arbenz, P., van Lenthe, G., Mennel, U., M\u00fcler, R., Sala, M.: Multi-level $$\\mu $$-finite element analysis for human bone structures. In: PARA 2006, pp. 240\u2013250 (2006)","DOI":"10.1007\/978-3-540-75755-9_30"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"S Bhatt","year":"1984","unstructured":"Bhatt, S., Leighton, F.: A framework for solving VLSI graph layout problems. Journal of Computer and System Sciences 28(2), 300\u2013343 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Boscznay, \u00c1.: On the lower estimation of non-averaging sets. Acta Mathematica Hungariga 53(1-1), 155\u2013157 (1989)","DOI":"10.1007\/BF02170066"},{"issue":"6","key":"4_CR6","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1016\/j.jcss.2006.11.001","volume":"73","author":"J Chen","year":"2007","unstructured":"Chen, J., Kanj, I., Perkovic, L., Sedgwick, E., Xia, G.: Genus characterizes the complexity of certain graph problems: Some tight results. Journal of Computer and System Sciences 73(6), 892\u2013907 (2007)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2\u20133","key":"4_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.tcs.2005.02.003","volume":"339","author":"Y Chen","year":"2005","unstructured":"Chen, Y., Flum, J., Grohe, M.: Machine-based methods in parameterized complexity theory. Theoretical Computer Science 339(2\u20133), 167\u2013199 (2005)","journal-title":"Theoretical Computer Science"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-20662-7_32","volume-title":"Experimental Algorithms","author":"D Delling","year":"2011","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 376\u2013387. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-20662-7_32"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1145\/1101821.1101823","volume":"52","author":"E Demaine","year":"2005","unstructured":"Demaine, E., Fomin, F., Hajiaghayi, M., Thilikos, D.: Subexponential parameterized algorithms on bounded-genus graphs and $$H$$-minor-free graphs. J. ACM 52, 866\u2013893 (2005)","journal-title":"J. ACM"},{"key":"4_CR10","unstructured":"Diestel, R.: Graph Theory, 4th edn. Springer (2012)"},{"key":"4_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"R Downey","year":"2013","unstructured":"Downey, R., Fellows, M.: Fundamentals of Parameterized Complexity. Springer, New York (2013)"},{"key":"4_CR12","unstructured":"Feldmann, A.: Balanced partitions of grids and related graphs. Ph.D. thesis, ETH, Zurich, Switzerland (2012)"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/s00453-013-9802-3","volume":"71","author":"A Feldmann","year":"2015","unstructured":"Feldmann, A., Foschini, L.: Balanced partitions of trees and applications. Algorithmica 71(2), 354\u2013376 (2015)","journal-title":"Algorithmica"},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00453-014-9928-y","volume":"71","author":"A Feldmann","year":"2015","unstructured":"Feldmann, A., Widmayer, P.: An $$O(n^4)$$ time algorithm to compute the bisection width of solid grid graphs. Algorithmica 71(1), 181\u2013200 (2015)","journal-title":"Algorithmica"},{"key":"4_CR15","unstructured":"Fomin, F., Kolay, S., Lokshtanov, D., Panolan, F., Saurabh, S.: Subexponential algorithms for rectilinear steiner tree and arborescence problems. In: SoCG 2016, pp. 39: 1\u201339: 15 (2016)"},{"key":"4_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1112\/plms\/s2-17.1.75","volume":"17","author":"G Hardy","year":"1918","unstructured":"Hardy, G., Ramanujan, S.: Asymptotic formulae in combinatory analysis. Proceedings of the London Mathematical Society 17(2), 75\u2013115 (1918)","journal-title":"Proceedings of the London Mathematical Society"},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.jcss.2012.04.004","volume":"79","author":"K Jansen","year":"2013","unstructured":"Jansen, K., Kratsch, S., Marx, D., Schlotter, I.: Bin packing with fixed number of bins revisited. Journal of Computer and System Sciences 79(1), 39\u201349 (2013)","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR19","first-page":"1812","volume":"2014","author":"P Klein","year":"2014","unstructured":"Klein, P., Marx, D.: A subexponential parameterized algorithm for subset TSP on planar graphs. SODA 2014, 1812\u20131830 (2014)","journal-title":"SODA"},{"key":"4_CR20","unstructured":"MacGregor, R.: On partitioning a graph: a theoretical and empirical study. Ph.D. thesis, University of California at Berkeley, California, USA (1978)"},{"key":"4_CR21","unstructured":"R\u00e4cke, H., Stotz, R.: Improved approximation algorithms for balanced partitioning problems. In STACS 2016, pp. 58: 1\u201358: 14 (2016)"},{"issue":"8","key":"4_CR22","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(8), 888\u2013905 (2000)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"4_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00224-014-9557-5","volume":"57","author":"R van Bevern","year":"2015","unstructured":"van Bevern, R., Feldmann, A., Sorge, M., Such\u00fd, O.: On the parameterized complexity of computing balanced partitions in graphs. Theory of Computing Systems 57(1), 1\u201335 (2015)","journal-title":"Theory of Computing Systems"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62127-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:16:03Z","timestamp":1709828163000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62127-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319621265","9783319621272"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62127-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"5 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. John's","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}