49 citations · 91 across the 2 of their papers we have counts for
2 papers
cs.DS2004★ 42 cited
Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices
Ali Ahmadinia, Christophe Bobda, Sandor Fekete +2
We describe algorithmic results for two crucial aspects of allocating resources on computational hardware devices with partial reconfigurability. By using methods from the field of…
cs.DS2002★ 49 cited
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
S. Fekete, S. Khuller, M. Klemmstein +2
The problem considered is the following. Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vertex, compute a low-weight spanning tree…