92 citations · 105 across the 17 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CG2017★ 1 cited
The Painter's Problem: covering a grid with colored connected polygons
Arthur van Goethem, Irina Kostitsyna, Marc van Kreveld +3
Motivated by a new way of visualizing hypergraphs, we study the following problem. Consider a rectangular grid and a set of colors . Each cell in the grid is assigned a subs…
cs.DS2017★ 1 cited
A Framework for Algorithm Stability
Wouter Meulemans, Bettina Speckmann, Kevin Verbeek +1
We say that an algorithm is stable if small changes in the input result in small changes in the output. This kind of algorithm stability is particularly relevant when analyzing and…