67 citations · 244 across the 17 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.DS2014
A lazy approach to on-line bipartite matching
Jakub Kozik, Grzegorz Matecki
We present a new approach, called a lazy matching, to the problem of on-line matching on bipartite graphs. Imagine that one side of a graph is given and the vertices of the other s…
math.CO2014★ 1 cited
Improved algorithms for colorings of simple hypergraphs and applications
Jakub Kozik, Dmitry Shabanov
The paper deals with extremal problems concerning colorings of hypergraphs. By using a random recoloring algorithm we show that any -uniform simple (i.e. every two distinct edge…
math.CO2014★ 3 cited
Lower bounds for on-line graph colorings
Grzegorz Gutowski, Jakub Kozik, Piotr Micek +1
We propose two strategies for Presenter in on-line graph coloring games. The first one constructs bipartite graphs and forces any on-line coloring algorithm to use …