1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2011★ 1 cited
Maintaining Arrays of Contiguous Objects
Michael A. Bender, Sándor P. Fekete, Tom Kamphans +1
In this paper we consider methods for dynamically storing a set of different objects ("modules") in a physical array. Each module requires one free contiguous subinterval in order…
cs.DS2010
Online Square Packing
Sandor P. Fekete, Tom Kamphans, Nils Schweer
We analyze the problem of packing squares in an online fashion: Given a semi-infinite strip of width 1 and an unknown sequence of squares of side length in [0,1] that arrive from a…