73 citations · 178 across the 49 of their papers we have counts for
5 papers · 1 filter
Colouring bottomless rectangles and arborescences
Jean Cardinal, Kolja Knauer, Piotr Micek +3
We study problems related to colouring bottomless rectangles. One of our main results shows that for any positive integers , there is no semi-online algorithm that can -co…
Local and Union Page Numbers
Laura Merker, Torsten Ueckerdt
We introduce the novel concepts of local and union book embeddings, and, as the corresponding graph parameters, the local page number and the union page number $…
Engineering Negative Cycle Canceling for Wind Farm Cabling
Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner +2
In a wind farm turbines convert wind energy into electrical energy. The generation of each turbine is transmitted, possibly via other turbines, to a substation that is connected to…
Planar graphs have bounded queue-number
Vida Dujmović, Gwenaël Joret, Piotr Micek +3
We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The key to the proof is a new structural tool called lay…
A Note on Covering Young Diagrams with Applications to Local Dimension of Posets
Stefan Felsner, Torsten Ueckerdt
We prove that in every cover of a Young diagram with steps with generalized rectangles there is a row or a column in the diagram that is used by at least rect…