The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Parallel knock-out (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2004-2010 (8)
Publication types (Num. hits)
article(4) inproceedings(4)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 3 keywords

Results
Found 8 publication records. Showing 8 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
3Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma Upper Bounds and Algorithms for Parallel Knock-Out Numbers. Search on Bibsonomy SIROCCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF parallel knock-out schemes, computational complexity, claw-free graphs
3Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart The Computational Complexity of the Parallel Knock-Out Problem. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Parallel knock-out, computational complexity, graphs
2Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger Parallel Knock-Out Schemes in Networks. Search on Bibsonomy MFCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Matthew Johnson 0002, Daniël Paulusma, Chantal Wood Path factors and parallel knock-out schemes of almost claw-free graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma Upper bounds and algorithms for parallel knock-out numbers. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart The computational complexity of the parallel knock-out problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Matthew Johnson, Daniël Paulusma, Chantal Wood Path factors and parallel knock-out schemes of almost claw-free graphs. Search on Bibsonomy IWOCA The full citation details ... 2008 DBLP  BibTeX  RDF
1Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger Eliminating graphs by means of parallel knock-out schemes. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #8 of 8 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.