{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:57:05Z","timestamp":1725566225718},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230717"},{"type":"electronic","value":"9783540286394"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28639-4_8","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T16:25:35Z","timestamp":1284999935000},"page":"83-95","source":"Crossref","is-referenced-by-count":2,"title":["Parameterized Coloring Problems on Chordal Graphs"],"prefix":"10.1007","author":[{"given":"D\u00e1niel","family":"Marx","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N. Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica\u00a017(3), 209\u2013223 (1997)","journal-title":"Algorithmica"},{"issue":"1-3","key":"8_CR2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0012-365X(92)90646-W","volume":"100","author":"M. Bir\u00f3","year":"1992","unstructured":"Bir\u00f3, M., Hujter, M., Tuza, Z.: Precoloring extension. I. Interval graphs. Discrete Math.\u00a0100(1-3), 267\u2013279 (1992)","journal-title":"Interval graphs. Discrete Math."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/BF01904851","volume":"16","author":"B. Bollob\u00e1s","year":"1965","unstructured":"Bollob\u00e1s, B.: On generalized graphs. Acta Math. Acad. Sci. Hungar\u00a016, 447\u2013452 (1965)","journal-title":"Acta Math. Acad. Sci. Hungar"},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L. Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inform. Process. Lett.\u00a058(4), 171\u2013176 (1996)","journal-title":"Inform. Process. Lett."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0166-218X(02)00242-1","volume":"127","author":"L. Cai","year":"2003","unstructured":"Cai, L.: Parameterized complexity of vertex colouring. Discrete Appl. Math.\u00a0127, 415\u2013429 (2003)","journal-title":"Discrete Appl. Math."},{"key":"8_CR6","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)"},{"issue":"1","key":"8_CR7","first-page":"1","volume":"62","author":"M. Hujter","year":"1993","unstructured":"Hujter, M., Tuza, Z.: Precoloring extension. II. Graph classes related to bipartite graphs. Acta Mathematica Universitatis Comenianae\u00a062(1), 1\u201311 (1993)","journal-title":"Graph classes related to bipartite graphs. Acta Mathematica Universitatis Comenianae"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1017\/S0963548300001826","volume":"5","author":"M. Hujter","year":"1996","unstructured":"Hujter, M., Tuza, Z.: Precoloring extension. III. Classes of perfect graphs. Combin. Probab. Comput.\u00a05(1), 35\u201356 (1996)","journal-title":"Classes of perfect graphs. Combin. Probab. Comput."},{"issue":"5","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1137\/S0097539796303044","volume":"28","author":"H. Kaplan","year":"1999","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM J. Comput.\u00a028(5), 1906\u20131922 (1999)","journal-title":"SIAM J. Comput."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth","author":"T. Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth. In: Kloks, T. (ed.) Treewidth. LNCS, vol.\u00a0842, Springer, Heidelberg (1994)"},{"key":"8_CR11","unstructured":"Marx, D.: Precoloring extension on chordal graphs (2004)(submitted)"},{"key":"8_CR12","unstructured":"Marx, D.: Precoloring extension on unit interval graphs (2004)(submitted)"},{"key":"8_CR13","series-title":"North-Holland Math. Stud.","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0304-0208(08)73110-4","volume-title":"Analysis and design of algorithms for combinatorial problems (Udine, 1982)","author":"B. Monien","year":"1985","unstructured":"Monien, B.: How to find long paths efficiently. In: Analysis and design of algorithms for combinatorial problems (Udine, 1982). North-Holland Math. Stud., vol.\u00a0109, pp. 239\u2013254. North-Holland, Amsterdam (1985)"},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D.J. Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput.\u00a05(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-39658-1_44","volume-title":"Algorithms - ESA 2003","author":"A. Slivkins","year":"2003","unstructured":"Slivkins, A.: Parameterized tractability of edge-disjoint paths on directed acyclic graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 482\u2013493. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28639-4_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:30:01Z","timestamp":1619998201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28639-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230717","9783540286394"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28639-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}