{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:43Z","timestamp":1725512143093},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729181"},{"type":"electronic","value":"9783540729518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72951-8_26","type":"book-chapter","created":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T20:03:25Z","timestamp":1183320205000},"page":"328-340","source":"Crossref","is-referenced-by-count":0,"title":["Upper Bounds and Algorithms for Parallel Knock-Out Numbers"],"prefix":"10.1007","author":[{"given":"Hajo","family":"Broersma","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London (1976)"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/978-3-540-28629-5_13","volume-title":"Mathematical Foundations of Computer Science 2004","author":"H. Broersma","year":"2004","unstructured":"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\u2013214. Springer, Heidelberg (2004)"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.dam.2006.04.034","volume":"155","author":"H. Broersma","year":"2007","unstructured":"Broersma, H., et al.: Eliminating graphs by means of parallel knock-out schemes. Discrete Applied Mathematics\u00a0155, 92\u2013102 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/11682462_26","volume-title":"LATIN 2006: Theoretical Informatics","author":"H. Broersma","year":"2006","unstructured":"Broersma, H., et al.: The computational complexity of the parallel knock-out problem. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 250\u2013261. Springer, Heidelberg (2006)"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0012-365X(96)00045-3","volume":"164","author":"R. Faudree","year":"1997","unstructured":"Faudree, R., Flandrin, E., Ryj\u00e1\u010dek, Z.: Claw-free graphs\u2014a survey. Discrete Mathematics\u00a0164, 87\u2013147 (1997)","journal-title":"Discrete Mathematics"},{"key":"26_CR6","unstructured":"Fraenkel, A.S.: Combinatorial games: selected bibliography with a succinct gourmet introduction. Electronic Journal of Combinatorics (2007), \n                    \n                      http:\/\/www.emis.ams.org\/journals\/EJC\/Surveys\/ds2.pdf"},{"key":"26_CR7","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"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72951-8_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:08:53Z","timestamp":1605744533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72951-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729181","9783540729518"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72951-8_26","relation":{},"subject":[]}}