24 citations · 94 across the 38 of their papers we have counts for
52 papers
On the dichromatic number of surfaces
Pierre Aboulker, Frédéric Havet, Kolja Knauer +1
In this paper, we give bounds on the dichromatic number of a surface , which is the maximum dichromatic number of an oriented graph embeddable on . We determine th…
Finitary affine oriented matroids
Emanuele Delucchi, Kolja Knauer
We initiate the axiomatic study of affine oriented matroids (AOMs) on arbitrary ground sets, obtaining fundamental notions such as minors, reorientations and a natural embedding in…
On sensitivity in bipartite Cayley graphs
Ignacio García-Marco, Kolja Knauer
Huang proved that every set of more than half the vertices of the -dimensional hypercube induces a subgraph of maximum degree at least , which is tight by a resu…
Plattenbauten: Touching Rectangles in Space
Stefan Felsner, Kolja Knauer, Torsten Ueckerdt
Planar bipartite graphs can be represented as touching graphs of horizontal and vertical segments in . We study a generalization in space: touching graphs of axis-ali…
Corners and simpliciality in oriented matroids and partial cubes
Kolja Knauer, Tilen Marc
Building on a recent characterization of tope graphs of Complexes of Oriented Matroids (COMs), we tackle and generalize several classical problems in Oriented Matroids (OMs), Lopsi…
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…