#### Filter Results:

- Full text PDF available (192)

#### Publication Year

1993

2017

- This year (8)
- Last 5 years (57)
- Last 10 years (123)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Erik D. Demaine, Martin L. Demaine, +4 authors Diane L. Souvaine
- Natural Computing
- 2007

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. This model and its various constraints and performance measures are motivated by a practical nanofabrication scenario through protein-based bioengineering. Staging allows us to break through… (More)

- Sándor P. Fekete, Alexander Kröller, Dennis Pfisterer, Stefan Fischer, Carsten Buschmann
- ALGOSENSORS
- 2004

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. After having been distributed randomly in a given two-dimensional region, the nodes are required to develop a sense for the environment, based on a limited amount of local… (More)

- Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell
- Comput. Geom.
- 2000

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 such that every point within the region is covered by the cutter at some position along the tour/path. In the milling version… (More)

A new paradigm to support the communication among modules dynamically placed on a reconfigurable device at run-time is presented. Based on the network on chip (NoC) infrastructure, we developed a dynamic communication infrastructure as well as routing methodologies capable to handle routing in a NoC with obstacles created by dynamically placed components.… (More)

- Sándor P. Fekete, Jörg Schepers
- Math. Program.
- 2001

The bin packing problem is one of the classical NP-hard optimization problems. In this paper, we present a simple generic approach for obtaining new fast lower bounds, based on dual feasible functions. Worst-case analysis as well as computational results show that one of our classes clearly outperforms the previous best “economical” lower bound for the bin… (More)

- Sándor P. Fekete, Jörg Schepers
- Math. Meth. of OR
- 2004

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is of crucial importance to have good and easy bounds for an optimal solution. Previous e orts have produced a number of… (More)

- Sándor P. Fekete, Jörg Schepers
- Math. Oper. Res.
- 2004

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for instances in twoor higher-dimensional space. We present a new approach for modeling packings, using a graph-theoretical… (More)

- Sándor P. Fekete, Gerhard J. Woeginger
- Comput. Geom.
- 1997

For a given set A C_ (-Tr; +Tr] of angles, the problem "Angle-Restricted Tour" (ART) is to decide whether a set P of n points in the Euclidean plane allows a closed directed tour consisting of straight line segments, such that all angles between consecutive line segments are from the set A. We present a variety of algorithmic and combinatorial results on… (More)

- Alexander Kröller, Sándor P. Fekete, Dennis Pfisterer, Stefan Fischer
- Algorithmic Aspects of Large and Complex Networks
- 2005

We present a new framework for the crucial challenge of self-organization of a large sensor network. The basic scenario can be described as follows: Given a large swarm of immobile sensor nodes that have been scattered in a polygonal region, such as a street network. Nodes have no knowledge of size or shape of the environment or the position of other nodes.… (More)

- Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich
- DATE
- 2001

We consider the optimal placement of hardware modules in space and time for FPGA architectures with reconfiguration capabilities, where modules are modeled as three-dimensional boxes in space and time. Using a graphtheoretic characterization of feasible packings, we are able to solve the following problems: (a) Find the minimal execution time of the given… (More)