{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:30:56Z","timestamp":1725798656552},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_34","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T06:33:02Z","timestamp":1407825182000},"page":"396-407","source":"Crossref","is-referenced-by-count":1,"title":["Knocking Out P k -free Graphs"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Johnson","sequence":"first","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]},{"given":"Anthony","family":"Stewart","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"#cr-split#-34_CR2.1","doi-asserted-by":"crossref","unstructured":"Broersma, H.J., Fomin, F.V., Kr\u00e1lovi\u010d, R., Woeginger, G.J.: Eliminating graphs by means of parallel knock-out schemes. Discrete Applied Mathematics\u00a0155, 92-102 (2007)","DOI":"10.1016\/j.dam.2006.04.034"},{"key":"#cr-split#-34_CR2.2","doi-asserted-by":"crossref","unstructured":"See also Broersma, H., Fomin, F.V., Woeginger, G.J.: Parallel knock-out schemes in networks. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 204-214. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-28629-5_13"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.tcs.2007.11.021","volume":"393","author":"H.J. Broersma","year":"2008","unstructured":"Broersma, H.J., Johnson, M., Paulusma, D., Stewart, I.A.: The computational complexity of the parallel knock-out problem. Theoretical Computer Science\u00a0393, 182\u2013195 (2008)","journal-title":"Theoretical Computer Science"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1016\/j.tcs.2008.03.024","volume":"410","author":"H.J. Broersma","year":"2008","unstructured":"Broersma, H.J., Johnson, M., Paulusma, D.: Upper bounds and algorithms for parallel knock-out numbers. Theoretical Computer Science\u00a0410, 1319\u20131327 (2008)","journal-title":"Theoretical Computer Science"},{"key":"34_CR5","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 Mathematics\u00a03, 163\u2013174 (1981)","journal-title":"Discrete Applied Mathematics"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM Journal on Computing\u00a014, 926\u2013934 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Applied Mathematics\u00a0101, 77\u2013144 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"34_CR8","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":"34_CR9","first-page":"311","volume":"19","author":"S. F\u00f6ldes","year":"1977","unstructured":"F\u00f6ldes, S., Hammer, P.L.: Split graphs, 8th South\u2013Eastern Conf. on Combinatorics. Graph Theory and Computing, Congressus Numerantium\u00a019, 311\u2013315 (1977)","journal-title":"Graph Theory and Computing, Congressus Numerantium"},{"key":"34_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1142\/S0129054100000260","volume":"11","author":"M.C. Golumbic","year":"2000","unstructured":"Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. International Journal of Foundations of Computer Science\u00a011, 423\u2013443 (2000)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"34_CR12","first-page":"39","volume":"132","author":"O. Johansson","year":"1998","unstructured":"Johansson, O.: Clique-decomposition, NLC-decomposition, and modular decomposition \u2013 relationships and results for random graphs. Congressus Numerantium\u00a0132, 39\u201360 (1998)","journal-title":"Congressus Numerantium"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1016\/j.disc.2009.04.022","volume":"310","author":"M. Johnson","year":"2010","unstructured":"Johnson, M., Paulusma, D., Wood, C.: Path factors and parallel knock-out schemes of almost claw-free graphs. Discrete Mathematics\u00a0310, 1413\u20131423 (2010)","journal-title":"Discrete Mathematics"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"556","DOI":"10.2307\/2589409","volume":"105","author":"D.E. Lampert","year":"1998","unstructured":"Lampert, D.E., Slater, P.J.: Parallel knockouts in the complete graph. American Mathematical Monthly\u00a0105, 556\u2013558 (1998)","journal-title":"American Mathematical Monthly"},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(94)90026-4","volume":"54","author":"E. Wanke","year":"1994","unstructured":"Wanke, E.: k-NLC graphs and polynomial algorithms. Discrete Applied Mathematics\u00a054, 251\u2013266 (1994)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T11:13:35Z","timestamp":1558955615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}