{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:16Z","timestamp":1725558796524},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405436"},{"type":"electronic","value":"9783540450771"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45077-1_7","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T20:53:34Z","timestamp":1277499214000},"page":"61-72","source":"Crossref","is-referenced-by-count":2,"title":["Linear Time Algorithms for Some NP-Complete Problems on (P 5,Gem)-Free Graphs"],"prefix":"10.1007","author":[{"given":"Hans","family":"Bodlaender","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"additional","affiliation":[]},{"given":"Dieter","family":"Kratsch","sequence":"additional","affiliation":[]},{"given":"Micha\u00ebl","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Jeremy","family":"Spinrad","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms\u00a012, 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0020-0190(89)90221-4","volume":"31","author":"H. Bodlaender","year":"1989","unstructured":"Bodlaender, H.: Achromatic number is NP-complete for cographs and interval graphs. Inform. Process. Lett.\u00a031, 135\u2013138 (1989)","journal-title":"Inform. Process. Lett."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-45749-6_22","volume-title":"Algorithms - ESA 2002","author":"H.L. Bodlaender","year":"2002","unstructured":"Bodlaender, H.L., Broersma, H.J., Fomin, F.V., Pyatkin, A.V., Woeginger, G.J.: Radio labeling with pre-assigned frequencies. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 211\u2013222. Springer, Heidelberg (2002)"},{"key":"7_CR4","first-page":"14","volume":"7","author":"H.L. Bodlaender","year":"2000","unstructured":"Bodlaender, H.L., Jansen, K.: On the complexity of the maximum cut problem. Nord. J. Comput.\u00a07, 14\u201331 (2000)","journal-title":"Nord. J. Comput."},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-45471-3_40","volume-title":"Algorithm Theory - SWAT 2002","author":"H.L. Bodlaender","year":"2002","unstructured":"Bodlaender, H.L., Rotics, U.: Computing the treewidth and the minimum fill-in with the modular decomposition. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 388\u2013397. Springer, Heidelberg (2002)"},{"key":"7_CR6","unstructured":"Brandst\u00e4dt, A., Kratsch, D.: On the structure of (P5, gem)-free graphs (2002) (manuscript)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, H.-O., Mosca, R.: Chordal co-gem-free graphs have bounded clique width (2002) (manuscript)","DOI":"10.1007\/3-540-36379-3_6"},{"key":"7_CR8","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey. SIAM Monographs on Discrete Math. Appl.","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. SIAM Monographs on Discrete Math. Appl., vol.\u00a03. SIAM, Philadelphia (1999)"},{"key":"7_CR9","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P.D., Thomas, R.: The Strong Perfect Graph Theorem (2002) (manuscript)"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart-Burlingham, L.: Complement reducible graphs. Discrete Applied Math.\u00a03, 163\u2013174 (1981)","journal-title":"Discrete Applied Math."},{"key":"7_CR11","first-page":"249","volume":"43","author":"D.G. Corneil","year":"1984","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: Cographs: recognition, applications, and algorithms. Congressus Numer\u00a043, 249\u2013258 (1984)","journal-title":"Congressus Numer"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems\u00a033, 125\u2013150 (2000)","journal-title":"Theory of Computing Systems"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0017474","volume-title":"Trees in Algebra and Programming - CAAP \u201994","author":"A. Cournier","year":"1994","unstructured":"Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, pp. 68\u201384. Springer, Heidelberg (1994)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1006\/jagm.2001.1185","volume":"41","author":"E. Dahlhaus","year":"2001","unstructured":"Dahlhaus, E., Gustedt, J., McConnell, R.M.: Efficient and practical algorithms for sequential modular decomposition. J. Algorithms\u00a041, 360\u2013387 (2001)","journal-title":"J. Algorithms"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-45477-2_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"W. Espelage","year":"2001","unstructured":"Espelage, W., Gurski, F., Wanke, E.: How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 117\u2013128. Springer, Heidelberg (2001)"},{"key":"#cr-split#-7_CR16.1","unstructured":"Frank, A.: Some polynomial algorithms for certain graphs and hypergraphs. In: Proceedings of the Fifth British Combinatorial Conference, Univ. Aberdeen, Aberdeen, pp. 211???226 (1975);"},{"key":"#cr-split#-7_CR16.2","unstructured":"Frank, A.: Some polynomial algorithms for certain graphs and hypergraphs. In: Proceedings of the Fifth British Combinatorial Conference, Univ. Aberdeen, Aberdeen, pp. 211\u2013226 (1975); Congressus Numerantium No. XV, Utilitas Math., Winnipeg, Man (1976)"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Mathematica Academiae Scientiarum Hungaricae\u00a018, 25\u201366 (1967)","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0166-218X(97)00093-0","volume":"80","author":"V. Giakoumakis","year":"1997","unstructured":"Giakoumakis, V., Rusu, I.: Weighted parameters in (P5, $\\overline{P5}$ )-free graphs. Discrete Appl. Math.\u00a080, 255\u2013261 (1997)","journal-title":"Discrete Appl. Math."},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0166-218X(96)00085-6","volume":"75","author":"K. Jansen","year":"1997","unstructured":"Jansen, K., Scheffler, P.: Generalized coloring for tree-like graphs. Discrete Appl. Math.\u00a075, 135\u2013155 (1997)","journal-title":"Discrete Appl. Math."},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(02)00198-1","volume":"126","author":"D. Kobler","year":"2003","unstructured":"Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math.\u00a0126, 197\u2013221 (2003)","journal-title":"Discrete Appl. Math."},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L. Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: Normal hypergraphs and the perfect graph conjecture. Discrete Math.\u00a02, 253\u2013267 (1972)","journal-title":"Discrete Math."},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.: Modular decomposition and transitive orientation. Discrete Math.\u00a0201, 189\u2013241 (1999)","journal-title":"Discrete Math."},{"key":"7_CR23","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Chichester (1986)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45077-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T12:53:36Z","timestamp":1559220816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45077-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405436","9783540450771"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45077-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}