<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>Topological simplification guided by forbidden regions</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>LIPIcs</title>
</titleInfo>

<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Jakub</namePart>
  <namePart type="family">Leśkiewicz</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Bartosz</namePart>
  <namePart type="family">Furmanek</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Michał</namePart>
  <namePart type="family">Lipiński</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">dfffb474-4317-11ee-8f5c-fe3fc95a425e</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0001-9789-9750</description></name>
<name type="personal">
  <namePart type="given">Dmitriy</namePart>
  <namePart type="family">Morozov</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">HeEd</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>



<name type="conference">
  <namePart>SoCG: Symposium on Computational Geometry</namePart>
</name>



<name type="corporate">
  <namePart>IST-BRIDGE: International postdoctoral program</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">Topological simplification is the process of reducing complexity of a function while maintaining its essential features. Its goal is to find a new filter function, which reorders cells of the input complex in a way which eliminates some persistent homological features, without affecting the rest. We present a new approach to simplification based on the concept of forbidden regions and combinatorial dynamics. It allows us to reorder and cancel critical values, whose cancellation is not possible using existing methods because they are not consecutive in the total order. Each such cancellation takes O(c⋅n) time in the worst case, where c is the number of birth-death pairs and n is the size of the input complex.</abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="2026_LIPIcSSoCG_Leskiewicz.pdf">https://research-explorer.ista.ac.at/download/22002/22110/2026_LIPIcSSoCG_Leskiewicz.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription><accessCondition type="restrictionOnAccess">no</accessCondition>
</relatedItem>
<originInfo><publisher>Schloss Dagstuhl - Leibniz-Zentrum für Informatik</publisher><dateIssued encoding="w3cdtf">2026</dateIssued><place><placeTerm type="text">New Brunswick, NJ, United States</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>

<subject><topic>persistent homology</topic><topic>topological simplification</topic><topic>depth posets</topic>
</subject>


<relatedItem type="host"><titleInfo><title>42nd International Symposium on Computational Geometry</title></titleInfo>
  <identifier type="eIssn">1868-8969</identifier>
  <identifier type="isbn">9783959774185</identifier>
  <identifier type="arXiv">2603.16416</identifier><identifier type="doi">10.4230/LIPIcs.SoCG.2026.72</identifier>
<part><detail type="volume"><number>367</number></detail>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<mla>Leśkiewicz, Jakub, et al. “Topological Simplification Guided by Forbidden Regions.” &lt;i&gt;42nd International Symposium on Computational Geometry&lt;/i&gt;, vol. 367, 72:1-72:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:&lt;a href=&quot;https://doi.org/10.4230/LIPIcs.SoCG.2026.72&quot;&gt;10.4230/LIPIcs.SoCG.2026.72&lt;/a&gt;.</mla>
<chicago>Leśkiewicz, Jakub, Bartosz Furmanek, Michał Lipiński, and Dmitriy Morozov. “Topological Simplification Guided by Forbidden Regions.” In &lt;i&gt;42nd International Symposium on Computational Geometry&lt;/i&gt;, Vol. 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. &lt;a href=&quot;https://doi.org/10.4230/LIPIcs.SoCG.2026.72&quot;&gt;https://doi.org/10.4230/LIPIcs.SoCG.2026.72&lt;/a&gt;.</chicago>
<ista>Leśkiewicz J, Furmanek B, Lipiński M, Morozov D. 2026. Topological simplification guided by forbidden regions. 42nd International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 367, 72:1-72:17.</ista>
<ama>Leśkiewicz J, Furmanek B, Lipiński M, Morozov D. Topological simplification guided by forbidden regions. In: &lt;i&gt;42nd International Symposium on Computational Geometry&lt;/i&gt;. Vol 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:&lt;a href=&quot;https://doi.org/10.4230/LIPIcs.SoCG.2026.72&quot;&gt;10.4230/LIPIcs.SoCG.2026.72&lt;/a&gt;</ama>
<ieee>J. Leśkiewicz, B. Furmanek, M. Lipiński, and D. Morozov, “Topological simplification guided by forbidden regions,” in &lt;i&gt;42nd International Symposium on Computational Geometry&lt;/i&gt;, New Brunswick, NJ, United States, 2026, vol. 367.</ieee>
<apa>Leśkiewicz, J., Furmanek, B., Lipiński, M., &amp;#38; Morozov, D. (2026). Topological simplification guided by forbidden regions. In &lt;i&gt;42nd International Symposium on Computational Geometry&lt;/i&gt; (Vol. 367). New Brunswick, NJ, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. &lt;a href=&quot;https://doi.org/10.4230/LIPIcs.SoCG.2026.72&quot;&gt;https://doi.org/10.4230/LIPIcs.SoCG.2026.72&lt;/a&gt;</apa>
<short>J. Leśkiewicz, B. Furmanek, M. Lipiński, D. Morozov, in:, 42nd International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.</short>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>22002</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-06-14T22:01:43Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-06-22T07:45:36Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
