35 citations · 69 across the 35 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DC2016★ 4 cited
Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model
Dan Hefetz, Fabian Kuhn, Yannic Maus +1
We show an lower bound on the runtime of any deterministic distributed -graph coloring algorithm in a weak vari…
math.CO2016★ 1 cited
Strong Ramsey Games: Drawing on an infinite board
Dan Hefetz, Christopher Kusch, Lothar Narins +3
We consider the strong Ramsey-type game , played on the edge set of the infinite complete -uniform hypergraph . Two p…