5 citations · 8 across the 5 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2018★ 3 cited
Secretary problem: graphs, matroids and greedoids
Wojciech Kordecki
In the paper the generalisation of the well known "secretary problem" is considered. The aim of the paper is to give a generalised model in such a way that the chosen set of the po…
cs.DM2016
Greedy online colouring with buffering
Wojciech Kordecki, Anna Łyczkowska-Hanćkowiak
We consider the problem of online graph colouring. Whenever a node is requested, a colour must be assigned to the node, and this colour must be different from the colours of any of…