<?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">
  <responseDate>2026-07-22T00:03:36Z</responseDate>
  <request identifier="25737" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:25737</identifier>
        <datestamp>2026-06-23T12:45:29Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc: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>1038 A10s Fit into One A0</dc:title>
          <dc:creator>Friedrich, Noel</dc:creator>
          <dc:subject>rectangle packing</dc:subject>
          <dc:subject>pallet loading problem</dc:subject>
          <dc:subject>rounding effects</dc:subject>
          <dc:subject>ISO 216</dc:subject>
          <dc:description>The A-series paper sizes are specified in integer millimetres in ISO 216. Since the sizes are based on an irrational aspect ratio, rounding errors introduce small but cumulative discrepancies from their nominal areas. In this work, we prove that exactly 1038 sheets of ISO A10 can be packed without overlap into a single ISO A0 sheet, allowing only orthogonal (axis-aligned) placements. A lower bound is given by an explicit construction, while the upper bound is proved by a simple-to-verify computer-assisted certificate. Along the way, the dual certificates produce unexpectedly pretty weightmaps.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Noel Friedrich</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 366, 13th International Conference on Fun with Algorithms (FUN 2026)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.FUN.2026.18</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-257379</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2026.18</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
