The Computational Complexity of the Parallel Knock-Out Problem. Broersma, H., Johnson 0002, M., Paulusma, D., & Stewart, I. A. In Proceedings of Latin American Symposium on Theoretical Informatics (LATIN), pages 250-261, 2006. ![The Computational Complexity of the Parallel Knock-Out Problem [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper bibtex @inproceedings{ dblp2674304,
title = {The Computational Complexity of the Parallel Knock-Out Problem},
author = {Hajo Broersma and Matthew Johnson 0002 and Daniël Paulusma and Iain A. Stewart},
author_short = {Broersma, H. and Johnson 0002, M. and Paulusma, D. and Stewart, I. A.},
bibtype = {inproceedings},
type = {inproceedings},
year = {2006},
key = {dblp2674304},
id = {dblp2674304},
biburl = {http://www.dblp.org/rec/bibtex/conf/latin/BroersmaJPS06},
url = {http://dx.doi.org/10.1007/11682462_26},
conference = {LATIN},
pages = {250-261},
text = {LATIN 2006:250-261},
booktitle = {Proceedings of Latin American Symposium on Theoretical Informatics (LATIN)}
}
Downloads: 0
{"_id":{"_str":"5243fd64b1392ed143001857"},"__v":0,"authorIDs":[],"author_short":["Broersma, H.","Johnson 0002, M.","Paulusma, D.","Stewart, I. A."],"bibbaseid":"broersma-johnson0002-paulusma-stewart-thecomputationalcomplexityoftheparallelknockoutproblem-2006","bibdata":{"html":"<div class=\"bibbase_paper\">\n\n\n<span class=\"bibbase_paper_titleauthoryear\">\n\t<span class=\"bibbase_paper_title\"><a name=\"dblp2674304\"> </a>The Computational Complexity of the Parallel Knock-Out Problem.</span>\n\t<span class=\"bibbase_paper_author\">\nBroersma, H.; Johnson 0002, M.; Paulusma, D.; and Stewart, I. A.</span>\n\t<!-- <span class=\"bibbase_paper_year\">2006</span>. -->\n</span>\n\n\n\nIn\n<i>Proceedings of Latin American Symposium on Theoretical Informatics (LATIN)</i>, page 250-261, 2006.\n\n\n\n\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content\">\n \n \n <!-- <i -->\n <!-- onclick=\"javascript:log_download('broersma-johnson0002-paulusma-stewart-thecomputationalcomplexityoftheparallelknockoutproblem-2006', 'http://dx.doi.org/10.1007/11682462_26')\">DEBUG -->\n <!-- </i> -->\n\n <a href=\"http://dx.doi.org/10.1007/11682462_26\"\n onclick=\"javascript:log_download('broersma-johnson0002-paulusma-stewart-thecomputationalcomplexityoftheparallelknockoutproblem-2006', 'http://dx.doi.org/10.1007/11682462_26')\">\n <img src=\"http://bibbase.org/img/filetypes/blank.png\"\n\t alt=\"The Computational Complexity of the Parallel Knock-Out Problem [.1007/11682462_26]\" \n\t class=\"bibbase_icon\"\n\t style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\" ><span class=\"bibbase_icon_text\">Paper</span></a> \n \n \n <a href=\"javascript:showBib('dblp2674304')\">\n <img src=\"http://bibbase.org/img/filetypes/bib.png\" \n\t alt=\"The Computational Complexity of the Parallel Knock-Out Problem [bib]\" \n\t class=\"bibbase_icon\"\n\t style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\"><span class=\"bibbase_icon_text\">Bibtex</span></a>\n \n \n\n \n \n \n \n \n\n \n \n</span>\n\n<!-- -->\n\n</div>\n","downloads":0,"bibbaseid":"broersma-johnson0002-paulusma-stewart-thecomputationalcomplexityoftheparallelknockoutproblem-2006","urls":{"Paper":"http://dx.doi.org/10.1007/11682462_26"},"role":"author","bibtex":"@inproceedings{ dblp2674304,\n title = {The Computational Complexity of the Parallel Knock-Out Problem},\n author = {Hajo Broersma and Matthew Johnson 0002 and Daniël Paulusma and Iain A. Stewart},\n author_short = {Broersma, H. and Johnson 0002, M. and Paulusma, D. and Stewart, I. A.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {2006},\n key = {dblp2674304},\n id = {dblp2674304},\n biburl = {http://www.dblp.org/rec/bibtex/conf/latin/BroersmaJPS06},\n url = {http://dx.doi.org/10.1007/11682462_26},\n conference = {LATIN},\n pages = {250-261},\n text = {LATIN 2006:250-261},\n booktitle = {Proceedings of Latin American Symposium on Theoretical Informatics (LATIN)}\n}","booktitle":"Proceedings of Latin American Symposium on Theoretical Informatics (LATIN)","text":"LATIN 2006:250-261","pages":"250-261","conference":"LATIN","url":"http://dx.doi.org/10.1007/11682462_26","biburl":"http://www.dblp.org/rec/bibtex/conf/latin/BroersmaJPS06","id":"dblp2674304","key":"dblp2674304","year":"2006","type":"inproceedings","bibtype":"inproceedings","author_short":["Broersma, H.","Johnson 0002, M.","Paulusma, D.","Stewart, I. A."],"author":["Hajo Broersma","Matthew Johnson 0002","Daniël Paulusma","Iain A. Stewart"],"title":"The Computational Complexity of the Parallel Knock-Out Problem"},"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/latin/BroersmaJPS06","downloads":0,"search_terms":["computational","complexity","parallel","knock","out","problem","broersma","johnson 0002","paulusma","stewart"],"title":"The Computational Complexity of the Parallel Knock-Out Problem","year":2006,"dataSources":["A2oYdMpTxmhHDT5vx"]}