Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/soda/FockeMINSSW23
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/soda/FockeMINSSW23
>
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/Daniel_Neuen
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Fionn_Mc_Inerney
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Govind_S._Sankar
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jacob_Focke
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Philip_Wellnitz
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Philipp_Schepper
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1137%2F1.9781611977554.ch140
>
foaf:
homepage
<
https://doi.org/10.1137/1.9781611977554.ch140
>
dc:
identifier
DBLP conf/soda/FockeMINSSW23
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1137%2F1.9781611977554.ch140
(xsd:string)
dcterms:
issued
2023
(xsd:gYear)
rdfs:
label
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.
(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/Daniel_Neuen
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Fionn_Mc_Inerney
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Govind_S._Sankar
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jacob_Focke
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Philip_Wellnitz
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Philipp_Schepper
>
swrc:
pages
3664-3683
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/soda/2023
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/soda/FockeMINSSW23/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/soda/FockeMINSSW23
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/soda/soda2023.html#FockeMINSSW23
>
rdfs:
seeAlso
<
https://doi.org/10.1137/1.9781611977554.ch140
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/soda
>
dc:
title
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document