{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:02Z","timestamp":1780783142958,"version":"3.54.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-27732-9_24","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:12Z","timestamp":1780780452000},"page":"341-355","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Clique Bicoloring"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-8928-2594","authenticated-orcid":false,"given":"Shunsuke","family":"Hamada","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1156-0383","authenticated-orcid":false,"given":"Yuto","family":"Okada","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0845-3947","authenticated-orcid":false,"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0087-853X","authenticated-orcid":false,"given":"Yota","family":"Otachi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity - A Modern Approach. Cambridge University Press (2009). http:\/\/www.cambridge.org\/catalogue\/catalogue.asp?isbn=9780521424264","DOI":"10.1017\/CBO9780511804090"},{"issue":"3","key":"24_CR2","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1137\/S0895480199359995","volume":"17","author":"G Bacs\u00f3","year":"2004","unstructured":"Bacs\u00f3, G., Gravier, S., Gy\u00e1rf\u00e1s, A., Preissmann, M., Seb\u00f6, A.: Coloring the maximal cliques of graphs. SIAM J. Discret. Math. 17(3), 361\u2013376 (2004). https:\/\/doi.org\/10.1137\/S0895480199359995","journal-title":"SIAM J. Discret. Math."},{"key":"24_CR3","doi-asserted-by":"publisher","unstructured":"Bacs\u00f3, G., Tuza, Z.: Clique-transversal sets and weak 2-colorings in graphs of small maximum degree. Discret. Math. Theor. Comput. Sci. 11(2), 15\u201324 (2009). https:\/\/doi.org\/10.46298\/DMTCS.453","DOI":"10.46298\/DMTCS.453"},{"issue":"4","key":"24_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(96)00054-3","volume":"58","author":"V Balachandran","year":"1996","unstructured":"Balachandran, V., Nagavamsi, P., Rangan, C.P.: Clique transversal and clique independence on comparability graphs. Inf. Process. Lett. 58(4), 181\u2013184 (1996). https:\/\/doi.org\/10.1016\/0020-0190(96)00054-3","journal-title":"Inf. Process. Lett."},{"key":"24_CR5","unstructured":"Berge, C.: Hypergraphs - combinatorics of finite sets, North-Holland mathematical library, vol.\u00a045. North-Holland (1989)"},{"key":"24_CR6","doi-asserted-by":"publisher","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets m\u00f6bius: fast subset convolution. In: Johnson, D.S., Feige, U. (eds.) Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11\u201313, 2007. pp. 67\u201374. ACM (2007). https:\/\/doi.org\/10.1145\/1250790.1250801","DOI":"10.1145\/1250790.1250801"},{"issue":"5","key":"24_CR7","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1016\/J.DISC.2017.01.019","volume":"340","author":"F Bonomo","year":"2017","unstructured":"Bonomo, F., Mazzoleni, M.P., Stein, M.: Clique coloring b$$ _{\\text{1 }}$$-epg graphs. Discret. Math. 340(5), 1008\u20131011 (2017). https:\/\/doi.org\/10.1016\/J.DISC.2017.01.019","journal-title":"Discret. Math."},{"issue":"1","key":"24_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1137\/S0895480194267853","volume":"10","author":"A Brandst\u00e4dt","year":"1997","unstructured":"Brandst\u00e4dt, A., Chepoi, V., Dragan, F.F.: Clique r-domination and clique r-packing problems on dually chordal graphs. SIAM J. Discret. Math. 10(1), 109\u2013127 (1997). https:\/\/doi.org\/10.1137\/S0895480194267853","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1137\/0406002","volume":"6","author":"GJ Chang","year":"1993","unstructured":"Chang, G.J., Farber, M., Tuza, Z.: Algorithmic aspects of neighborhood numbers. SIAM J. Discret. Math. 6(1), 24\u201329 (1993). https:\/\/doi.org\/10.1137\/0406002","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0166-218X(95)00048-V","volume":"66","author":"M Chang","year":"1996","unstructured":"Chang, M., Chen, Y., Chang, G.J., Yan, J.: Algorithmic aspects of the generalized clique-transversal problem on chordal graphs. Discret. Appl. Math. 66(3), 189\u2013203 (1996). https:\/\/doi.org\/10.1016\/0166-218X(95)00048-V","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"24_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/S002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000). https:\/\/doi.org\/10.1007\/S002249910009","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1002\/JGT.20177","volume":"53","author":"D D\u00e9fossez","year":"2006","unstructured":"D\u00e9fossez, D.: Clique-coloring some classes of odd-hole-free graphs. J. Graph Theory 53(3), 233\u2013249 (2006). https:\/\/doi.org\/10.1002\/JGT.20177","journal-title":"J. Graph Theory"},{"key":"24_CR13","doi-asserted-by":"publisher","unstructured":"Diestel, R.: Graph Theory, 6th Edition. Springer Nature (2025). https:\/\/doi.org\/10.1007\/978-3-662-70107-2","DOI":"10.1007\/978-3-662-70107-2"},{"issue":"4","key":"24_CR14","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"RG Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: basic results. SIAM J. Comput. 24(4), 873\u2013921 (1995). https:\/\/doi.org\/10.1137\/S0097539792228228","journal-title":"SIAM J. Comput."},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/0097-3165(91)90083-S","volume":"58","author":"D Duffus","year":"1991","unstructured":"Duffus, D., Kierstead, H.A., Trotter, W.T.: Fibres and ordered set coloring. J. Comb. Theory A 58(1), 158\u2013164 (1991). https:\/\/doi.org\/10.1016\/0097-3165(91)90083-S","journal-title":"J. Comb. Theory A"},{"issue":"1","key":"24_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0097-3165(91)90009-6","volume":"57","author":"D Duffus","year":"1991","unstructured":"Duffus, D., Sands, B., Sauer, N., Woodrow, R.E.: Two-colouring all two-element maximal antichains. J. Comb. Theory A 57(1), 109\u2013116 (1991). https:\/\/doi.org\/10.1016\/0097-3165(91)90009-6","journal-title":"J. Comb. Theory A"},{"key":"24_CR17","doi-asserted-by":"publisher","unstructured":"Filho, H.B.M., Machado, R.C.S., de\u00a0Figueiredo, C.M.H.: Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3. Theor. Comput. Sci. 618, 122\u2013134 (2016). https:\/\/doi.org\/10.1016\/J.TCS.2016.01.027","DOI":"10.1016\/J.TCS.2016.01.027"},{"key":"24_CR18","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. TTCSAES, Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"key":"24_CR19","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. TTCSAES, Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16533-7"},{"issue":"1\u20133","key":"24_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/J.APAL.2004.01.007","volume":"130","author":"M Frick","year":"2004","unstructured":"Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Log. 130(1\u20133), 3\u201331 (2004). https:\/\/doi.org\/10.1016\/J.APAL.2004.01.007","journal-title":"Ann. Pure Appl. Log."},{"issue":"3","key":"24_CR21","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified np-complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976). https:\/\/doi.org\/10.1016\/0304-3975(76)90059-1","journal-title":"Theor. Comput. Sci."},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/11685654_12","volume-title":"Theoretical Computer Science","author":"O Goldreich","year":"2006","unstructured":"Goldreich, O.: On Promise Problems: A Survey. In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds.) Theoretical Computer Science. LNCS, vol. 3895, pp. 254\u2013290. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11685654_12"},{"key":"24_CR23","doi-asserted-by":"publisher","unstructured":"Gravier, S., Ho\u00e0ng, C.T., Maffray, F.: Coloring the hypergraph of maximal cliques of a graph with no long path. Discret. Math. 272(2-3), 285\u2013290 (2003). https:\/\/doi.org\/10.1016\/S0012-365X(03)00197-3","DOI":"10.1016\/S0012-365X(03)00197-3"},{"issue":"3","key":"24_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0166-218X(99)00159-6","volume":"100","author":"V Guruswami","year":"2000","unstructured":"Guruswami, V., Rangan, C.P.: Algorithmic aspects of clique-transversal and clique-independent sets. Discret. Appl. Math. 100(3), 183\u2013202 (2000). https:\/\/doi.org\/10.1016\/S0166-218X(99)00159-6","journal-title":"Discret. Appl. Math."},{"key":"24_CR25","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-68279-0_3","volume-title":"50 Years of Integer Programming 1958-2008","author":"AJ Hoffman","year":"2010","unstructured":"Hoffman, A.J., Kruskal, J.B.: Integral Boundary Points of Convex Polyhedra. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958-2008, pp. 49\u201376. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_3"},{"key":"24_CR26","unstructured":"Kang, D.Y., Kelly, T., K\u00fchn, D., Methuku, A., Osthus, D.: Graph and hypergraph colouring via nibble methods: A survey. CoRR abs\/2106.13733 (2021). https:\/\/arxiv.org\/abs\/2106.13733"},{"issue":"1","key":"24_CR27","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/S0196-6774(02)00221-3","volume":"45","author":"J Kratochv\u00edl","year":"2002","unstructured":"Kratochv\u00edl, J., Tuza, Z.: On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms 45(1), 40\u201354 (2002). https:\/\/doi.org\/10.1016\/S0196-6774(02)00221-3","journal-title":"J. Algorithms"},{"issue":"3","key":"24_CR28","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/J.DAM.2005.07.011","volume":"154","author":"C Lee","year":"2006","unstructured":"Lee, C., Chang, M.: Distance-hereditary graphs are clique-perfect. Discret. Appl. Math. 154(3), 525\u2013536 (2006). https:\/\/doi.org\/10.1016\/J.DAM.2005.07.011","journal-title":"Discret. Appl. Math."},{"issue":"29","key":"24_CR29","doi-asserted-by":"publisher","first-page":"3487","DOI":"10.1016\/J.TCS.2011.02.038","volume":"412","author":"D Marx","year":"2011","unstructured":"Marx, D.: Complexity of clique coloring and related problems. Theor. Comput. Sci. 412(29), 3487\u20133500 (2011). https:\/\/doi.org\/10.1016\/J.TCS.2011.02.038","journal-title":"Theor. Comput. Sci."},{"key":"24_CR30","doi-asserted-by":"publisher","unstructured":"Oum, S.: Approximating rank-width and clique-width quickly. ACM Trans. Algorithms 5(1), 10:1\u201310:20 (2008). https:\/\/doi.org\/10.1145\/1435375.1435385","DOI":"10.1145\/1435375.1435385"},{"key":"24_CR31","unstructured":"Poon, H.: Coloring Clique Hypergraphs. Master\u2019s thesis, West Virginia University (2000)"},{"key":"24_CR32","unstructured":"Schrijver, A.: Theory of linear and integer programming. Wiley-Interscience series in discrete mathematics and optimization, Wiley (1999)"},{"issue":"1","key":"24_CR33","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/J.TCS.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363(1), 28\u201342 (2006). https:\/\/doi.org\/10.1016\/J.TCS.2006.06.015","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"24_CR34","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","volume":"3","author":"C Wrathall","year":"1976","unstructured":"Wrathall, C.: Complete sets and the polynomial-time hierarchy. Theor. Comput. Sci. 3(1), 23\u201333 (1976). https:\/\/doi.org\/10.1016\/0304-3975(76)90062-1","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:13Z","timestamp":1780780453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}