The Computational Complexity of some Guard Sets in Polygons.
Resource URI: http://dblp.l3s.de/d2r/resource/publications/journals/eik/AhlfeldH92
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/eik/AhlfeldH92
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Hans-Dietrich_Hecker
>
dc:
creator
<
http://dblp.l3s.de/d2r/resource/authors/Uwe_Ahlfeld
>
dc:
identifier
DBLP journals/eik/AhlfeldH92
(xsd:string)
dcterms:
issued
1992
(xsd:gYear)
swrc:
journal
<
http://dblp.l3s.de/d2r/resource/journals/eik
>
rdfs:
label
The Computational Complexity of some Guard Sets in Polygons.
(xsd:string)
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Hans-Dietrich_Hecker
>
foaf:
maker
<
http://dblp.l3s.de/d2r/resource/authors/Uwe_Ahlfeld
>
swrc:
number
6
(xsd:string)
swrc:
pages
331-342
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/eik/AhlfeldH92/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/eik/AhlfeldH92
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/eik/eik28.html#AhlfeldH92
>
dc:
title
The Computational Complexity of some Guard Sets in Polygons.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
28
(xsd:string)