Twin-width of Planar Graphs is at most 8. - Petr Hlinený; Jan Jedelský (CoRR, 2022)

Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar. - Petr Hlinený; Jan Jedelský (ICALP, 2023)

ℋ-Clique-Width and a Hereditary Analogue of Product Structure. - Petr Hlinený; Jan Jedelský (MFCS, 2024)

Twin-width and transductions of proper k-mixed-thin graphs. - Jakub Balabán; Petr Hlinený; Jan Jedelský (Discret. Math., 2024)

Comprehensive experimental and numerical validation of Lattice Boltzmann fluid flow and particle simulations in a child respiratory tract. - Frantisek Prinz; Jan Pokorný; Jakub Elcner; Frantisek Lízal; Ondrej Misík; Milan Malý; Miloslav Belka; Nicolas Hafen; Adrian Kummerländer; Mathias J. Krause; Jan Jedelský; Miroslav Jícha (Comput. Biol. Medicine, 2024)

Transductions of Graph Classes Admitting Product Structure. - Petr Hlinený; Jan Jedelský (CoRR, 2025)

First-order transducibility among classes of sparse graphs. - Jakub Gajarský; Jeremi Gladkowski; Jan Jedelský; Michal Pilipczuk; Szymon Torunczyk (CoRR, 2025)

k-Planar and Fan-Crossing Drawings and Transductions of Planar Graphs. - Petr Hlinený; Jan Jedelský (CoRR, 2025)