{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T04:12:36Z","timestamp":1586664756746},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540427070","type":"print"},{"value":"9783540454779","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45477-2_5","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:09:01Z","timestamp":1187248141000},"page":"32-43","source":"Crossref","is-referenced-by-count":14,"title":["Maximum Clique Transversals"],"prefix":"10.1007","author":[{"given":"Maw-Shang","family":"Chang","sequence":"first","affiliation":[]},{"given":"Ton","family":"Kloks","sequence":"additional","affiliation":[]},{"given":"Chuan-Min","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,2]]},"reference":[{"key":"5_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-44985-X_10","volume-title":"Proceedings SWAT\u201900","author":"J. Alber","year":"2000","unstructured":"Alber, J., H. Bodlaender, H. Fernau, and R. Niedermeier, Fixed parameter algorithms for planar dominating set and related problems. Lecture Notes in Computer Science\n 1851, (2000), pp. 97\u2013110. Proceedings SWAT\u201900."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(97)90120-7","volume":"84","author":"L. Babel","year":"1998","unstructured":"Babel, L. and S. Olariu, On the structure of graphs with few P\n 4\u2019s, Discrete Applied Mathematics\n 84, (1998), pp. 1\u201313.","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR3","unstructured":"Babel, L., T. Kloks, J. Kratochv\u00edl, H. M\u00fcller, and S. Olariu, Algorithms for graphs with few P\n 4\u2019s. To appear."},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B. S. Baker","year":"1994","unstructured":"Baker, B. S., Approximation algorithms for NP-complete problems on planar graphs, Journal of the Association for Computing Machinery\n 41, (1994), pp. 153\u2013180.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"5_CR5","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., P. Nagavamsi, and C. P. Rangan, Clique transversal and clique independence on comparability graphs, Information processing letters\n 58, (1996), pp. 181\u2013184.","journal-title":"Information processing letters"},{"key":"5_CR6","unstructured":"Brandst\u00e4dt, A., V. B. Le, and J. P. Spinrad, Graph classes-A Survey, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1999.","DOI":"10.1137\/1.9780898719796","doi-asserted-by":"crossref"},{"key":"5_CR7","first-page":"33","volume":"90","author":"Y. Cai","year":"1992","unstructured":"Cai, Y. and M. C. Kong, Generating all maximal cliques and related problems for certain perfect graphs. Proceedings of the Twenty-third Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1992). Congr. Numer. 90 (1992), pp. 33\u201355.","journal-title":"Congr. Numer."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0166-218X(95)00048-V","volume":"66","author":"M.-S. Chang","year":"1996","unstructured":"M.-S. Chang, Y.-H. Chen, G. J. Chang, and J. H. Yan, Algorithmic aspects of the generalised clique transversal problem on chordal graphs, Discrete Applied Mathematics\n 66, (1996), pp. 189\u2013203.","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR9","unstructured":"M.-S. Chang, S.-Y. Hsieh, and G.-H. Chen, Dynamic programming on distance hereditary graphs. Lecture Notes in Computer Science\n 1350, (1997), pp 344\u2013353.","DOI":"10.1007\/3-540-63890-3_37","doi-asserted-by":"crossref"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(91)90020-3","volume":"86","author":"M. Chrobak","year":"1991","unstructured":"Chrobak, M. and D. Eppstein, Planar orientations with low out-degree and Compaction of adjacency Matrices. Theoretical Computer Science\n 86, (1991), pp 243\u2013266.","journal-title":"Theoretical Computer Science"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1137\/0608044","volume":"8","author":"D. G. Corneil","year":"1987","unstructured":"Corneil, D. G. and J. M. Keil, A dynamic programming approach to the domination set problem on k-trees, SIAM J. Algebraic and Discrete Methods\n 8, (1987), pp. 535\u2013543.","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"5_CR12","author":"S. Even","year":"1979","unstructured":"Even, S., Graph Algorithms, Computer Science Press, Rockville, MD, 1979.","volume-title":"Graph Algorithms"},{"key":"5_CR13","author":"M. R. Garey","year":"1999","unstructured":"Garey, M. R., and D. S. Johnson, Computers and intractability\u2014A guide to the theory of NP-completeness, W. H. Freeman and company, New York, 1999.","volume-title":"Computers and intractability\u2014A guide to the theory of NP-completeness"},{"key":"5_CR14","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. and C. P. Rangan, Algorithmic aspects of clique transversal and clique-independent sets, Discrete Applied Mathematics\n 100, (2000), pp. 183\u2013202.","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"Itai, A. and M. Rodeh, Finding a minimum circuit in a graph, SIAM Journal on Computing\n 7, (1978), pp. 413\u2013423.","journal-title":"SIAM Journal on Computing"},{"key":"5_CR16","first-page":"39","volume":"7","author":"L. Redei","year":"1934","unstructured":"Redei, L., Ein Konbinatorischer, Acta Litt. Szeged, 7, pp. 39\u201343, 1934.","journal-title":"Acta Litt. Szeged"},{"key":"5_CR17","unstructured":"Uehara, R., NP-complete problems on a 3-connected cubic planar graph and their applications, Technical Report TWCU-M-0004, Tokyo Woman\u2019s Christian University, 1996 \n http:\/\/www.komazawa-u.ac.jp\/~uehara\/ps\/triangle.ps.gz"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(81)90041-7","volume":"13","author":"C. Papadimitriou","year":"1981","unstructured":"Papadimitriou, C. and M. Yannakakis, The clique problem for planar graphs, Information Processing Letters, 13, (1981), pp. 131\u2013133.","journal-title":"Information Processing Letters"}],"container-title":["Graph-Theoretic Concepts in Computer Science","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45477-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T18:48:13Z","timestamp":1550774893000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427070","9783540454779"],"references-count":18,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-45477-2_5","relation":{"cites":[]},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}]}}