[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/RamanS08>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Saket_Saurabh_0001>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Venkatesh_Raman_0001>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2Fs00453-007-9148-9>
foaf:homepage <https://doi.org/10.1007/s00453-007-9148-9>
dc:identifier DBLP journals/algorithmica/RamanS08 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2Fs00453-007-9148-9 (xsd:string)
dcterms:issued 2008 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/algorithmica>
rdfs:label Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Saket_Saurabh_0001>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Venkatesh_Raman_0001>
swrc:number 2 (xsd:string)
swrc:pages 203-225 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/RamanS08/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/algorithmica/RamanS08>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica52.html#RamanS08>
rdfs:seeAlso <https://doi.org/10.1007/s00453-007-9148-9>
dc:subject Dominating set; Independent set; Set cover; t-vertex cover; Parameterized complexity (xsd:string)
dc:title Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 52 (xsd:string)