{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:35Z","timestamp":1725558935473},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_4","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T15:01:42Z","timestamp":1278082902000},"page":"46-57","source":"Crossref","is-referenced-by-count":0,"title":["Treelike Comparability Graphs: Characterization, Recognition, and Applications"],"prefix":"10.1007","author":[{"given":"Sabine","family":"Cornelsen","sequence":"first","affiliation":[]},{"given":"Gabriele","family":"Di Stefano","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF00383170","volume":"7","author":"M.D. Atkinson","year":"1990","unstructured":"Atkinson, M.D.: On computing the number of linear extensions of a tree. Order\u00a07, 23\u201325 (1990)","journal-title":"Order"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/3-540-57182-5_21","volume-title":"Mathematical Foundations of Computer Science 1993","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L., Jansen, K.: On the complexity of scheduling incompatible jobs with unit-times. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 291\u2013300. Springer, Heidelberg (1993)"},{"issue":"5","key":"4_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0020-0190(95)00021-4","volume":"54","author":"D.G. Corneil","year":"1995","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: A linear time algorithm to compute a dominating path in an AT-free graph. Information Processing Letters\u00a054(5), 253\u2013257 (1995)","journal-title":"Information Processing Letters"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"D.G. Corneil","year":"1997","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Astroidal triple-free graphs. SIAM Journal on Discrete Mathematics\u00a010(3), 399\u2013430 (1997)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","volume":"32","author":"W.H. Cunningham","year":"1980","unstructured":"Cunningham, W.H., Edmonds, J.: A combinatorial decomposition theory. Canadian Journal of Mathematics\u00a032, 734\u2013765 (1980)","journal-title":"Canadian Journal of Mathematics"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0603021","volume":"3","author":"W.H. Cunningham","year":"1982","unstructured":"Cunningham, W.H., Edmonds, J.: Decomposition of directed graphs. SIAM Journal on Algebraic and Discrete Methods\u00a03, 214\u2013228 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/3-540-58715-2_123","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"E. Dahlhaus","year":"1994","unstructured":"Dahlhaus, E.: Efficient parallel and linear time sequential split decomposition. In: Thiagarajan, P.S. (ed.) FSTTCS 1994. LNCS, vol.\u00a0880, pp. 171\u2013180. Springer, Heidelberg (1994)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Di Stefano, G., Koci, M.L.: A graph theoretical approach to the shunting problem. In: Gerards, B. (ed.) Proceedings of the Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003). Electronic Notes in Theoretical Computer Science, vol.\u00a092 (2004)","DOI":"10.1016\/j.entcs.2003.12.020"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0012-365X(78)90178-4","volume":"24","author":"M.C. Golumbic","year":"1978","unstructured":"Golumbic, M.C.: Trivially perfect graphs. Discrete Mathematics\u00a024, 105\u2013107 (1978)","journal-title":"Discrete Mathematics"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0166-218X(84)90016-7","volume":"9","author":"M.C. Golumbic","year":"1984","unstructured":"Golumbic, M.C., Monma, C.L., Trotter Jr., W.T.: Tolerance graphs. Discrete Applied Mathematics\u00a09, 157\u2013170 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","volume":"27","author":"P.L. Hammer","year":"1990","unstructured":"Hammer, P.L., Maffray, F.: Completely seperable graphs. Discrete Applied Mathematics\u00a027, 85\u201399 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BFb0028568","volume-title":"STACS 98","author":"K. Jansen","year":"1998","unstructured":"Jansen, K.: The mutual exclusion scheduling problem for permutation and comparability graphs. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 287\u2013297. Springer, Heidelberg (1998)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1145\/800133.804353","volume-title":"Proceedings of the 10th Annual ACM Symposium on the Theory of Computing (STOC \u201978)","author":"D.G. Kirckpatrick","year":"1978","unstructured":"Kirckpatrick, D.G., Hell, P.: On the completeness of a generalized matching problem. In: Proceedings of the 10th Annual ACM Symposium on the Theory of Computing (STOC 1978), pp. 240\u2013245. ACM, The Association for Computing Machinery (1978)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-55121-2_9","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"Z. Lonc","year":"1992","unstructured":"Lonc, Z.: On complexity of some chain and antichain partition problems. In: Schmidt, G., Berghammer, R. (eds.) WG 1991. LNCS, vol.\u00a0570, pp. 97\u2013104. Springer, Heidelberg (1992)"},{"key":"4_CR15","first-page":"17","volume":"16","author":"E.S. Wolk","year":"1965","unstructured":"Wolk, E.S.: A note on \u201cThe comparability graph of a tree\u201d. Proceedings of the American Mathematical Society\u00a016, 17\u201320 (1965)","journal-title":"Proceedings of the American Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30559-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T05:31:51Z","timestamp":1552627911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}