S. Fekete

Publications
Influence

New classes of fast lower bounds for bin packing problems

S. Fekete, J. Schepers
Mathematics, Computer Science
Math. Program.
1 October 2001

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

A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing

S. Fekete, J. Schepers
Mathematics, Computer Science
Math. Oper. Res.
16 October 2003

We present a new approach for modeling packings, using a graph-theoretical characterization of feasible packings that share a combinatorial structure. Expand

A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems

S. Fekete, J. Schepers
Computer Science, Mathematics
Math. Methods Oper. Res.
18 February 2004

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

An Exact Algorithm for Higher-Dimensional Orthogonal Packing

S. Fekete, J. Schepers, J. V. D. Veen
Computer Science, Mathematics
Oper. Res.
11 April 2006

We develop a two-level tree search algorithm for solving higher-dimensional orthogonal packing problems to optimality. Expand

DyNoC: A dynamic infrastructure for communication in dynamically reconfugurable devices

C. Bobda, A. Ahmadinia, M. Majer, J. Teich, S. Fekete, J. V. D. Veen
Computer Science
International Conference on Field Programmable…
10 October 2005

A new paradigm to support the communication among modules dynamically placed on a reconfigurable device at run-time is presented. Expand

Approximation algorithms for lawn mowing and milling

E. Arkin, S. Fekete, J. Mitchell
Computer Science, Mathematics
Comput. Geom.
1 October 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. Expand

Neighborhood-Based Topology Recognition in Sensor Networks

S. Fekete, A. Kröller, D. Pfisterer, S. Fischer, C. Buschmann
Computer Science, Mathematics
ALGOSENSORS
17 May 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. Expand

Deterministic boundary recognition and topology extraction for large sensor networks

A. Kröller, S. Fekete, D. Pfisterer, S. Fischer
Computer Science, Mathematics
SODA '06
17 October 2005

Our algorithms work in two stages: boundary recognition and topology extraction. Expand

Tree spanners in planar graphs

S. Fekete, J. Kremer
Mathematics, Computer Science
Discret. Appl. Math.
15 February 2001

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

Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues

E. Demaine, Martin L. Demaine, +4 authors D. Souvaine
Mathematics, Computer Science
DNA
4 June 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. Expand

Recommended Authors