Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/icalp/BringmannS21
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/icalp/BringmannS21
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jasper_Slusallek
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Karl_Bringmann
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.4230%2FLIPIcs.ICALP.2021.40
>
foaf:
homepage
<
https://doi.org/10.4230/LIPIcs.ICALP.2021.40
>
dc:
identifier
DBLP conf/icalp/BringmannS21
(xsd:string)
dc:
identifier
DOI doi.org%2F10.4230%2FLIPIcs.ICALP.2021.40
(xsd:string)
dcterms:
issued
2021
(xsd:gYear)
rdfs:
label
Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jasper_Slusallek
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Karl_Bringmann
>
swrc:
pages
40:1-40:16
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/icalp/2021
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/icalp/BringmannS21/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/icalp/BringmannS21
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/icalp/icalp2021.html#BringmannS21
>
rdfs:
seeAlso
<
https://doi.org/10.4230/LIPIcs.ICALP.2021.40
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/icalp
>
dc:
title
Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document