{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:56:10Z","timestamp":1648724170036},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,3,15]],"date-time":"2014-03-15T00:00:00Z","timestamp":1394841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s00453-013-9847-3","type":"journal-article","created":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T01:50:11Z","timestamp":1395107411000},"page":"359-368","source":"Crossref","is-referenced-by-count":1,"title":["Hitting All Maximal Independent Sets of a Bipartite Graph"],"prefix":"10.1007","volume":"72","author":[{"given":"Jean","family":"Cardinal","sequence":"first","affiliation":[]},{"given":"Gwena\u00ebl","family":"Joret","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,15]]},"reference":[{"key":"9847_CR1","unstructured":"Aigner, M., Andreae, T.: Vertex sets that meet all maximal cliques of a graph. Manuscript (1986)"},{"issue":"1\u20133","key":"9847_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0012-365X(98)00087-9","volume":"191","author":"T. Andreae","year":"1998","unstructured":"Andreae, T.: On the clique-transversal number of chordal graphs. Discrete Math. 191(1\u20133), 3\u201311 (1998)","journal-title":"Discrete Math."},{"issue":"1","key":"9847_CR3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0012-365X(91)90055-7","volume":"88","author":"T. Andreae","year":"1991","unstructured":"Andreae, T., Schughart, M., Tuza, Z.: Clique-transversal sets of line graphs and complements of line graphs. Discrete Math. 88(1), 11\u201320 (1991)","journal-title":"Discrete Math."},{"issue":"3","key":"9847_CR4","doi-asserted-by":"crossref","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. Discrete Math. 17(3), 361\u2013376 (2004)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"9847_CR5","doi-asserted-by":"crossref","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)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9847_CR6","doi-asserted-by":"crossref","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, Ser. A 58(1), 158\u2013164 (1991)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"1","key":"9847_CR7","doi-asserted-by":"crossref","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, Ser. A 57(1), 109\u2013116 (1991)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"1","key":"9847_CR8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10479-007-0189-x","volume":"157","author":"G. Dur\u00e1n","year":"2008","unstructured":"Dur\u00e1n, G., Lin, M.C., Mera, S., Szwarcfiter, J.L.: Algorithms for finding clique-transversals of graphs. Ann. Oper. Res. 157(1), 37\u201345 (2008)","journal-title":"Ann. Oper. Res."},{"issue":"1\u20134","key":"9847_CR9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1021363810398","volume":"116","author":"G. Dur\u00e1n","year":"2002","unstructured":"Dur\u00e1n, G., Lin, M.C., Szwarcfiter, J.L.: On clique-transversals and clique-independent sets. Ann. Oper. Res. 116(1\u20134), 71\u201377 (2002)","journal-title":"Ann. Oper. Res."},{"issue":"1\u20133","key":"9847_CR10","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0012-365X(92)90681-5","volume":"108","author":"P. Erd\u00f6s","year":"1992","unstructured":"Erd\u00f6s, P., Gallai, T., Tuza, Z.: Covering the cliques of a graph with vertices. Discrete Math. 108(1\u20133), 279\u2013289 (1992)","journal-title":"Discrete Math."},{"issue":"3","key":"9847_CR11","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E.M. Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Inf. Control 37(3), 302\u2013320 (1978)","journal-title":"Inf. Control"},{"issue":"3","key":"9847_CR12","doi-asserted-by":"crossref","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. Discrete Appl. Math. 100(3), 183\u2013202 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9847_CR13","doi-asserted-by":"crossref","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)","journal-title":"J. Algorithms"},{"issue":"2","key":"9847_CR14","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0097-3165(87)90029-X","volume":"44","author":"Z. Lonc","year":"1987","unstructured":"Lonc, Z., Rival, I.: Chains, antichains, and fibres. J. Comb. Theory, Ser. A 44(2), 207\u2013228 (1987)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"29","key":"9847_CR15","doi-asserted-by":"crossref","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)","journal-title":"Theor. Comput. Sci."},{"key":"9847_CR16","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"9847_CR17","volume-title":"SIGACT News","author":"M. Schaefer","year":"2002","unstructured":"Schaefer, M., Umans, C.: Completeness in the polynomial-time hierarchy: a compendium. In: SIGACT News (2002). Guest Complexity Theory column"},{"issue":"1","key":"9847_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L.J. Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.J.: The polynomial-time hierarchy. Theor. Comput. Sci. 3(1), 1\u201322 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"9847_CR19","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0012-365X(90)90354-K","volume":"86","author":"Z. Tuza","year":"1990","unstructured":"Tuza, Z.: Covering all cliques of a graph. Discrete Math. 86(1\u20133), 117\u2013126 (1990)","journal-title":"Discrete Math."},{"issue":"1","key":"9847_CR20","doi-asserted-by":"crossref","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)","journal-title":"Theor. Comput. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9847-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9847-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9847-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:13Z","timestamp":1559123113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9847-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,15]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["9847"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9847-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,15]]}}}