2 papers
cs.DS2024
An Optimal Algorithm for Sorting Pattern-Avoiding Sequences
Michal Opler
We present a deterministic comparison-based algorithm that sorts sequences avoiding a fixed permutation in linear time, even if is a priori unkown. Moreover, the dependence…
cs.CG2016
Squarability of rectangle arrangements
Matěj Konečný, Stanislav Kučera, Michal Opler +3
We study when an arrangement of axis-aligned rectangles can be transformed into an arrangement of axis-aligned squares in while preserving its structure. We found a…