9 citations · 20 across the 5 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
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…
cs.CC2016
Approximation and Hardness for Token Swapping
Tillmann Miltzow, Lothar Narins, Yoshio Okamoto +3
Given a graph with , we place on every vertex a token . A swap is an exchange of tokens on adjacent vertices. We consider the algorithmi…