{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T06:34:08Z","timestamp":1774506848266,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4886,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,3]]},"DOI":"10.1016\/s0166-218x(99)00159-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:12:16Z","timestamp":1027584736000},"page":"183-202","source":"Crossref","is-referenced-by-count":59,"title":["Algorithmic aspects of clique-transversal and clique-independent sets"],"prefix":"10.1016","volume":"100","author":[{"given":"Venkatesan","family":"Guruswami","sequence":"first","affiliation":[]},{"given":"C.Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00159-6_BIB1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0012-365X(91)90055-7","article-title":"Clique-transversal sets of line graphs and complements of line graphs","volume":"88","author":"Andreae","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(99)00159-6_BIB2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(96)00054-3","article-title":"Clique transversal and clique independence on comparability graphs","volume":"58","author":"Balachandhran","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(99)00159-6_BIB3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs and graph planarity using P\u2013Q tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(99)00159-6_BIB4","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0166-218X(95)00048-V","article-title":"Algorithmic aspects of the genralized clique-transversal problem on chordal graphs","volume":"66","author":"Chang","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00159-6_BIB5","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1137\/0406002","article-title":"Algorithmic aspects of neighbourhood numbers","volume":"6","author":"Chang","year":"1993","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00159-6_BIB6","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/0605034","article-title":"The k-domination and k-stability problems on sun-free chordal graphs","volume":"5","author":"Chang","year":"1984","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(99)00159-6_BIB7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0166-218X(88)90086-8","article-title":"The complexity of generalized clique covering","volume":"22","author":"Corneil","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00159-6_BIB8","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(99)00159-6_BIB9","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0097-3165(91)90083-S","article-title":"Fibres and ordered set coloring","volume":"58","author":"Duffus","year":"1991","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0166-218X(99)00159-6_BIB10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(99)00159-6_BIB11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","article-title":"Domination, independent domination, and duality in strongly chordal graphs","volume":"7","author":"Farber","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00159-6_BIB12","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230040407","article-title":"Algorithms on circular-arc graphs","volume":"4","author":"Gavril","year":"1974","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(99)00159-6_BIB13","doi-asserted-by":"crossref","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"10.1016\/S0166-218X(99)00159-6_BIB14","doi-asserted-by":"crossref","unstructured":"F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.","DOI":"10.21236\/AD0705364"},{"key":"10.1016\/S0166-218X(99)00159-6_BIB15","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0606070","article-title":"Totally-balanced and greedy matrices","volume":"6","author":"Hoffman","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(99)00159-6_BIB16","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1137\/0406030","article-title":"Minimum edge dominating sets","volume":"6","author":"Horton","year":"1993","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00159-6_BIB17","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(86)90031-2","article-title":"Neighbourhood perfect graphs","volume":"61","author":"Lehel","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(99)00159-6_BIB18","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0097-3165(87)90029-X","article-title":"Chains, antichains and fibres","volume":"44","author":"Lonc","year":"1987","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0166-218X(99)00159-6_BIB19","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0020-0190(88)90091-9","article-title":"A unified approach to domination problems on interval graphs","volume":"27","author":"Ramalingam","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(99)00159-6_BIB20","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0012-365X(90)90354-K","article-title":"Covering all cliques of a graph","volume":"86","author":"Tuza","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(99)00159-6_BIB21","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/0138030","article-title":"Edge dominating sets in graphs","volume":"38","author":"Yannakakis","year":"1980","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(99)00159-6_BIB22","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(87)90107-4","article-title":"The maximum k-colorable subgraph problem for chordal graphs","volume":"24","author":"Yannakakis","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(99)00159-6_BIB23","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1137\/0210021","article-title":"Edge-deletion problems","volume":"10","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001596?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001596?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T05:03:04Z","timestamp":1578459784000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99001596"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0166218X99001596"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00159-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}