{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:26:10Z","timestamp":1743056770877,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662535356"},{"type":"electronic","value":"9783662535363"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53536-3_17","type":"book-chapter","created":{"date-parts":[[2016,9,27]],"date-time":"2016-09-27T12:39:25Z","timestamp":1474979965000},"page":"195-206","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability"],"prefix":"10.1007","author":[{"given":"Didem","family":"G\u00f6z\u00fcpek","sequence":"first","affiliation":[]},{"given":"Sibel","family":"\u00d6zkan","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[]},{"given":"Ignasi","family":"Sau","sequence":"additional","affiliation":[]},{"given":"Mordechai","family":"Shalom","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,28]]},"reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1002\/net.20423","volume":"57","author":"E Amaldi","year":"2011","unstructured":"Amaldi, E., Galbiati, G., Maffioli, F.: On minimum reload cost paths, tours, and flows. Networks 57(3), 254\u2013260 (2011)","journal-title":"Networks"},{"issue":"8","key":"17_CR2","doi-asserted-by":"crossref","first-page":"1739","DOI":"10.1016\/j.comnet.2013.03.004","volume":"57","author":"S Arkoulis","year":"2013","unstructured":"Arkoulis, S., Anifantis, E., Karyotis, V., Papavassiliou, S., Mitrou, N.: On the optimal, fair and channel-aware cognitive radio network reconfiguration. Comput. Netw. 57(8), 1739\u20131757 (2013)","journal-title":"Comput. Netw."},{"key":"17_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Switzerland (2015)"},{"issue":"3","key":"17_CR4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1142\/S0218195912500045","volume":"22","author":"M Berg de","year":"2012","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geom. Appl. 22(3), 187\u2013206 (2012)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"17_CR5","series-title":"Texts in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013)"},{"key":"17_CR6","unstructured":"\u00c7elenlio\u011flu, M. R., G\u00f6z\u00fcpek, D., Mantar, H. A.: A survey on the energy efficiency of vertical handover mechanisms. In: Proceedings of the International Conference on Wireless and Mobile Networks (WiMoN) (2013)"},{"key":"17_CR7","series-title":"Texts in Theoretical Computer Science","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. Springer, Heidelberg (2006)"},{"issue":"18","key":"17_CR8","doi-asserted-by":"crossref","first-page":"3494","DOI":"10.1016\/j.dam.2008.02.013","volume":"156","author":"G Galbiati","year":"2008","unstructured":"Galbiati, G.: The complexity of a minimum reload cost diameter problem. Discrete Appl. Math. 156(18), 3494\u20133497 (2008)","journal-title":"Discrete Appl. Math."},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/978-3-642-20662-7_10","volume-title":"Experimental Algorithms","author":"G Galbiati","year":"2011","unstructured":"Galbiati, G., Gualandi, S., Maffioli, F.: On minimum changeover cost arborescences. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 112\u2013123. Springer, Heidelberg (2011)"},{"key":"17_CR10","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/j.dam.2011.12.006","volume":"164","author":"G Galbiati","year":"2014","unstructured":"Galbiati, G., Gualandi, S., Maffioli, F.: On minimum reload cost cycle cover. Discrete Appl. Math. 164, 112\u2013120 (2014)","journal-title":"Discrete Appl. Math."},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/978-3-662-48054-0_29","volume-title":"Mathematical Foundations of Computer Science 2015","author":"R Ganian","year":"2015","unstructured":"Ganian, R., Kim, E.J., Szeider, S.: Algorithmic applications of tree-cut width. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 348\u2013360. Springer, Heidelberg (2015)"},{"issue":"13","key":"17_CR12","doi-asserted-by":"crossref","first-page":"1404","DOI":"10.1016\/j.dam.2010.03.009","volume":"158","author":"L Gourv\u00e8s","year":"2010","unstructured":"Gourv\u00e8s, L., Lyra, A., Martinhon, C., Monnot, J.: The minimum reload s-t path, trail and walk problems. Discrete Appl. Math. 158(13), 1404\u20131417 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"17_CR13","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1109\/TMC.2012.101","volume":"12","author":"D Gozupek","year":"2013","unstructured":"Gozupek, D., Buhari, S., Alagoz, F.: A spectrum switching delay-aware scheduling algorithm for centralized cognitive radio networks. IEEE Trans. Mobile Comput. 12(7), 1270\u20131280 (2013)","journal-title":"IEEE Trans. Mobile Comput."},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.tcs.2016.01.022","volume":"621","author":"D G\u00f6z\u00fcpek","year":"2016","unstructured":"G\u00f6z\u00fcpek, D., Shachnai, H., Shalom, M., Zaks, S.: Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Theorerical Comput. Sci. 621, 22\u201336 (2016)","journal-title":"Theorerical Comput. Sci."},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.tcs.2014.03.023","volume":"540","author":"D G\u00f6z\u00fcpek","year":"2014","unstructured":"G\u00f6z\u00fcpek, D., Shalom, M., Voloshin, A., Zaks, S.: On the complexity of constructing minimum changeover cost arborescences. Theorerical Comput. Sci. 540, 40\u201352 (2014)","journal-title":"Theorerical Comput. Sci."},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-28684-6_4","volume-title":"Approximation and Online Algorithms","author":"E Kim","year":"2015","unstructured":"Kim, E., Oum, S., Paul, C., Sau, I., Thilikos, D.M.: An FPT 2-approximation for tree-cut decomposition. In: Sanit\u00e0, L., et al. (eds.) WAOA 2015. LNCS, vol. 9499, pp. 35\u201346. Springer, Heidelberg (2015). doi:\n10.1007\/978-3-319-28684-6_4"},{"key":"17_CR17","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms, vol. 31. Oxford University Press, Oxford (2006)"},{"issue":"4","key":"17_CR18","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1016\/S0022-0000(03)00078-3","volume":"67","author":"K Pietrzak","year":"2003","unstructured":"Pietrzak, K.: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. J. Comput. Syst. Sci. 67(4), 757\u2013771 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"17_CR19","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0166-218X(00)00392-9","volume":"113","author":"H-C Wirth","year":"2001","unstructured":"Wirth, H.-C., Steffan, J.: Reload cost problems: minimum diameter spanning tree. Discrete Appl. Math. 113(1), 73\u201385 (2001)","journal-title":"Discrete Appl. Math."},{"key":"17_CR20","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.jctb.2014.07.003","volume":"110","author":"P Wollan","year":"2015","unstructured":"Wollan, P.: The structure of graphs not admitting a fixed immersion. J. Comb. Theor. Ser. B 110, 47\u201366 (2015)","journal-title":"J. Comb. Theor. Ser. B"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53536-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T05:07:04Z","timestamp":1496812024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53536-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662535356","9783662535363"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53536-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}