{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:12Z","timestamp":1725574092302},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212584"},{"type":"electronic","value":"9783540246985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_14","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:28:22Z","timestamp":1294439302000},"page":"100-108","source":"Crossref","is-referenced-by-count":2,"title":["List Partitions of Chordal Graphs"],"prefix":"10.1007","author":[{"given":"Tom\u00e1s","family":"Feder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavol","family":"Hell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sulamita","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loana Tito","family":"Nogueira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F\u00e1bio","family":"Protti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms\u00a021, 358\u2013402 (1996)","journal-title":"J. Algorithms"},{"key":"14_CR2","unstructured":"Cameron, K., Eschen, E.M., Hoang, C.T., Sritharan, R.: The list partition problem for graphs. In: SODA 2004 (2004)"},{"key":"14_CR3","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem (manuscript 2002)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1006\/jagm.1999.1122","volume":"37","author":"C.M.H. Figueiredo de","year":"2000","unstructured":"de Figueiredo, C.M.H., Klein, S., Kohayakawa, Y., Reed, B.A.: Finding skew partitions efficiently. Journal of Algorithms\u00a037, 505\u2013521 (2000)","journal-title":"Journal of Algorithms"},{"key":"14_CR5","unstructured":"Diaz, J., Serna, M., Thilikos, D.M.: The complexity of parametrized Hcolorings: a survey. Dimacs Series in Discrete Mathematics (2003)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Feder, T., Hell, P.: List constraint satisfaction and list partition. Submitted to SIAM J. Comput. (2003)","DOI":"10.1137\/S0895480100384055"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s004939970003","volume":"19","author":"T. Feder","year":"1999","unstructured":"Feder, T., Hell, P., Huang, J.: List homomorphisms and circular arc graphs. Combinatorica\u00a019, 487\u2013505 (1999)","journal-title":"Combinatorica"},{"key":"#cr-split#-14_CR8.1","doi-asserted-by":"crossref","unstructured":"Feder, T., Hell, P., Klein, S., Motwani, R.: Complexity of list partitions. In: Proc. 31st Ann. ACM Symp. on Theory of Computing, pp. 464\u2013472 (1999);","DOI":"10.1145\/301250.301373"},{"key":"#cr-split#-14_CR8.2","doi-asserted-by":"crossref","unstructured":"Feder, T., Hell, P., Klein, S., Motwani, R.: Complexity of list partitions. In: Proc. 31st Ann. ACM Symp. on Theory of Computing, pp. 464\u2013472 (1999); SIAM J. Comput. (in press)","DOI":"10.1145\/301250.301373"},{"key":"14_CR9","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Hell, P., Klein, S., Nogueira, L.T., Protti, F.: Partitioning chordal graphs into independent sets and cliques. Discrete Applied Math. (to appear)","DOI":"10.1016\/S0166-218X(03)00371-8"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Proskurowski, A., Arnborg, S.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Applied Math.\u00a0(23), 11\u201324 (1989)","DOI":"10.1016\/0166-218X(89)90031-0"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T02:56:04Z","timestamp":1637117764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}