• Publications
  • Influence
New classes of fast lower bounds for bin packing problems
TLDR
We prove an asymptotic worst-case performance of 3/4 for a bound that can be computed in linear time for items sorted by size. Expand
  • 157
  • 22
  • PDF
A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
TLDR
We present a new approach for modeling packings, using a graph-theoretical characterization of feasible packings that share a combinatorial structure. Expand
  • 117
  • 17
  • PDF
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
TLDR
We present a new approach for obtaining classes of lower bounds for higher-dimensional packing problems; our bounds improve and simplify several well-known bounds from previous literature. Expand
  • 104
  • 14
  • PDF
An Exact Algorithm for Higher-Dimensional Orthogonal Packing
TLDR
We develop a two-level tree search algorithm for solving higher-dimensional orthogonal packing problems to optimality. Expand
  • 174
  • 13
  • PDF
DyNoC: A dynamic infrastructure for communication in dynamically reconfugurable devices
TLDR
A new paradigm to support the communication among modules dynamically placed on a reconfigurable device at run-time is presented. Expand
  • 157
  • 13
  • PDF
Approximation algorithms for lawn mowing and milling
TLDR
We study the problem of finding shortest tours/paths for “lawn mowing” and “milling” problems: Given a region in the plane, and given the shape of a “cutter” (typically, a circle or a square), find a shortest tour/path for the cutter. Expand
  • 214
  • 12
  • PDF
Neighborhood-Based Topology Recognition in Sensor Networks
TLDR
We consider a crucial aspect of self-organization of a sensor network consisting of a large set of simple sensor nodes with no location hardware and only very limited communication range. Expand
  • 197
  • 10
  • PDF
Deterministic boundary recognition and topology extraction for large sensor networks
TLDR
Our algorithms work in two stages: boundary recognition and topology extraction. Expand
  • 206
  • 8
  • PDF
Tree spanners in planar graphs
TLDR
A tree t-spanner of a graph G is a spanning subtree T of G in which the distance between every pair of vertices is at most t times their distance in G. For some purposes, not all pairs of connections have the same importance. Expand
  • 79
  • 8
  • PDF
Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues
TLDR
We introduce staged self-assembly of Wang tiles, where tiles can be added dynamically in sequence and where intermediate constructions can be stored for later mixing. Expand
  • 50
  • 8