2 papers
cs.DS2025
Improving Online Bin Covering with Little Advice
Andrej Brodnik, Bengt J. Nilsson, Gordana VujoviÄ
The online bin covering problem is: given an input sequence of items find a placement of the items in the maximum number of bins such that the sum of the items' sizes in each bin i…
cs.CG2024
Guarding Polyominoes Under -Hop Visibility
Omrit Filtser, Erik Krohn, Bengt J. Nilsson +2
We study the Art Gallery Problem under -hop visibility in polyominoes. In this visibility model, two unit squares of a polyomino can see each other if and only if the shortest p…