Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/stacs/EgriMR18
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/stacs/EgriMR18
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/D%E2%88%9A%C2%B0niel_Marx
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/L%E2%88%9A%C2%B0szl%E2%88%9A%E2%89%A5_Egri
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Pawel_Rzazewski
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.4230%2FLIPIcs.STACS.2018.27
>
foaf:
homepage
<
https://doi.org/10.4230/LIPIcs.STACS.2018.27
>
dc:
identifier
DBLP conf/stacs/EgriMR18
(xsd:string)
dc:
identifier
DOI doi.org%2F10.4230%2FLIPIcs.STACS.2018.27
(xsd:string)
dcterms:
issued
2018
(xsd:gYear)
rdfs:
label
Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/D%E2%88%9A%C2%B0niel_Marx
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/L%E2%88%9A%C2%B0szl%E2%88%9A%E2%89%A5_Egri
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Pawel_Rzazewski
>
swrc:
pages
27:1-27:15
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/stacs/2018
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/stacs/EgriMR18/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/stacs/EgriMR18
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/stacs/stacs2018.html#EgriMR18
>
rdfs:
seeAlso
<
https://doi.org/10.4230/LIPIcs.STACS.2018.27
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/stacs
>
dc:
title
Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document