<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:dc="http://purl.org/dc/elements/1.1/"
           xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
           xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   	<dc:title>On the number of furthest neighbor pairs in a point set</dc:title>
   	<dc:creator>Edelsbrunner, Herbert ; https://orcid.org/0000-0002-9823-6833</dc:creator>
   	<dc:creator>Skiena, Steven</dc:creator>
   	<dc:publisher>Mathematical Association of America</dc:publisher>
   	<dc:date>1989</dc:date>
   	<dc:type>info:eu-repo/semantics/article</dc:type>
   	<dc:type>doc-type:article</dc:type>
   	<dc:type>text</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_2df8fbb1</dc:type>
   	<dc:identifier>https://research-explorer.ista.ac.at/record/4079</dc:identifier>
   	<dc:source>Edelsbrunner H, Skiena S. On the number of furthest neighbor pairs in a point set. &lt;i&gt;American Mathematical Monthly&lt;/i&gt;. 1989;96(7):614-618. doi:&lt;a href=&quot;https://doi.org/10.1080/00029890.1989.11972250&quot;&gt;10.1080/00029890.1989.11972250&lt;/a&gt;</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1080/00029890.1989.11972250</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/issn/0002-9890</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/e-issn/1930-0972</dc:relation>
   	<dc:rights>info:eu-repo/semantics/closedAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
