On the complexity of some colorful problems parameterized by treewidth.
Resource URI: http://dblp.l3s.de/d2r/resource/publications/journals/iandc/FellowsFLRSST11
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/iandc/FellowsFLRSST11
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Carsten_Thomassen
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Daniel_Lokshtanov
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Fedor_V._Fomin
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Frances_A._Rosamond
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Michael_R._Fellows
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Saket_Saurabh
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Stefan_Szeider
>
foaf:
homepage
<
http://dx.doi.org/10.1016%2Fj.ic.2010.11.026
>
foaf:
homepage
<
http://dx.doi.org/10.1016/j.ic.2010.11.026
>
dc:
identifier
DBLP journals/iandc/FellowsFLRSST11
(xsd:string)
dc:
identifier
DOI 10.1016%2Fj.ic.2010.11.026
(xsd:string)
dcterms:
issued
2011
(xsd:gYear)
swrc:
journal
<
http://dblp.l3s.de/d2r/resource/journals/iandc
>
rdfs:
label
On the complexity of some colorful problems parameterized by treewidth.
(xsd:string)
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Carsten_Thomassen
>
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Daniel_Lokshtanov
>
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Fedor_V._Fomin
>
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Frances_A._Rosamond
>
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Michael_R._Fellows
>
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Saket_Saurabh
>
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Stefan_Szeider
>
swrc:
number
2
(xsd:string)
swrc:
pages
143-153
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/iandc/FellowsFLRSST11/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/iandc/FellowsFLRSST11
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/iandc/iandc209.html#FellowsFLRSST11
>
rdfs:
seeAlso
<
http://dx.doi.org/10.1016/j.ic.2010.11.026
>
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:Article
rdf:
type
foaf:Document
swrc:
volume
209
(xsd:string)