1 citations · 1 across the 9 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2024
Constrained and Ordered Level Planarity Parameterized by the Number of Levels
Václav Blažej, Boris Klemz, Felix Klesen +3
The problem Level Planarity asks for a crossing-free drawing of a graph in the plane such that vertices are placed at prescribed y-coordinates (called levels) and such that every e…
cs.CG2021
Non-homotopic Loops with a Bounded Number of Pairwise Intersections
Václav Blažej, Michal Opler, Matas Šileikis +1
Let be a set of points in the plane and let . An -loop is a continuous closed curve not containing any point of . We say that two -loops are non-…
cs.CG2019
On the edge-length ratio of 2-trees
Václav Blažej, Jiří Fiala, Giuseppe Liotta
We study planar straight-line drawings of graphs that minimize the ratio between the length of the longest and the shortest edge. We answer a question of Lazard et al. [Theor. Comp…