{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:07:31Z","timestamp":1725815251731},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662460771"},{"type":"electronic","value":"9783662460788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46078-8_22","type":"book-chapter","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T09:54:29Z","timestamp":1421229269000},"page":"266-276","source":"Crossref","is-referenced-by-count":1,"title":["Fixing Improper Colorings of Graphs"],"prefix":"10.1007","author":[{"given":"Konstanty","family":"Junosza-Szaniawski","sequence":"first","affiliation":[]},{"given":"Mathieu","family":"Liedloff","sequence":"additional","affiliation":[]},{"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.jda.2008.12.001","volume":"7","author":"G. Ausiello","year":"2009","unstructured":"Ausiello, G., Escoffier, B., Monnot, J., Paschos, V.T.: Reoptimization of minimum and maximum traveling salesmans tours. J. of Discrete Algorithms\u00a07, 453\u2013463 (2009)","journal-title":"J. of Discrete Algorithms"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00453-010-9419-8","volume":"61","author":"D. Bil\u00f2","year":"2011","unstructured":"Bil\u00f2, D., B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovic, R., M\u00f6mke, T., Seibert, S., Zych, A.: Reoptimization of the Shortest Common Superstring Problem. Algorithmica\u00a061, 227\u2013251 (2011)","journal-title":"Algorithmica"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1137\/070683933","volume":"39","author":"A. Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM Journal on Computing\u00a039, 546\u2013563 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H. Bodlaender","year":"1996","unstructured":"Bodlaender, H.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Bodlaender H., Koster A.: Combinatorial Optimization on Graphs of Bounded Treewidth. The Computer Journal (2007)","DOI":"10.1093\/comjnl\/bxm037"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.endm.2013.10.040","volume":"44","author":"M. Bonamy","year":"2013","unstructured":"Bonamy, M., Bousquet, N.: Recoloring bounded treewidth graphs. Electronic Notes in Discrete Mathematics\u00a044, 257\u2013262 (2013)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-540-74456-6_65","volume-title":"Mathematical Foundations of Computer Science 2007","author":"P. Bonsma","year":"2007","unstructured":"Bonsma, P., Cereceda, L.: Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 738\u2013749. Springer, Heidelberg (2007)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-74839-7_17","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"L. Cereceda","year":"2007","unstructured":"Cereceda, L., van den Heuvel, J., Johnson, M.: Mixing 3-Colourings in Bipartite Graphs. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 166\u2013177. Springer, Heidelberg (2007)"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.disc.2007.07.028","volume":"308","author":"L. Cereceda","year":"2008","unstructured":"Cereceda, L., Heuvel, J., van den Johnson, M.: Connectedness of the graph of vertex colourings. Discrete Mathematics\u00a0308, 166\u2013177 (2008)","journal-title":"Discrete Mathematics"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/jgt.20514","volume":"67","author":"L. Cereceda","year":"2011","unstructured":"Cereceda, L., van den Heuvel, J., Johnson, M.: Finding paths between 3-colorings. Journal of Graph Theory\u00a067, 69\u201382 (2011)","journal-title":"Journal of Graph Theory"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Graduate Texts in Mathematics. Springer (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"22_CR13","unstructured":"Felsner, S., Huemer, C., Saumell, M.: Recoloring directed graphs. In: Proc. of XIII Encuentros de Geometr\u00eda Computacional, pp. 91\u201397 (2009)"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/rsa.3240070205","volume":"7","author":"M. Jerrum","year":"1995","unstructured":"Jerrum, M.: A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Structures & Algorithms\u00a07, 157\u2013165 (1995)","journal-title":"Random Structures & Algorithms"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Computations and Approximations","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-642-29344-3_52","volume-title":"LATIN 2012: Theoretical Informatics","author":"H. Shachnai","year":"2012","unstructured":"Shachnai, H., Tamir, G., Tamir, T.: A Theory and Algorithms for Combinatorial Reoptimization. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol.\u00a07256, pp. 618\u2013630. Springer, Heidelberg (2012)"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Zych, A., Bil\u00f2, D.: New Reoptimization Techniques applied to Steiner Tree Problem. Electronic Notes in Discrete Mathematics\u00a037(2\u20131), 387\u2013392","DOI":"10.1016\/j.endm.2011.05.066"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2015: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46078-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:26:29Z","timestamp":1559089589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46078-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460771","9783662460788"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46078-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}