---
res:
  bibo_abstract:
  - 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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Jakub
      foaf_name: Leśkiewicz, Jakub
      foaf_surname: Leśkiewicz
  - foaf_Person:
      foaf_givenName: Bartosz
      foaf_name: Furmanek, Bartosz
      foaf_surname: Furmanek
  - foaf_Person:
      foaf_givenName: Michał
      foaf_name: Lipiński, Michał
      foaf_surname: Lipiński
      foaf_workInfoHomepage: http://www.librecat.org/personId=dfffb474-4317-11ee-8f5c-fe3fc95a425e
    orcid: 0000-0001-9789-9750
  - foaf_Person:
      foaf_givenName: Dmitriy
      foaf_name: Morozov, Dmitriy
      foaf_surname: Morozov
  bibo_doi: 10.4230/LIPIcs.SoCG.2026.72
  bibo_volume: 367
  dct_date: 2026^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/1868-8969
  - http://id.crossref.org/issn/9783959774185
  dct_language: eng
  dct_publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik@
  dct_subject:
  - persistent homology
  - topological simplification
  - depth posets
  dct_title: Topological simplification guided by forbidden regions@
...