On the Advice Complexity of the Online L(2, 1)-Coloring Problem on Paths and Cycles.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/cocoon/BianchiBHKS13
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/cocoon/BianchiBHKS13
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Bj%E2%88%9A%E2%88%82rn_Steffen
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hans-Joachim_B%E2%88%9A%E2%88%82ckenhauer
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Juraj_Hromkovic
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Maria_Paola_Bianchi
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sacha_Krug
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-642-38768-5%5F7
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-642-38768-5_7
>
dc:
identifier
DBLP conf/cocoon/BianchiBHKS13
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-642-38768-5%5F7
(xsd:string)
dcterms:
issued
2013
(xsd:gYear)
rdfs:
label
On the Advice Complexity of the Online L(2, 1)-Coloring Problem on Paths and Cycles.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Bj%E2%88%9A%E2%88%82rn_Steffen
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hans-Joachim_B%E2%88%9A%E2%88%82ckenhauer
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Juraj_Hromkovic
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Maria_Paola_Bianchi
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sacha_Krug
>
swrc:
pages
53-64
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/cocoon/2013
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/cocoon/BianchiBHKS13/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/cocoon/BianchiBHKS13
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/cocoon/cocoon2013.html#BianchiBHKS13
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-642-38768-5_7
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/cocoon
>
dc:
title
On the Advice Complexity of the Online L(2, 1)-Coloring Problem on Paths and Cycles.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document