The Maximum Distance-d Independent Set Problem on Unit Disk Graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/faw/JenaJDN18
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/faw/JenaJDN18
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Gautam_K._Das
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ramesh_K._Jallu
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sangram_Kishor_Jena
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Subhas_C._Nandy
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-319-78455-7%5F6
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-319-78455-7_6
>
dc:
identifier
DBLP conf/faw/JenaJDN18
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-319-78455-7%5F6
(xsd:string)
dcterms:
issued
2018
(xsd:gYear)
rdfs:
label
The Maximum Distance-d Independent Set Problem on Unit Disk Graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Gautam_K._Das
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ramesh_K._Jallu
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sangram_Kishor_Jena
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Subhas_C._Nandy
>
swrc:
pages
68-80
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/faw/2018
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/faw/JenaJDN18/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/faw/JenaJDN18
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/faw/faw2018.html#JenaJDN18
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-319-78455-7_6
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/faw
>
dc:
title
The Maximum Distance-d Independent Set Problem on Unit Disk Graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document