Jan Jedelský

According to our database, Jan Jedelský authored at least 9 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

k-Planar and Fan-Crossing Drawings and Transductions of Planar Graphs.

Petr Hlinený, Jan Jedelský

CoRR, June, 2025

First-order transducibility among classes of sparse graphs.

Jakub Gajarský, Jeremi Gladkowski, Jan Jedelský, Michal Pilipczuk, Szymon Torunczyk

CoRR, May, 2025

Twin-Width of Planar Graphs Is at Most 8, and Some Related Bounds.

Petr Hlinený, Jan Jedelský

SIAM J. Discret. Math., 2025

Transductions of Graph Classes Admitting Product Structure.

Petr Hlinený, Jan Jedelský

Proceedings of the 40th Annual ACM/IEEE Symposium on Logic in Computer Science, 2025

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, March, 2024

ℋ-Clique-Width and a Hereditary Analogue of Product Structure.

Petr Hlinený, Jan Jedelský

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

Twin-Width of Planar Graphs Is at Most 8, and at Most 6 When Bipartite Planar.

Petr Hlinený, Jan Jedelský

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Twin-width of Planar Graphs is at most 8.

Petr Hlinený, Jan Jedelský

CoRR, 2022

Twin-Width and Transductions of Proper k-Mixed-Thin Graphs.

Jakub Balabán, Petr Hlinený, Jan Jedelský

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022