{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:45:50Z","timestamp":1725500750622},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360640"},{"type":"electronic","value":"9783642360657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36065-7_20","type":"book-chapter","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T16:36:53Z","timestamp":1358786213000},"page":"206-216","source":"Crossref","is-referenced-by-count":0,"title":["Alliances and Bisection Width for Planar Graphs"],"prefix":"10.1007","author":[{"given":"Martin","family":"Olsen","sequence":"first","affiliation":[]},{"given":"Morten","family":"Revsb\u00e6k","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(84)90109-4","volume":"7","author":"T. Asano","year":"1984","unstructured":"Asano, T., Kikuchi, S., Saito, N.: A linear algorithm for finding hamiltonian cycles in 4-connected maximal planar graphs. Discrete Applied Mathematics\u00a07(1), 1\u201315 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1016\/j.dam.2005.10.014","volume":"154","author":"C. Bazgan","year":"2006","unstructured":"Bazgan, C., Tuza, Z., Vanderpooten, D.: The satisfactory partition problem. Discrete Appl. Math.\u00a0154, 1236\u20131245 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"20_CR3","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1016\/j.dam.2006.10.005","volume":"155","author":"C. Bazgan","year":"2007","unstructured":"Bazgan, C., Tuza, Z., Vanderpooten, D.: Efficient algorithms for decomposing graphs under degree constraints. Discrete Appl. Math.\u00a0155(8), 979\u2013988 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.ejor.2009.10.019","volume":"206","author":"C. Bazgan","year":"2010","unstructured":"Bazgan, C., Tuza, Z., Vanderpooten, D.: Satisfactory graph partition, variants, and generalizations. European Journal of Operational Research\u00a0206(2), 271\u2013280 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1021998507140","volume":"7","author":"C. Chen","year":"2003","unstructured":"Chen, C.: Any maximal planar graph with only one separating triangle is hamiltonian. J. Comb. Optim.\u00a07(1), 79\u201386 (2003)","journal-title":"J. Comb. Optim."},{"key":"20_CR6","unstructured":"Enciso, R.I.: Alliances in graphs: parameterized algorithms and on partitioning series-parallel graphs. PhD thesis, University of Central Florida (2009)"},{"issue":"6","key":"20_CR7","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1016\/j.disc.2011.11.030","volume":"312","author":"G. Fan","year":"2012","unstructured":"Fan, G., Xu, B., Yu, X., Zhou, C.: Upper bounds on minimum balanced bipartitions. Discrete Mathematics\u00a0312(6), 1077\u20131083 (2012)","journal-title":"Discrete Mathematics"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Flake, G., Lawrence, S., Lee Giles, C.: Efficient identification of web communities. In: Proc. 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 150\u2013160. ACM Press (2000)","DOI":"10.1145\/347090.347121"},{"key":"20_CR9","first-page":"37","volume":"38","author":"G.H. Fricke","year":"2003","unstructured":"Fricke, G.H., Lawson, L.M., Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T.: A note on defensive alliances in graphs. Bulletin ICA\u00a038, 37\u201341 (2003)","journal-title":"Bulletin ICA"},{"key":"20_CR10","first-page":"201","volume":"29","author":"M.U. Gerber","year":"2004","unstructured":"Gerber, M.U., Kobler, D.: Classes of graphs that can be partitioned to satisfy all their vertices. Australasian Journal of Combinatorics\u00a029, 201\u2013214 (2004)","journal-title":"Australasian Journal of Combinatorics"},{"key":"20_CR11","first-page":"157","volume":"48","author":"P. Kristiansen","year":"2004","unstructured":"Kristiansen, P., Hedetniemi, S.M., Hedetniemi, S.T.: Alliances in graphs. Journal of Combinatorial Mathematics and Combinatorial Computing\u00a048, 157\u2013177 (2004)","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Li, H., Liang, Y., Liu, M., Xu, B.: On minimum balanced bipartitions of triangle-free graphs. Journal of Combinatorial Optimization, 1\u201310 (2012)","DOI":"10.1007\/s10878-012-9539-y"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.ejor.2009.09.004","volume":"203","author":"S.C. Sung","year":"2010","unstructured":"Sung, S.C., Dimitrov, D.: Computational complexity in additive hedonic games. European Journal of Operational Research\u00a0203, 635\u2013639 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1006\/jctb.1994.1058","volume":"62","author":"R. Thomas","year":"1994","unstructured":"Thomas, R., Yu, X.X.: 4-connected projective-planar graphs are hamiltonian. Journal of Combinatorial Theory, Series B\u00a062(1), 114\u2013132 (1994)","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36065-7_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,6]],"date-time":"2022-02-06T10:55:58Z","timestamp":1644144958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36065-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360640","9783642360657"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36065-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}