16 citations · 94 across the 30 of their papers we have counts for
4 papers · 1 filter
Minimizing an Uncrossed Collection of Drawings
Petr Hliněný, Tomáš Masařík
In this paper, we introduce the following new concept in graph drawing. Our task is to find a small collection of drawings such that they all together satisfy some property that is…
Parameterised Partially-Predrawn Crossing Number
Thekla Hamm, Petr Hliněný
Inspired by the increasingly popular research on extending partial graph drawings, we propose a new perspective on the traditional and arguably most important geometric graph param…
On conflict-free chromatic guarding of simple polygons
Onur Çağırıcı, Subir Kumar Ghosh, Petr Hliněný +1
We study the problem of colouring the vertices of a polygon, such that every viewer in it can see a unique colour. The goal is to minimise the number of colours used. This is also…
Bounded maximum degree conjecture holds precisely for -crossing-critical graphs with
Drago Bokal, Zdeněk Dvořák, Petr Hliněný +3
We study -crossing-critical graphs, which are the minimal graphs that require at least edge-crossings when drawn in the plane. For every fixed pair of integers with $c\ge 13…