[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/cocoa/FellowsFLRSST07>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Carsten_Thomassen>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Daniel_Lokshtanov>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Fedor_V._Fomin>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Frances_A._Rosamond>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Michael_R._Fellows>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Saket_Saurabh_0001>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Stefan_Szeider>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-73556-4%5F38>
foaf:homepage <https://doi.org/10.1007/978-3-540-73556-4_38>
dc:identifier DBLP conf/cocoa/FellowsFLRSST07 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F978-3-540-73556-4%5F38 (xsd:string)
dcterms:issued 2007 (xsd:gYear)
rdfs:label On the Complexity of Some Colorful Problems Parameterized by Treewidth. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Carsten_Thomassen>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Daniel_Lokshtanov>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Fedor_V._Fomin>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Frances_A._Rosamond>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Michael_R._Fellows>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Saket_Saurabh_0001>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Stefan_Szeider>
swrc:pages 366-377 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/cocoa/2007>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/cocoa/FellowsFLRSST07/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/cocoa/FellowsFLRSST07>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/cocoa/cocoa2007.html#FellowsFLRSST07>
rdfs:seeAlso <https://doi.org/10.1007/978-3-540-73556-4_38>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/cocoa>
dc:subject Topics Parameterized Complexity; Bounded Treewidth; Graph Coloring (xsd:string)
dc:title On the Complexity of Some Colorful Problems Parameterized by Treewidth. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document