2 papers
cs.CG2026
Improved Bounds for Discrete Voronoi Games
Mark de Berg, Geert van Wordragen
In the planar one-round discrete Voronoi game, two players and compete over a set of voters represented by points in . First, $\ma…
cs.CG2026
Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
Mark de Berg, Sándor Kisfaludi-Bak
Recently it was shown that many classic graph problems -- Independent Set, Dominating Set, Hamiltonian Cycle, and more -- can be solved in subexponential time on unit-ball graphs.…