[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/jcst/JiangG07>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Joel_Gillespie>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Minghui_Jiang_0001>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2Fs11390-007-9066-y>
foaf:homepage <https://doi.org/10.1007/s11390-007-9066-y>
dc:identifier DBLP journals/jcst/JiangG07 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2Fs11390-007-9066-y (xsd:string)
dcterms:issued 2007 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/jcst>
rdfs:label Engineering the Divide-and-Conquer Closest Pair Algorithm. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Joel_Gillespie>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Minghui_Jiang_0001>
swrc:number 4 (xsd:string)
swrc:pages 532-540 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/jcst/JiangG07/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/jcst/JiangG07>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/jcst/jcst22.html#JiangG07>
rdfs:seeAlso <https://doi.org/10.1007/s11390-007-9066-y>
dc:subject algorithmic engineering; analysis of algorithms; circle packing; closest pair; computational geometry (xsd:string)
dc:title Engineering the Divide-and-Conquer Closest Pair Algorithm. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 22 (xsd:string)