<?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-09-05T12:01:01Z</responseDate>
  <request identifier="25902" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:25902</identifier>
        <datestamp>2026-06-23T13:00:31Z</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>Sliding Cubes in Parallel (Media Exposition)</dc:title>
          <dc:creator>A. Akitaya, Hugo</dc:creator>
          <dc:creator>Dorfer, Joseph</dc:creator>
          <dc:creator>Kramer, Peter</dc:creator>
          <dc:creator>Rieck, Christian</dc:creator>
          <dc:creator>Samanta, Soham</dc:creator>
          <dc:creator>Shahrouzi, Gabriel</dc:creator>
          <dc:creator>Stock, Frederick</dc:creator>
          <dc:subject>Sliding squares</dc:subject>
          <dc:subject>parallel motion</dc:subject>
          <dc:subject>reconfigurability</dc:subject>
          <dc:subject>three dimensions</dc:subject>
          <dc:subject>constant makespan</dc:subject>
          <dc:subject>log-APX hardness</dc:subject>
          <dc:subject>NP-hardness</dc:subject>
          <dc:subject>worst-case optimality</dc:subject>
          <dc:description>The sliding cubes model serves as a well-established theoretical framework for formalizing and analyzing reconfiguration algorithms in modular robotic systems built from face-connected cubic modules. We extend the parallel sliding cubes model from two to three dimensions, presenting new algorithms, surprising complexity results, and a generalization of the best known bounds from two to three dimensions. A companion video visualizes and explains our results.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Hugo A. Akitaya and Joseph Dorfer and Peter Kramer and Christian Rieck and Soham Samanta and Gabriel Shahrouzi and Frederick Stock</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 367, 42nd International Symposium on Computational Geometry (SoCG 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.SoCG.2026.96</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-259020</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.96</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>
