{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:08:27Z","timestamp":1725548907442},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_43","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:06:19Z","timestamp":1267553179000},"page":"521-532","source":"Crossref","is-referenced-by-count":9,"title":["The PIGs Full Monty \u2013 A Floor Show of Minimal Separators"],"prefix":"10.1007","author":[{"given":"Gerard Jennhwa","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonius J. J.","family":"Kloks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiping","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng-Lung","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Berry, A., Golumbic, M.C., Lipshteyn, M.: Recognizing and triangulating chordal probe graphs. Research Report LIMOS\/RR\u201303\u201308, July 4 (2003)","DOI":"10.1007\/978-3-540-39890-5_22"},{"key":"43_CR2","unstructured":"Berry, A., Golumbic, M.C., Lipshteyn, M.: Two tricks to triangulate chordal probe graphs in polynomial time. In: Proceedings 15th ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 962\u2013969 (2004)"},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ\u2013tree algorithms. Journal of Computer and System Sciences\u00a013, 335\u2013379 (1976)","journal-title":"Journal of Computer and System Sciences"},{"key":"43_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-49116-3_18","volume-title":"STACS 99","author":"V. Bouchitt\u00e9","year":"1999","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Treewidth and minimum fill-in of weakly triangulated graphs. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 197\u2013206. Springer, Heidelberg (1999)"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Br\u00e4ndstadt, A., Le, V., Spinrad, J.P.: Graph classes: A survey. In: SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"43_CR6","unstructured":"Chudnovsky, M., Seymour, P., Robertson, N., Thomas, R.: The strong perfect graph theorem (2002) (manuscript)"},{"key":"43_CR7","first-page":"311","volume":"19","author":"S. F\u00f6ldes","year":"1977","unstructured":"F\u00f6ldes, S., Hammer, P.L.: Split graphs. Congressus Numerantium\u00a019, 311\u2013315 (1977)","journal-title":"Congressus Numerantium"},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","volume":"16","author":"P.C. Gilmore","year":"1964","unstructured":"Gilmore, P.C., Hoffman, A.J.: A characterization of comparability graphs and of interval graphs. Canad. J. Math.\u00a016, 539\u2013548 (1964)","journal-title":"Canad. J. Math."},{"key":"43_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":"43_CR10","volume-title":"Tolerance graphs","author":"M.C. Golumbic","year":"2003","unstructured":"Golumbic, M.C., Trenk, A.N.: Tolerance graphs. Cambridge University Press, Cambridge (2003)"},{"key":"43_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-39890-5_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.C. Golumbic","year":"2003","unstructured":"Golumbic, M.C., Lipshsteyn, M.: Chordal probe graphs. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 249\u2013260. Springer, Heidelberg (2003)"},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02579333","volume":"1","author":"P.L. Hammer","year":"1981","unstructured":"Hammer, P.L., Simeone, B.: The splittance of a graph. Combinatorica\u00a01, 275\u2013284 (1981)","journal-title":"Combinatorica"},{"key":"43_CR13","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","volume":"39","author":"R.B. Hayward","year":"1985","unstructured":"Hayward, R.B.: Weakly triangulated graphs. J. Combin. Theory B\u00a039, 200\u2013208 (1985)","journal-title":"J. Combin. Theory B"},{"key":"43_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01787477","volume":"5","author":"R.B. Hayward","year":"1990","unstructured":"Hayward, R.B., Ho\u00e1ng, C., Maffray, F.: Optimizing weakly triangulated graphs. Graphs and Combinatorics\u00a05, 33\u201335 (1990)","journal-title":"Graphs and Combinatorics"},{"key":"43_CR15","unstructured":"Johnson, J.L., Spinrad, J.: A polynomial time recognition algorithm for probe interval graphs. In: Proceedings 12th ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 477\u2013486 (2001)"},{"key":"43_CR16","unstructured":"McConnell, R.M., Spinrad, J.: Construction of probe interval graphs. In: Proceedings 13th ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 866\u2013875 (2002)"},{"key":"43_CR17","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0166-218X(98)00077-8","volume":"88","author":"F.R. McMorris","year":"1998","unstructured":"McMorris, F.R., Wang, C., Zhang, P.: On probe interval graphs. Discrete Applied Mathematics\u00a088, 315\u2013324 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"43_CR18","first-page":"33","volume":"140","author":"L. Sheng","year":"1999","unstructured":"Sheng, L.: Cycle free probe interval graphs. Congressus Numerantium\u00a0140, 33\u201342 (1999)","journal-title":"Congressus Numerantium"},{"key":"43_CR19","unstructured":"Zhang, P.: Probe interval graph and its application to physical mapping of DNA (1994) (manuscript)"},{"key":"43_CR20","first-page":"309","volume":"10","author":"P. Zhang","year":"1994","unstructured":"Zhang, P., Schon, E.A., Fisher, S.G., Cayanis, E., Weiss, J., Kistler, S., Bourne, P.E.: An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA. CABIOS\u00a010, 309\u2013317 (1994)","journal-title":"CABIOS"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T18:13:38Z","timestamp":1685470418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}